Optimal path planning incorporating global and local search for mobile robots

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

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

7 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 Dec 1
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
CountryJapan
CityTokyo
Period12/10/212/10/5

Fingerprint

Motion planning
Mobile robots
Local search (optimization)

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Hsu, C-C. J., Chen, Y. J., Lu, M. C., & Li, S. A. (2012). Optimal path planning incorporating global and local search for mobile robots. In 1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012 (pp. 668-671). [6379947] (1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012). https://doi.org/10.1109/GCCE.2012.6379947

Optimal path planning incorporating global and local search for mobile robots. / Hsu, Chen-Chien James; Chen, Yuan Jun; Lu, Ming Chih; Li, Shih An.

1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012. 2012. p. 668-671 6379947 (1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012).

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

Hsu, C-CJ, Chen, YJ, Lu, MC & Li, SA 2012, Optimal path planning incorporating global and local search for mobile robots. in 1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012., 6379947, 1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012, pp. 668-671, 1st IEEE Global Conference on Consumer Electronics, GCCE 2012, Tokyo, Japan, 12/10/2. https://doi.org/10.1109/GCCE.2012.6379947
Hsu C-CJ, Chen YJ, Lu MC, Li SA. Optimal path planning incorporating global and local search for mobile robots. In 1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012. 2012. p. 668-671. 6379947. (1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012). https://doi.org/10.1109/GCCE.2012.6379947
Hsu, Chen-Chien James ; Chen, Yuan Jun ; Lu, Ming Chih ; Li, Shih An. / Optimal path planning incorporating global and local search for mobile robots. 1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012. 2012. pp. 668-671 (1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012).
@inproceedings{755f064d894e4b05a5694907d712414c,
title = "Optimal path planning incorporating global and local search for mobile robots",
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.",
keywords = "A* algorithm, D* algorithm, Voronoi Graph, mobile robot, path planning",
author = "Hsu, {Chen-Chien James} and Chen, {Yuan Jun} and Lu, {Ming Chih} and Li, {Shih An}",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/GCCE.2012.6379947",
language = "English",
isbn = "9781467315005",
series = "1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012",
pages = "668--671",
booktitle = "1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012",

}

TY - GEN

T1 - Optimal path planning incorporating global and local search for mobile robots

AU - Hsu, Chen-Chien James

AU - Chen, Yuan Jun

AU - Lu, Ming Chih

AU - Li, Shih An

PY - 2012/12/1

Y1 - 2012/12/1

N2 - 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.

AB - 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.

KW - A algorithm

KW - D algorithm

KW - Voronoi Graph

KW - mobile robot

KW - path planning

UR - http://www.scopus.com/inward/record.url?scp=84872352475&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84872352475&partnerID=8YFLogxK

U2 - 10.1109/GCCE.2012.6379947

DO - 10.1109/GCCE.2012.6379947

M3 - Conference contribution

SN - 9781467315005

T3 - 1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012

SP - 668

EP - 671

BT - 1st IEEE Global Conference on Consumer Electronics 2012, GCCE 2012

ER -