Automated Guided Vehicle Path Planning Based on Improved Dynamic Window Approach
Logistics is a non-negligible part of the actual production, this paper starts from the modeling of the automatic guided vehicle (AGV) operation scene, and adopts the raster method for the path planning algorithm to establish the workshop map scene; and then puts forward a fusion algorithm with the goal of the minimum transport time of the AGV to plan the initial path with the D* algorithm, and improves the obstacle evaluation function of the dynamic window approach algorithm for planning corner paths, to ensure that the AGV is close to the uniform speed in order to finish the task, and the dynamic adaptability as well as the superiority of the algorithm is verified through simulation experiments, which reduces the AGV running time by about 45% and the path length by about 17% compared with the traditional D* algorithm.
Authors
- Hanyu Huang (ORCID: https://orcid.org/0000-0003-2676-0115)
- Minghai Yuan (ORCID: https://orcid.org/0000-0003-0204-0260)
- Fengque Pei (ORCID: https://orcid.org/0000-0002-9532-570X)
- Qi Yu (ORCID: https://orcid.org/0000-0002-0490-0749)
- S. Lu (ORCID: https://orcid.org/0000-0002-8814-1670)
Institutions
- Hohai University (CN)
Publication Details
- Published
- 2024-09-20
- DOI
- https://doi.org/10.1109/isrimt63979.2024.10875299
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00