Robot Planning with Artificial Potential Field Guided Ant Colony Optimization Algorithm

  • Dongbin Zhao
  • Jianqiang Yi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4222)


This paper investigates the problem of robot planning with ant colony optimization and artificial potential filed algorithms. Robot planning is to find a feasible path from a source to a goal while avoiding obstacles in configuration space. Artificial potential field (APF) is verified as an efficient method to find a path by following the maximum potential field gradient. But it suffers from the local minima. However, ant colony optimization (ACO) is characterized as powerful probabilistic search ability, which is thought to be fit for solving such local minima problems. By the combination of both merits, an APF guided ACO algorithm is proposed, which shows some good features in searching for the optimal path solution. The length optimal path solution can always be achieved with the proposed hybrid algorithm in different obstacles environment from simulation results.


Path Planning Feasible Path Robot Path Artificial Potential Field Robot Path Planning 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Khatib, O.: Real-time Obstacle Avoidance for Manipulators and Mobile Robots. The Int. J. of Robotics Research 5(1), 90–98 (1986)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Rimon, E., Koditschek, D.E.: Exact Robot Navigation Using Artificial Potential Functions. IEEE Trans. on Robotics and Automation 8(5), 501–517 (1992)CrossRefGoogle Scholar
  3. 3.
    Kim, J.O., Khosla, P.K.: Real-time Obstacles Avoidance Using Harmonic Potential Function. IEEE Trans. on Robotics and Automation 8(3), 338–349 (1992)CrossRefGoogle Scholar
  4. 4.
    Connolly, C.I., Burns, J.B., Weiss, R.: Path Planning Using Laplace’s Equation. In: Proc. of the IEEE Int. Conf. on Robotics and Automation, vol. 3, pp. 2102–2106 (1990)Google Scholar
  5. 5.
    Rosell, J., Iniguez, P.: Path planning using Harmonic Functions and Probabilistic Cell Decomposition. In: Proc. of the IEEE Int. Conf. on Robotics and Automation, pp. 1803–1808 (2005)Google Scholar
  6. 6.
    Kazemi, M., Mehrandezh, M.: Robotic Navigation Using Harmonic Function-based Probabilistic Roadmaps. In: Proc. of the IEEE Int. Conf. on Robotics and Automation, pp. 4765–4770 (2004)Google Scholar
  7. 7.
    Kavraki, L.E., Svestka, P., Latombe, J.C., Overmars, M.H.: Probabilistic Roadmaps for Path Planning in High-dimensional Configuration Spaces. IEEE Trans. on Robotics and Automation 12(4), 566–580 (1996)CrossRefGoogle Scholar
  8. 8.
    Nielsen, C.L., Kavraki, L.E.: A Two Level Fuzzy PRM for Manipulation Planning. In: Proc. of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 1716–1721 (2000)Google Scholar
  9. 9.
    Lumelsky, V.J., Stepanov, A.A.: Dynamic Path Planning for A Mobile Automaton with Limited Information on The Environment. IEEE Trans. on Automatic Control AC-31(11), 1058–1063 (1986)CrossRefGoogle Scholar
  10. 10.
    Dorigo, M., Maniezzo, V., Colorni, A.: Positive Feedback as A Search Strategy, Technical Report (1991) Google Scholar
  11. 11.
    Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to The Traveling Salesman Problem. IEEE Trans. on Evolutionary Computation 1(1), 53–66 (1997)CrossRefGoogle Scholar
  12. 12.
    Stützle, T., Hoos, H.: MAX-MIN Ant System and Local Search of The Traveling Salesman Problem. In: Proc. of the IEEE Int. Conf. on Evolutionary Computation, pp. 309–314 (1997)Google Scholar
  13. 13.
    Stützle, T., Dorigo, M.: ACO Algorithms for The Traveling Salesman Problem. In: Miettinen, K., Makela, M., Neittaanmaki, P., Periaux, J. (eds.) Evolutionary Algorithms in Engineering and Computer Science. Wiley, Chichester (1999)Google Scholar
  14. 14.
    Fan, X.P., Luo, X., Yi, S., Yang, S.Y., Zhang, H.: Optimal Path Planning for Mobile Robots Based on Intensified Ant Colony Optimization Algorithm. In: Proc. of the Int. Conf. on Robotics, Intelligent Systems and Signal Processing, pp. 131–136 (2003)Google Scholar
  15. 15.
    Hu, X.B., Huang, X.Y.: Path Planning in 3-D Space for Robot Based on Ant Colony Algorithm. J. of Chongqing University 27(8), 132–135 (2004)Google Scholar
  16. 16.
    Zhao, D.B., Yi, J.Q.: A Framework of Mobile Robot Path Planning with Ant Colony Optimization. In: Proc. of the Int. Conf. on Sensing, Computing and Automation, pp. 2009–2013 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Dongbin Zhao
    • 1
  • Jianqiang Yi
    • 1
  1. 1.Laboratory of Complex Systems and Intelligence Science, Institute of AutomationChinese Academy of SciencesBeijingP.R. China

Personalised recommendations