主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2025, Vol. 33 ›› Issue (3): 264-276.doi: 10.16381/j.cnki.issn1003-207x.2023.0429

Previous Articles     Next Articles

Research on Online Task Assignment and Global Path Planning Problem of Multi-AGV in Intelligent Warehouses

Kunpeng Li(), Xuefang Han   

  1. School of management,Huazhong University of Science and Technology,Wuhan 430074,China
  • Received:2023-03-15 Revised:2023-05-16 Online:2025-03-25 Published:2025-04-07

Abstract:

The rapid development of artificial intelligence has accelerated the intelligent transformation of warehouses, more and more warehouses have introduced a large number of AGVs to replace manual operations. The online global scheduling problem of multi-AGV in intelligent warehouses is a hot and challenging topic. It integrates task assignment and conflict-free routing, and also needs to consider constraints such as bidirectional network, conflict-free, AGV battery limitation, task time windows, etc. The objective of this problem is to minimize the sum of AGV running time and penalty cost of AGVs waiting at grids. Exploiting the structure of the problem, a mixed-integer linear programming model is established first. Meanwhile, a multi-AGV task assignment and path planning collaborative optimization algorithm is designed: firstly, an assignment algorithm is designed based on the dual priority rules of task and AGV. Secondly, considering multiple collision situations, five strategies are introduced to improve the A* algorithm and a rescheduling mechanism is set to globally plan the AGV path. To verify the performance of our algorithm, a branch-and-cut algorithm is introduced to solve small-scale problems. The results of 12 small-scale instances show that the branch-and-cut algorithm can improve the lower bound of CPLEX by 59.89% on average. The average gap between the results of our heuristic algorithm and the lower bound of the branch-and-cut algorithm is 7.23%. The results of 96 large-scale instances show that all five strategies are valid. Compared to traditional algorithms, the results are improved by our algorithm by an average of 27.69%, the solution time is shortened to within 2s, and the solution efficiency is improved by 130.01% on average. The research is not only applicable to the scheduling decision of AGVs in intelligent warehouses, but also can be extended to closed scenarios with relatively regular networks and high automation degrees, such as production workshops and automated docks, providing a reference for multi-vehicle scheduling problems with centralized global control.

Key words: intelligent warehouse, automated guided vehicles, online scheduling, path planning, branch-and-cut

CLC Number: