SWARM
Coordinated multi-robot exploration based on parallelism selection genetic algorithm
Xizhe Zang
- 发表年份
- 2008
- 引用次数
- 6
摘要
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.
关键词
Computer scienceRobotGenetic algorithmParallelism (grammar)Selection (genetic algorithm)CollisionAlgorithmData parallelismArtificial intelligenceParallel computing
相关论文
OTHER
📊 26,957 引用
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
PERCEPTION
📊 22,245 引用
Artificial intelligence: a modern approach
1995
OTHER
📊 18,993 引用
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
SWARM
📊 14,853 引用
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002