Open AccessPath planning of intelligent mobile robot based on Dijkstra algorithm
Author(s) -
Xueyan Li
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2083/4/042034
Subject(s) - dijkstra's algorithm , computer science , motion planning , algorithm , yen's algorithm , mobile robot , a* search algorithm , shortest path problem , path (computing) , start point , robot , real time computing , artificial intelligence , graph , theoretical computer science , end point , programming language
Under the premise of grid environment modeling method, a relaxed Dijkstra algorithm is proposed to solve the problem of real-time path planning for mobile robot in large-scale and obstacle intensive working environment. Firstly, four neighborhood search is used to construct the Manhattan distance potential field from the source point to the global point in linear time, and then eight neighborhood search is performed from the target point to the source point to return a collision free and approximately optimal path. Matlab simulation results show that the algorithm is 10 times faster than dijksta algorithm and A-star algorithm, and the error of path length is within a reasonable range compared with the shortest path.