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.
Advances in Autonomous Robotics: Joint Proceedings of the 13th Annual TAROS Conference and the 15th Annual FIRA RoboWorld Congress, pp.441-443