Abstract
This paper proposes a hybrid path planning algorithm incorporating a global and local search mechanism for mobile robot. The global path planning is based on Voronoi graph to establish a backbone path for the map with significantly reduced nodes for the original grid map. With the use of the backbone path, the D* algorithm is adopted to determine a shortest path between the starting and end points. Taking advantages of the D* algorithm and Voronoi graph, the proposed hybrid path planning algorithm is capable of obtaining a desired path for the mobile robot, overcoming the efficiency problem while maintaining maximum safety distance from the obstacles when the mobile robot navigates in the environment.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Wen, R., Wang, H., Xie, J.: Path Planning of Mobile Robot Based on Voronoi Diagram by Approximation Structuring and Zonal Ant Colony Algorithm. In: Computational Intelligence and Software Engineering, pp. 1–4 (2009)
Guo, J., Liu, L., Liu, Q., Qu, Y.: An Improvement of D* Algorithm for Mobile Robot Path Planning in Partial Unknown Environment. In: Intelligent Computation Technology and Automation, vol. 3, pp. 394–397 (2009)
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
Lu, MC., Hsu, CC., Chen, YJ., Li, SA. (2012). Hybrid Path Planning Incorporating Global and Local Search for Mobile Robot. In: Herrmann, G., et al. Advances in Autonomous Robotics. TAROS 2012. Lecture Notes in Computer Science(), vol 7429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32527-4_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-32527-4_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32526-7
Online ISBN: 978-3-642-32527-4
eBook Packages: Computer ScienceComputer Science (R0)