Application of Improved Dijkstra Path Planning Algorithm for Industrial Stacking Robots

摘要

In the path planning research of industrial robots, it is necessary to find the shortest path and reduce the search time. In this paper, A* algorithm, Dijkstra algorithm and Dynamic Programming algorithm are used to find the shortest path in the industrial workshop scenario. An improved Dijkstra algorithm is used to add additional paths considering turning angle, scene complexity and device wear.