A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Improved Dijkstra Algorithm for Mobile Robot Path Planning and Obstacle Avoidance
2022
Computers Materials & Continua
Optimal path planning avoiding obstacles is among the most attractive applications of mobile robots (MRs) in both research and education. In this paper, an optimal collision-free algorithm is designed and implemented practically based on an improved Dijkstra algorithm. To achieve this research objectives, first, the MR obstacle-free environment is modeled as a diagraph including nodes, edges and weights. Second, Dijkstra algorithm is used offline to generate the shortest path driving the MR
doi:10.32604/cmc.2022.028165
fatcat:fktdsiznyvek7n77ychmc6lcde