Cooperative Robot Swarm Locomotion Using Genetic Algorithms

This paper focuses on the design of a decentralized controller for cooperative locomotion in a swarm of robotic agents. Each agent is assumed to be able to locomote over even terrain, grasp other robots, and climb onto a stack of robots. Genetic algorithms and genetic programming methods are applied to develop locomotion controllers for single units as well as decentralized controllers intended to allow the swarm of units to pass over uneven terrain that no single unit can surmount. The goal is to develop a system that provides a high probability of large numbers of units passing through sets of test obstacles. The results are shown through simulation exercises.

[1]  Abdellatif Rahmoun,et al.  Highlights on the evolutionary engineering approach: the EE-method , 2001, Proceedings ACS/IEEE International Conference on Computer Systems and Applications.

[2]  B.E. Bishop,et al.  Swarm technology for search and rescue through multi-sensor multi-viewpoint target identification , 2005, Proceedings of the Thirty-Seventh Southeastern Symposium on System Theory, 2005. SSST '05..

[3]  Hui-Yi Liu,et al.  Multi-Robot Cooperation Coalition Formation Based on Genetic Algorithm , 2006, 2006 International Conference on Machine Learning and Cybernetics.

[4]  Luca Maria Gambardella,et al.  SWARM Robotics: A Different Approach to Service Robotics , 2002 .

[5]  Ron Sun,et al.  A comparison of team evolution operators , 2004 .

[6]  B.E. Bishop,et al.  Control of Heterogeneous Combat Swarms , 2007, 2007 Thirty-Ninth Southeastern Symposium on System Theory.

[7]  Kagan Tumer,et al.  Distributed evaluation functions for fault tolerant multi-rover systems , 2006, GECCO '06.

[8]  Kalyanmoy Deb,et al.  Introducing Robustness in Multi-Objective Optimization , 2006, Evolutionary Computation.

[9]  B.E. Bishop,et al.  Evaluation of robot swarm control methods for underwater mine countermeasures , 2004, Thirty-Sixth Southeastern Symposium on System Theory, 2004. Proceedings of the.