Application of Dijkstra algorithm in robot path-planning

Huijuan Wang; Yuan Yu; Quanbo Yuan

doi:10.1109/mace.2011.5987118

ScienceGate Book Chapters

JOURNAL ARTICLE

Application of Dijkstra algorithm in robot path-planning

Huijuan Wang Yuan Yu Quanbo Yuan

Year: 2011 Pages: 1067-1069

DOI: 10.1109/mace.2011.5987118

Get Full-Text PDF Get Analytical Report

Abstract

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.

Keywords:

Dijkstra's algorithm Robot Computer science Motion planning Shortest path problem Path (computing) Pathfinding Mobile robot Yen's algorithm Algorithm A* search algorithm Mobile robot navigation Artificial intelligence Robot control Theoretical computer science Graph

Metrics

234

Cited By

2.05

FWCI (Field Weighted Citation Impact)

Refs

0.89

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Robotic Path Planning Algorithms

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Robotics and Sensor-Based Localization

Physical Sciences → Engineering → Aerospace Engineering

Modular Robots and Swarm Intelligence

Physical Sciences → Engineering → Mechanical Engineering

Application of Dijkstra algorithm in robot path-planning

Abstract

Metrics

Citation History

Topics

Related Documents

Path Planning Application using Dijkstra Algorithm on Service Robot

Path planning of robot using modified dijkstra Algorithm

Path planning of intelligent mobile robot based on Dijkstra algorithm

Bidirectional Path Planning for Autonomous Robot Using Dijkstra Algorithm with PRM

Extended Dijkstra Algorithm in Path Planning for Vision Based Patrol Robot