Cooperative coevolution of real predator robots and virtual robots in the pursuit domain
This work addresses coordination challenges in swarm robotics for pursuit tasks, representing an incremental improvement with a novel hybrid method.
The paper tackles the predator-prey pursuit problem by developing a cooperative coevolutionary algorithm (CCPSO-R) that integrates real and virtual robots, achieving reliability, generality, and scalability in experiments with a swarm of predator robots against four prey types, and showing effectiveness compared to a baseline algorithm.
The pursuit domain, or predator-prey problem is a standard testbed for the study of coordination techniques. In spite that its problem setup is apparently simple, it is challenging for the research of the emerged swarm intelligence. This paper presents a particle swarm optimization (PSO) based cooperative coevolutionary algorithm for the (predator) robots, called CCPSO-R, where real and virtual robots coexist in an evolutionary algorithm (EA). Virtual robots sample and explore the vicinity of the corresponding real robots and act as their action spaces, while the real robots consist of the real predators who actually pursue the prey robot without fixed behavior rules under the immediate guidance of the fitness function, which is designed in a modular manner with very limited domain knowledge. In addition, kinematic limits and collision avoidance considerations are integrated into the update rules of robots. Experiments are conducted on a scalable swarm of predator robots with 4 types of preys, the results of which show the reliability, generality, and scalability of the proposed CCPSO-R. Comparison with a representative dynamic path planning based algorithm Multi-Agent Real-Time Pursuit (MAPS) further shows the effectiveness of CCPSO-R. Finally, the codes of this paper are public available at: https://github.com/LijunSun90/pursuitCCPSOR.