.png){kind=icon}
.png){kind=icon}
Return
Optimal time reuse strategy-based dynamic multi-AGV path planning method
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-024-01511-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Adaptive dynamic path planning
SVM fitting
Computing time
Path optimality
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K