Optimal path planning incorporating global and local search for mobile robots

Chen Chien Hsu*, Yuan Jun Chen, Ming Chih Lu, Shih An Li

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

This paper proposes an optimal path planning algorithm incorporating a global and local search mechanism for mobile robots. 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 optimal 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. Simulation results have confirmed the feasibility of the proposed algorithm for practical use in the real-world environment.

Original languageEnglish
Title of host publication1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012
Pages668-671
Number of pages4
DOIs
Publication statusPublished - 2012
Event1st IEEE Global Conference on Consumer Electronics, GCCE 2012 - Tokyo, Japan
Duration: 2012 Oct 22012 Oct 5

Publication series

Name1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012

Other

Other1st IEEE Global Conference on Consumer Electronics, GCCE 2012
Country/TerritoryJapan
CityTokyo
Period2012/10/022012/10/05

Keywords

  • A* algorithm
  • D* algorithm
  • Voronoi Graph
  • mobile robot
  • path planning

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Optimal path planning incorporating global and local search for mobile robots'. Together they form a unique fingerprint.

Cite this