Coordinated multi-robot exploration based on parallelism selection genetic algorithm
Xizhe Zang · Jisuanji gongcheng yu sheji · 2008
How to minimize the repeated exploration or coverage is a important problem on the multi-robot exploration issue.Based on parallelism selection genetic algorithm,a new genetic algorithm with good efficiency is proposed.Simulation and experiment results show that the algorithm can decrease the probability of collision of robots and improve the efficiency of the multi-robot exploration.