Path planning for mobile robots based on improving Dijkstra algorithm
Qiaoling Ma, Ruiqi Yang, Tianjiao Lian, Gan Wang, Son Mu · 2023
In response to the traditional Dijkstra algorithm, the long search time of pheromone and the occasional redundant inflection points When the final path is obtained can lead to the inefficiency of the algorithm due to its many traversed nodes. Therefore, this paper proposes the use of pheromone calculation method to improve Dijkstra's algorithm. The experimental results show that the optimized algorithm can largely reduce the inflection points generated during path planning and reduce the movement cost of the mobile robot path finding.