Path Planning Design of Warehouse Handling Robot Based on Dynamic Improved Dijkstra Algorithm

摘要

The logistics and warehousing industry is currently encountering novel opportunities and challenges. To address the path optimization problem when dealing with multi-objective storage and handling robots, this study proposes a path planning model for storage and handling robots utilizing a dynamic improved Dijkstra algorithm. The first step involves designing a suspended storage and handling robot system, followed by modeling a storing environment. Then, the traditional Dijkstra method is improved and a multi-objective dynamic path planning model on the foundation of this new method is built. The results indicate that, in the simulation test, the total travel time planned by the Dijkstra algorithm with dynamic improvements is 6.4 seconds less than that planned by the traditional Dijkstra algorithm. The average travel time of the dynamic improved Dijkstra algorithm is 21.27s, 22.1s, and 23.05s for 6, 8, and 10 tasks, respectively. These times are smaller than those of the traditional Dijkstra's algorithm, indicating that this new method can reduce the average travel time of the handling robot with some stability. In summary, the model constructed by the study has a good application effect in the path planning of multi-objective warehouse handling robot.