Application of Dijkstra algorithm in robot path-planning

In this paper, the robot is a maze robot. Dijkstra algorithm is used in the robot path planning. The shortest path is selected in the process of barrier. Simulation results prove the model valid; it can effectively solve the maze robot path planning.

Saved in:
Bibliographic Details
Published in2011 Second International Conference on Mechanic Automation and Control Engineering pp. 1067 - 1069
Main Authors Huijuan Wang, Yuan Yu, Quanbo Yuan
Format Conference Proceeding
LanguageEnglish
Japanese
Published IEEE 01.07.2011
Subjects
Dijkstra algorithm
Legged locomotion
Path planning
Robot
Robot kinematics
Robot sensing systems
Simulation
Online AccessGet full text
ISBN1424494362
9781424494361
DOI10.1109/MACE.2011.5987118

Cover

More Information
Summary:In this paper, the robot is a maze robot. Dijkstra algorithm is used in the robot path planning. The shortest path is selected in the process of barrier. Simulation results prove the model valid; it can effectively solve the maze robot path planning.
ISBN:1424494362
9781424494361
DOI:10.1109/MACE.2011.5987118