Optimal time reuse strategy-based dynamic multi-AGV path planning method
Complex & Intelligent Systems · 2024-10 · 10 (5) · 7089-7108
DOI: 10.1007/s40747-024-01511-2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Complex & Intelligent Systems, online erschienen am 03.07.2024. Verfasst von Ke Wang und 4 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Key Research and Development Program, Liaoning Revitalization Talents Program.
Abstract (Originalsprache)
The window strategy, known for its flexibility and efficiency, is extensively used in dynamic path planning. To further enhance the performance of the Automated Guided Vehicles (AGVs) sorting system, the two processes of AGV movement and path planning can be executed concurrently based on the window strategy. Nonetheless, difficulties in matching the computing time of the planning server with the moving time of AGVs may cause delays or reduced path optimality. To address the problem, this paper proposes an optimal time reuse strategy. The proposed solution controls computing time by managing path length for each planning instance, ensuring alignment with the moving time of AGVs to maximize path optimality and avoid delays. To achieve this, two aspects need to be considered. Firstly, on a systemic level, we control the entry rate of AGVs by adjusting the replanning period, thus avoiding congestion caused by excessive AGVs and maintaining high system efficiency. Secondly, we reversely control the computing time by adjusting the path length that needs to be planned for each single planning, so that it matches the moving time of AGVs. Simulation results show that our method outperforms existing top-performing methods, achieving task completion rates 1.64, 1.57, and 1.12 times faster across various map sizes. This indicates its effectiveness in synchronizing planning and movement times. The method contributes significantly to dynamic path planning methodologies, offering a novel approach to time management in AGV systems.
Förderung
- National Key Research and Development Program
- Liaoning Revitalization Talents Program
Zitieren
APA
Wang, K., Liang, W., Shi, H., Zhang, J., & Wang, Q. (2024). Optimal time reuse strategy-based dynamic multi-AGV path planning method. Complex & Intelligent Systems, 10(5), 7089-7108. https://doi.org/10.1007/s40747-024-01511-2
Vancouver
Wang K, Liang W, Shi H, Zhang J, Wang Q. Optimal time reuse strategy-based dynamic multi-AGV path planning method. Complex & Intelligent Systems. 2024;10(5):7089-7108. doi:10.1007/s40747-024-01511-2
BibTeX
@article{Wang2024,
author = {Wang, Ke and Liang, Wei and Shi, Huaguang and Zhang, Jialin and Wang, Qi},
title = {Optimal time reuse strategy-based dynamic multi-AGV path planning method},
journal = {Complex & Intelligent Systems},
year = {2024},
volume = {10},
number = {5},
pages = {7089--7108},
doi = {10.1007/s40747-024-01511-2}
}
EUVIMED