Path Planning Algorithm for Heavy-duty AGV Based on A* Algorithm Fused with DWA
In a complex working environment, it is particularly important to automatically plan a safe and real-time path when heavy-duty AGV are used for automated transportation. The traditional A* algorithm has shortcomings in terms of low search efficiency, many redundant points and obstacle avoidance. Meanwhile, the traditional dynamic window method (DWA) is prone to falling into a local optimal solution. Therefore, this paper proposes a fusion algorithm. First, the A* algorithm is improved by using a two-way search, introducing dynamic weights in the heuristic function, and deleting redundant points. Then the dynamic obstacle avoidance strategy is introduced in the evaluation function of the DWA algorithm, and the improved A* algorithm is fused with the improved DWA algorithm. Finally, the superiority of the improved fusion algorithm is verified through simulation experiment comparison and real experiment.
Authors
- Lei Zhai (ORCID: https://orcid.org/0000-0003-2106-5981)
- Hai He (ORCID: https://orcid.org/0000-0001-7246-1197)
- Wenxia Xu (ORCID: https://orcid.org/0000-0002-1101-418X)
- Shengdong Zhu (ORCID: https://orcid.org/0000-0002-9494-1084)
- Baocheng Yu (ORCID: https://orcid.org/0009-0002-0932-6413)
- Zhiqiang Tang (ORCID: https://orcid.org/0000-0003-0710-3056)
Institutions
- Wuhan Institute of Technology (CN)
Publication Details
- Published
- 2024-09-20
- DOI
- https://doi.org/10.1109/icmra62519.2024.10809041
- Citations
- 1
- Primary Topic
- Advanced Manufacturing and Logistics Optimization
- Type
- article
- Field-Weighted Citation Impact
- 0.35
Funders
- Research and Development