Abstract
Navigation of mobile robots remains one of the most challenging functions to carry out. Potential Field Method (PFM) is rapidly gaining popularity in navigation and obstacle avoidance applications for mobile robots because of its elegance. Here a modified potential field method for robots navigation has been described. The developed potential field function takes care of both obstacles and targets. The final aim of the robots is to reach some pre-defined targets. The new potential function can configure a free space, which is free from any local minima irrespective of number of repulsive nodes (obstacles) in the configured space. There is a unique global minimum for an attractive node (target) whose region of attraction extends over the whole free space. Simulation results show that the proposed potential field method is suitable for navigation of several mobile robots in complex and unknown environments.
Similar content being viewed by others
References
Khatib O (1986) Real-time obstacle avoidance for manipulators and mobile robots. Int J Robot Res 5(1):90–98
Borenstein J, Koren Y (1989) Real-time obstacle avoidance for fast mobile robots. IEEE Trans Syst Man and Cybern 19(5):1179–1187
Garibotto G, Masciangelo S (1991) Path planning using the potential field approach for navigation. Adv Robot, Robots in Unstruct Envir, 91 ICAR 2:1679–1682
Kim JO, Khosla PK (1992) Real-time obstacle avoidance using harmonic potential functions. IEEE Trans Robot Autom 8(3):338–349
Rimon E, Koditschek DK (1992) Exact robot navigation using artificial potential functions. IEEE Trans Robot Autom 8(5):501–518
Ratering S, Gini M (1995) Robot navigation in a known environment with unknown moving obstacles. Auton Robot 1:149–165
Guldner J, Utkin VI, Hashimoto H, Harashima F (1995) Tracking gradients of artificial potential fields with non-holonomic mobile robots. In: Proceedings of the American Control Conferences, pp 2803–2804
Al-Sultan KS, Aliyu MDS (1996) A New Potential Field-Based Algorithm for Path Planning. J Intell Robotic Syst 17(3):265–282(18)
Yun X, Tan K-C (1997) A wall-Following Method for Escaping Local Minima in Potential Field Based Motion Planning. In: Proceedings of International Conference on Advanced Robotics, ICAR ’97, pp 421–426
Chuang J-H, Ahuja N (1998) An Analytically Tractable Potential Field Model of Free Space and Its Application in Obstacle Avoidance. IEEE Trans Syst, Man, and Cybern—Part B: Cybernetics 28(5):729–736
McFetridge L, Yousef Ibrahim M (1998) New technique of mobile robot navigation using a hybrid adaptive fuzzy potential field approach. Comp Indust Engin 35(3–4):471–474
Sekhawat S, Chyba M (1999) Nonholonomic Deformation of a Potential Field for Motion Planning. In: Proceedings of the 1999 IEEE, International Conference on Robotics and Automation, pp 817–822
Liu C, Ang MH Jr, Krishnan H, Lim SY (2000) Virtual obstacle Concept for Local-minimum-recovery in Potential-field Based Navigation. In: Proceedings of the 2000 IEEE International Conference on Robotics & Automation, San Francisco, CA, pp 983–988
Wang Y, Chirikjian GS (2000) A New Potential Field Method for Robot Path Planning. In: Proceedings of the 2000 IEEE, International Conference on Robotics and Automation, pp 977–982
Park MG, Jeon JH, Lee MC (2001) Obstacle avoidance for mobile robots using artificial potential field approach with simulated annealing. IEEE International Symposium on Industrial Electronics, pp 1530–1535
Park MG, Lee MC (2002) Experimental evaluation of robot path planning by artificial potential field approach with simulated annealing. SICE 2002. In: Proceedings of the 41st SICE Annual Conference vol 4, pp 2190–2195
Song P, Kumar VA (2002) potential field based approach to multi-robot manipulation. In: Proceeding of IEEE International Conference on Robotics and Automation, pp 1217–1222
Xi-yong Z, Jing Z (2003) Virtual local target method for avoiding local minimum in potential field based robot navigation. J Zhejiang University SCIENCE 4(3):264–269
Author information
Authors and Affiliations
Corresponding author
Additional information
Saroj Kumar Pradhan is faculty of Mechanical Engineering Department with N.I.T., Hamirpur, HP, India. He has received his B.E. degree in Mechanical Engineering from Utkal University and M.E. in Machine Design and Analysis from NIT Rourkela. He has published more than 17 technical papers in international journals and conference proceedings. His areas of research include mobile robots navigation and vibration of multilayred beams.
Dayal R. Parhi is working as Assistant Professor at NIT Rourkela, India. He has obtained his first Ph.D. degree in “Mobile Robotics” from United Kingdom and Second Ph.D. in “Mechanical Vibration” from India. He has visited CMU, USA as a “Visiting Scientist” in the field of “Mobile Robotics”. His main areas of current research are “Robotics” and “Mechanical Vibration”. He is supervising five Ph.D. students in the fields of Robotics and Vibration. Email: dayalparhi@yahoo.com.
Anup Kumar Panda Received his M.Tech degree from IIT, Kharagpur in 1993 and Ph.D. degree from Utkal University in 2001. He is currently an assistant professor in the Department of Electrical Engineering at National Institute of Technology, Rourkela, India. His areas of research include robotics, Machine Drives, harmonics and power quality. He has published more than 30 technical papers in journals and conference proceedings. He is now involved in two R&D projects funded by Government of India.
R. K. Behera is a Senior Lecturer of Mechanical Engineering at National Institute of Technology, Rourkela, India. He has been working as lecturer for more than 10 years. He obtained his BE degree from IGIT, Sarang, of Utkal University. He obtained his ME and Ph.D degrees, both in the field of mechanical engineering from NIT Rourkela.
Rights and permissions
About this article
Cite this article
Pradhan, S.K., Parhi, D.R., Panda, A.K. et al. Potential field method to navigate several mobile robots. Appl Intell 25, 321–333 (2006). https://doi.org/10.1007/s10489-006-0110-3
Issue Date:
DOI: https://doi.org/10.1007/s10489-006-0110-3