Path Planning For Mobile Robot Based on Particle Swarm Optimization

被引:5
作者
Li Guangshun [1 ]
Shi Hongbo [1 ]
机构
[1] E China Univ Chem Technol, Sch Informat, Shanghai 200237, Peoples R China
来源
2008 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-11 | 2008年
关键词
Path planning; MAKLINK graph; particle swarm optimization(PSO); Dijkstra algorithm;
D O I
10.1109/CCDC.2008.4597938
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a novel particle swarm optimization algorithm which can be used in the field of path planning for mobile robot. The first step to establish the MAKLINK graph with the work space model of the mobile robot, using the Dijkstra algorithm obtained the shortest path from the start point to the goal point in the graph; then the improved algorithm of particle swarm optimization is adopted to optimize this path. The algorithm is a probability search method, which is characterized by its parallel and distributed features. Simulation results show that the proposed method is effective and can meet the demands of global path planning.
引用
收藏
页码:3290 / 3294
页数:5
相关论文
共 2 条
[1]  
Eberhart RC, 2001, IEEE C EVOL COMPUTAT, P81, DOI 10.1109/CEC.2001.934374
[2]  
Qin YQ, 2004, PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, P2473