Abstract
Local or sensor-based path planning in an unknown environment is a challenging problem for mobile robots. In completely known grid environments, the shortest Euclidean-length path connecting a given start-goal point pair can be generated using the Fast Marching Method (FMM). In contrast, in unknown environments, path planning must be reactive (i.e. based on recent sensory information) and boundary following (BF) is one type of reactive path planning technique. In [1], a hybrid method called Boundary Following FMM (BFFMM) was proposed that could extend the applicability of FMM to work well in an unknown environment using only local sensory perceptions. Bug algorithms are one family of navigation algorithms that also utilize BF technique in planning paths in unknown environments. This paper compares the path length of the paths generated by BFFMM with those by Bug1 and Bug2, the earliest versions of the Bug family algorithms to quantitatively reveal the effects of environment uncertainties on length of paths generated by navigation methods using boundary following. By comparison, BFFMM is a modest mobile robot path planner that bridges the gap between unknown and known terrain.
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
Chiang, C.H., Liu, J.S.: Boundary Following in Unknown Polygonal Environment Based on Fast Marching Method. In: IEEE International Conference on Advanced Robotics and its Social Impacts (2008)
Chiang, C.H., Chiang, P.J., Fei, J.C.C., Liu, J.S.: A Comparative Study of Implementing Fast Marching Method and A* Search for Mobile Robot Path Planning in Grid Environment: Effect of Map Resolution. In: IEEE Workshop on Advanced Robotics and its Social Impacts, pp. 7–12 (2007)
Lumelsky, V.J., Stepanov, A.A.: Dynamic Path Planning for a Mobile Automation with Limited Information on the Environment. IEEE Transactions on Automatic Control AC-31(11), 1058–1063 (1986)
Ng, J., Braunl, T.: Performance Comparison of Bug Navigation Algorithm. Journal of Intelligent and Robotic Systems 50, 73–84 (2007)
Langer, R.A., Coelho, L.S., Oliveira, G.H.C.: K-Bug, A new bug approach of mobile robot path planning. In: 16th IEEE International Conference on Control Application, Part of IEEE Multi-conference on Systems and Control, Singapore, pp. 403–408 (2007)
Rao, N.S.V., Shi, S.K.W., Ivengar, S.S.: Robot Navigation in Unknown Terrains: Introductory Survey of Non-Heuristic Algorithms. Technical Report, Oak Ridge National Laboratory (1999)
Sethian, J.A.: Level Set Methods. In: Evolving interfaces in geometry, fluid mechanics, computer vision, and materials science. Cambridge University Press, Cambridge (1999)
Kamon, I., Rivlin, E., Rimon, E.: A New Range-Sensor Based Globally Convergent Navigation Algorithm for Mobile Robots. In: Proceeding for the 1996 IEEE International Conference on Robotics and Automation, Minneapolis, Minnesota (1996)
LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chiang, C.H., Liu, JS., Chou, YS. (2009). Comparing Path Length by Boundary Following Fast Matching Method and Bug Algorithms for Path Planning. In: Chien, BC., Hong, TP. (eds) Opportunities and Challenges for Next-Generation Applied Intelligence. Studies in Computational Intelligence, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92814-0_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-92814-0_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92813-3
Online ISBN: 978-3-540-92814-0
eBook Packages: EngineeringEngineering (R0)