Collision-Free path planning for mobile robots using chaotic particle swarm optimization
作者： Qiang Zhao , Shaoze Yan
DOI: 10.1007/11539902_77
关键词: Mathematical optimization 、 Local search (optimization) 、 Motion planning 、 Swarm intelligence 、 Computer science 、 Particle swarm optimization 、 Mobile robot 、 Multi-swarm optimization 、 Metaheuristic 、 Ant robotics
摘要: Path planning for mobile robots is an important topic in modern robotics studies. This paper proposes a new approach to collision-free path problem using the particle swarm optimization combined with chaos iterations. The algorithm run get global best as candidate solution, and then local chaotic search iterations are employed improve solution precision. effectiveness of demonstrated by three simulation examples.
springer.com
sci-hub.se 参考文章(5)
Jean-Claude Latombe, Robot Motion Planning ,(1990)
Jiang Chuanwen, Etorre Bompard, A hybrid method of chaotic particle swarm optimization and linear interior for reactive power optimisation Mathematics and Computers in Simulation. ,vol. 68, pp. 57- 65 ,(2005) , 10.1016/J.MATCOM.2004.10.003
Yuan-Qing Qin, De-Bao Sun, Ning Li, Yi-Gang Cen, Path planning for mobile robot using the particle swarm optimization with mutation operator international conference on machine learning and cybernetics. ,vol. 4, pp. 2473- 2478 ,(2004) , 10.1109/ICMLC.2004.1382219
J. Kennedy, R. Eberhart, Particle swarm optimization international conference on networks. ,vol. 4, pp. 1942- 1948 ,(2002) , 10.1109/ICNN.1995.488968
Yang Jing-hui, Chaos genetic algorithm based path planning method for mobile robot Journal of the Harbin Institute of Technology. ,(2004)