Abstract
This paper addresses the problem of path planning for a mobile robot in a region occupied by finite number obstacles. The region and the obstacles are not known a priori to the robot. We present an online path planning algorithm called EgressBug, that makes the robot reach any specified point in the space, and stops by reporting failure when the specified goal point does not belong to the free space. The proposed EgressBug algorithm uses simple move toward a point and wall following behaviors. The algorithm is illustrated with the help of examples, and paths generated by the EgressBug algorithm are compared with those generated by the Bug2 and TangentBug algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Liu, Y.-H., Arimoto, S.: Path planning using a tangent graph for mobile robots among polygonal and curved obstacles. International Journal of Robotics Research 11(4), 376–382 (1992)
Ge, S.S., Cui, Y.J.: New potential functions for Mobile robot path planning. IEEE Transactions on Robotics and Automation 16(5), 615–620 (2000)
Zhang, T., Zhu, Y., Song, J.: Real-time motion planning for mobile robots by means of artificial potential field method in unknown environment. Industrial Robot: An International Journal 37(4), 384–400 (2010)
Lumelsky, V., Stepanov, A.A.: Path-planning strategies for a point mobile automaton moving admist unknown obstacles of aribitrary shape. Algorithmica 2, 403–430 (1987)
Lumelsky, V., Skewis, T.: Incorporating range sensing in the robot navigation function. IEEE Transactions on System, Man, Cybernetics 20(5), 1058–1069 (1990)
Sankaranarayanan, A., Vidyasagar, M.: A new path planning algorithm for moving a point object admist unkown obstacles in a plane. In: Proc. of IEEE International Conference on Robotics and Automation, pp. 1930–1936 (1990)
Noborio, H., Yoshioka, T.: An on-line and deadlock-free path planning algorithm based on world topology. In: Proc. of IEEE/RSJ International Conference on Intelligent Robots and Systems, Yakohama, Japan, pp. 1425–1430 (1993)
Kamon, I., Rimon, E., Rivlin, E.: TangentBug: A range-sensor-based navigation algorithm. International Journal of Robotics Resaerch 17(9), 934–953 (1998)
Langer, R.A., Coelho, L.S., Oliveira, G.H.C.: K-Bug: A new bug approach for mobile robot’s path planning. In: Proc. of IEEE Conference on Decision and Control, Singapore, pp. 403–408 (2007)
Buniamin, N., Wan Ngah, W.A.J., Sariff, N., Mohamad, Z.: A simple local path planning algorithm for autonomous mobile robots. International Journal of Systems Applications, Engineering & Development 5(2), 151–159 (2011)
Ng, J.S., Bräunl, T.: Performance comparison of Bug navigation algorithms. Journal of Intelligent & Robotic Systems 50(1), 73–84 (2007)
Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L.E., Thrun, S.: Principles of Robot Motion-Theory, Algorithms, and Implementation. The MIT Press, Cambridge (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guruprasad, K.R. (2012). EgressBug: A Real Time Path Planning Algorithm for a Mobile Robot in an Unknown Environment. In: Thilagam, P.S., Pais, A.R., Chandrasekaran, K., Balakrishnan, N. (eds) Advanced Computing, Networking and Security. ADCONS 2011. Lecture Notes in Computer Science, vol 7135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29280-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-29280-4_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29279-8
Online ISBN: 978-3-642-29280-4
eBook Packages: Computer ScienceComputer Science (R0)