Tws-based Path Planning of Multi-Agvs for Logistics Center Auto-Sorting

With the development of automation and intelligent technology, automatic guided vehicles (AGVs) are more and more widely used in Industrial and commercial scenarios. Especially in intelligent warehouses, the path planning of multi AGVs has become the focus of research. Effective path planning can improve the operational efficiency of the AGVs system, reduce energy consumption, and ensure operational safety. However, due to the influence of various factors, such as environment complexity, task conflict, load variation, etc., the multi-AGVs path planning becomes extremely complicated. This paper studied the multi-AGVs path planning problem for intelligent warehousing in logistics centers, so as to promote the automatic sorting of logistics centers. For a warehouse map of a given logistics center, the goal is to transport the maximum amount of goods between different sources and destinations within a specified time frame with the least amount of AGVs. The method includes transforming the warehouse map into a directed graph to frame the problem. This paper introduced two heuristic algorithms to schedule the AGVs path without collision. Experimental results demonstrate that the proposed methods outperform existing approaches, achieving higher sorting throughput within a given time while utilizing fewer vehicles.