A Rescue Robot Path Planning Based on Ant Colony Optimization Algorithm

This paper addressed a robot path planning algorithm based on improved ant colony optimization. The ant colony algorithm is used for a global path planning in robot rescue. A target attracting function is introduced to guide the searching process which can improve the search quality of ant colony algorithm in the complex and dynamic environment. The affectivity of proposed algorithm is verified in a standard test bed, RoboCupRescue simulation system.

[1]  Hiroaki Kitano,et al.  RoboCup Rescue: search and rescue in large-scale disasters as a domain for autonomous agents research , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[2]  Yoshifumi Kitamura,et al.  3-D path planning in a dynamic environment using an octree and an artificial potential field , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.

[3]  L. Tarassenko,et al.  Robot path planning using resistive grids , 1991 .

[4]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.