Global optimal path planning for mobile robot based on improved Dijkstra algorithm and ant system algorithm

Abstract

A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.

Keywords

mobile robot / global optimal path planning / improved Dijkstra algorithm / ant system algorithm / MAKLINK graph / free MAKLINK line

References

[1] GeS S, CuiY J. New potential functions for mobile robot path planning[J]. IEEE Transactions on Robotics and Automation, 2000, 16(5): 615-620

[2] LiLei, YeTao, TanMin. Present state and future development of mobile robot technology research [J]. Robot, 2002, 24(5): 475-480(in Chinese)

[3] WangXing-ce, ZhangRu-bo, GuGuo-chang. Potential grids based on path planning for robots[J]. Journal of Harbin Engineering University, 2003, 24(2): 170-174(in Chinese)

[4] BoschianV, PruskiA. Grid modeling of robot cells: a memory-efficient approach[J]. Journal of Intelligent and robotic Systems, 1993, 8(2): 201-223

[5] ZhuangHui-zhong, DuShu-xin, WuTie-jun. Research on path planning and related algorithms for robots[J]. Bulletin of Science and Technology, 2004, 20(3): 210-215(in Chinese)

[6] YungN H C, CangYe. An intelligent mobile vehicle navigator based on fuzzy logic and reinforcement learning[J]. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 1999, 29(2): 314-321

[7] LebedevD. Neural network model for robot path planning in dynamically changing environment[J]. Modeling and Analysis of Information Systems, 2001, 18(1): 12-18

[8] LiuCai-hong, HuJi-quan, QiXiao-ning. Path design of robot with continuous space based on hybrid genetic algorithm[J]. Journal of Wuhan University of Technology (Transportation Science & Engineering), 2003, 27(6): 819-821(in Chinese)

[9] QinYuan-qing, SunDe-bao, LiNing, et al.. Path planning for mobile robot based on particle swarm optimization[J]. Robot, 2004, 26(3): 222-225(in Chinese)

[10] DorigoM, GambardellaL M. Ant colony system: a cooperative learning approach to the traveling salesman problem[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1): 53-66

[11] DorigoM, BonabeauE, TheraulazG. Ant algorithms and stigmergy[J]. Future Generation Computer Systems, 2000, 16: 851-871

[12] ManiezzoV, ColorniA. The ant system applied to the quadratic assignment problem[J]. IEEE Transactions on Knowledge Data Engineering, 1999, 11(5): 769-778

[13] DorigoM, CaroG Di, GambardellaL M. Ant algorithms for discrete optimization[J]. Artificial Life, 1999, 5(2): 137-172

[14] TanGuan-zheng, ZengQing-dong, LiWen-bin. Design of PID controller with incomplete derivation based on ant system algorithm[J]. Journal of Control Theory and Applications (English Edition), 2004, 2(3): 246-252

[15] Habib M K, Asama H. Efficient method to generate collision free paths for autonomous mobile robot based on new free space structuring approach [C]. IEEE/RSJ International Workshop on Intelligent Robots and Systems. Osaka: 1991. 563–567.

[16] YanWei-min, WuWei-minData Structure (C version) [M], 1997, Beijing, Tsinghua University Press(in Chinese)