Title :
Avoiding local optima with user demonstrations and low-level control
Author :
Celis, Shane ; Hornby, Gregory S. ; Bongard, Josh
Author_Institution :
Dept. of Comput. Sci., Univ. of Vermont, Burlington, VT, USA
Abstract :
Interactive Evolutionary Algorithms (IEAs) use human input to help drive a search process. Traditionally, IEAs allow the user to exhibit preferences among some set of individuals. Here we present a system in which the user directly demonstrates what he or she prefers. Demonstration has an advantage over preferences because the user can provide the system with a solution that would never have been presented to a user who can only provide preferences. However, demonstration exacerbates the user fatigue problem because it is more taxing than exhibiting preferences. The system compensates for this by retaining and reusing the user demonstration, similar in spirit to user modeling. The system is exercised on a robot locomotion and obstacle avoidance task that has an obvious local optimum. The user demonstration is provided through low-level control. The system is compared against a high-level fitness function that is susceptible to becoming trapped by a local optimum and a mid-level fitness function designed to remove the local optimum. We show that our proposed system outperforms most variants of these completely automatic methods, providing further evidence that Evolutionary Robotics (ER) can benefit by combining the intuitions of inexpert human users with the search capabilities of computers.
Keywords :
collision avoidance; evolutionary computation; legged locomotion; IEA; evolutionary robotics; interactive evolutionary algorithm; local optima; low-level control; mid-level fitness function; obstacle avoidance task; robot locomotion; search process; user demonstration; user fatigue problem; Artificial neural networks; Erbium; Evolutionary computation; Joints; Robot sensing systems;
Conference_Titel :
Evolutionary Computation (CEC), 2013 IEEE Congress on
Conference_Location :
Cancun
Print_ISBN :
978-1-4799-0453-2
Electronic_ISBN :
978-1-4799-0452-5
DOI :
10.1109/CEC.2013.6557987