Evolving robust behaviors for robots has proven to be a challenging problem. Determining how to optimize behavior for a specific instance, while also realizing behaviors that generalize to variations on the problem often requires highly customized algorithms and problem-specific tuning of the evolutionary platform. Algorithms that can realize robust, generalized behavior without this customization are therefore highly desirable. In this paper, we examine the Lexicase selection algorithm as a possible general algorithm for a wall crossing robot task. Previous work has resulted in specialized strategies to evolve robust behaviors for this task. Here, we show that Lexicase selection is not only competitive with these strategies but after parameter tuning, actually exceeds the performance of the specialized algorithms.

This content is only available as a PDF.
This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.