SWARM
Coordinated multi-robot exploration based on parallelism selection genetic algorithm
Xizhe Zang
- Year
- 2008
- Citations
- 6
Abstract
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.
Keywords
Computer scienceRobotGenetic algorithmParallelism (grammar)Selection (genetic algorithm)CollisionAlgorithmData parallelismArtificial intelligenceParallel computing
Related papers
OTHER
📊 26,957 cites
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
PERCEPTION
📊 22,245 cites
Artificial intelligence: a modern approach
1995
OTHER
📊 18,993 cites
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
SWARM
📊 14,853 cites
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002