A Robust Multi-AGV Cooperative Path Planning Method Considering Spatiotemporal Distance
With the widespread application of Automated Guided Vehicles (AGVs) in warehousing and logistics systems, the optimization of multi-AGV path planning has become a critical issue. Current methods primarily focus on minimizing operating time and energy consumption but often overlook spatiotemporal distances between paths, leading to frequent path conflicts and interferences in the system. This paper proposes a neural network based time window estimation model, designed to generate time windows that better align with dynamic environments. Based on this model, we introduce a collaborative multi-AGV path planning method that optimizes spatiotemporal distances between paths. Compared to the Conflict-Based Search (CBS) method, this approach significantly improves the spatiotemporal distance between AGVs during task execution, enhancing the robustness of AGV clusters while only marginally increasing time costs.
Authors
- Mingchang Lian (ORCID: https://orcid.org/0009-0006-7629-3964)
- Songhang Chen (ORCID: https://orcid.org/0000-0002-4906-9688)
- Maolin Chen (ORCID: https://orcid.org/0009-0006-4614-364X)
Institutions
- Chinese Academy of Sciences (CN)
- Fujian Institute of Research on the Structure of Matter (CN)
- Fuzhou University (CN)
Publication Details
- Published
- 2024-10-11
- DOI
- https://doi.org/10.1109/icceic64099.2024.10775744
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00