Open AccessReliability oriented multi-AGVs online scheduling and path planning problem of automated sorting warehouse system
Author(s) -
Nana Yu,
Tong Li,
Bo-Qun Wang,
Shengyun Yuan,
Y Wang
Publication year - 2021
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/1043/2/022035
Subject(s) - computer science , scheduling (production processes) , sorting , sort , path (computing) , grid , sorting algorithm , real time computing , distributed computing , engineering , algorithm , database , operations management , computer network , mathematics , geometry
The automated sorting warehouses are operated by multiple AGVs simultaneously, which can quickly sort a large number of packages. How to solve the problems of multi-AGVs scheduling, path planning and conflict resolution is the key to the reliable and rapid operation of the warehouse system. In order to improve the reliability and sorting efficiency of the system, the objective of this paper is to minimize the maximum handling completion time. Firstly, a multi-AGVs path planning algorithm based on Grid Blocking Degree (GBD) is proposed. This algorithm can plan a conflict-free handling path for each handling task of each AGV, and update the path dynamically according to the real-time traffic congestion. Furthermore, aiming at the comprehensive optimization of scheduling and path planning, a scheduling algorithm based on priority rules is proposed to determine the handling task for AGVs. The data experiments compare the difference of the solution effect of different priority rules, and verify the effectiveness of the algorithm proposed in this paper.