Reliability oriented multi-AGVs online scheduling and path planning problem of automated sorting warehouse system

Abstract

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.

An integrated automated guided vehicle design problem and preventive maintenance planning

“…In order to transform the bi-objective model to single-objective, they apply a perceptron neural network. Yu et al [62] considered a reliability-based AGV online scheduling and conflict-free routing in warehouse system where AGVs quickly sort a large number of packages. The main difference between our proposed model and other approaches in other paper is that the proposed model considers PM as an AGV capacity reducer and also the probability of AGV failure reducer in a multiple AGV system.…”

Methodology for Determining the Rational Technology for Moving Goods in the Warehouse

“…Диспетчеризація автоматизованих керованих транспортних засобів (АКТЗ) має важливе значення для ефективного горизонтального транспортування на автоматизованих складах [1][2][3][4][5][6]. Ефективне планування перевезень АКТЗ може зменшити енергоспоживання обладнання та скоротити час виконання завдань.…”

A Machine Learning-Based Approach for Multi-AGV Dispatching at Automated Container Terminals

“…Accordingly, a metaheuristic-based adaptive large neighborhood search algorithm was proposed to assign transportation requests and process sequences, as well as other task information, with the minimum travel and tardiness costs. Yu et al [13] focused on multi-AGV online scheduling and path planning in automated sorting warehouses and introduced the grid blocking degree to the path planning algorithm. Through the improved algorithm, six priority rules were designed and further improved to develop conflict-free paths for multiple AGVs.…”

“…In this study, the path distribution of AGVs is taken into consideration, and machine learning and CNP are combined as a novel approach. Multi-AGV online scheduling in warehouses Improved path planning algorithm with grid blocking degree Yu et al [13] AGV conflict-free path planning to minimize distances Dijkstra depth-first search algorithm Zhong et al [5] AGV conflict-free path planning to minimize energy consumption A branch and bound algorithm Li et al [16] AGV path planning in MVPD problem A receding horizon planning methodology Xin et al [17] AGV dispatching and container storage allocation GA Luo & Wu [19] Integrated scheduling considering AGV conflicts An approach based on the conflict resolution strategy and bilevel adaptive GA Ji et al [21] AGV online dispatching An online preference learning algorithm Choe et al [34] AGV anti-conflict path at ACT MADDPG combining reinforcement learning Hu et al [35]…”