Numerical Potential Field and Ant Colony Optimization Based Path Planning in Dynamic Environment

A new path planning method is developed in this paper for mobile robot navigation. A novel method called numerical potential field is employed to model the environment the robot resides in. The locomotion of the obstacles is taken into considerations by varying the local potential values. The concepts of reachable place and reachable field are defined. Ant colony optimization method is then applied to perform the path search. The trap position problem and its solution are also discussed. Experiments showed the effectiveness of the algorithm

[1]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[2]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Paul M. Griffin,et al.  Path planning for a mobile robot , 1992, IEEE Trans. Syst. Man Cybern..

[4]  G. Swaminathan.  Robot Motion Planning , 2006 .

[5]  Kyu Ho Park,et al.  A fast path planning by path graph optimization , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[6]  Shuzhi Sam Ge,et al.  New potential functions for mobile robot path planning , 2000, IEEE Trans. Robotics Autom..

[7]  Leo Dorst,et al.  Differential A* , 2002, IEEE Trans. Knowl. Data Eng..

[8]  Yoram Koren,et al.  Potential field methods and their inherent limitations for mobile robot navigation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[9]  S. N. Maheshwari,et al.  Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles , 2000, SIAM J. Comput..

[10]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..