Path Optimization Technology for Intelligent Warehousing Robots Based on Dijkstra Algorithm

DOI

10.2991/978-94-6463-823-3_35How to use a DOI?

Keywords

Storage Robot; Dijkstra Algorithm; Safety and Efficiency; Path Planning; Mixed Method

Abstract

As Internet technology advances, there is an increasing demand for online shopping and mailing services worldwide, which indirectly requires the improvement of warehouse robot path planning technology. The Dijkstra algorithm is favored by technicians due to its superior growth potential and is commonly used to solve path planning problems for warehouse robots. However, due to the increasing complexity of warehouse environments and the density of robots, the commonly used traditional Dijkstra algorithm can no longer guarantee that warehouse robots can efficiently and quickly complete tasks without collisions. Therefore, this article first explores the working principle of Dijkstra algorithm and analyzes two commonly used path planning techniques based on improved Dijkstra algorithm. The analysis reveals that these methods result in paths 20% longer and turning angles 30% larger than optimal solutions. This paper examined two hybrid Dijkstra algorithms that are employed in different contexts in order to identify a better solution for the path planning problem of warehouse robots. The data shows that the Bayesian-Dijkstra hybrid algorithm significantly improves warehouse robot safety, while the latter has made a huge contribution to solving congestion and collision problems. Compared with traditional algorithms, if these two algorithms are applied to warehouse robot path planning, the efficiency and safety of the warehouse system will be greatly improved.

Copyright

© 2025 The Author(s)

Open Access

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

TY  - CONF
AU  - Hongkun Cheng
PY  - 2025
DA  - 2025/08/31
TI  - Path Optimization Technology for Intelligent Warehousing Robots Based on Dijkstra Algorithm
BT  - Proceedings of the 2025 3rd International Conference on Image, Algorithms, and Artificial Intelligence (ICIAAI 2025)
PB  - Atlantis Press
SP  - 357
EP  - 365
SN  - 2352-538X
UR  - https://doi.org/10.2991/978-94-6463-823-3_35
DO  - 10.2991/978-94-6463-823-3_35
ID  - Cheng2025
ER  -