Research on Path Planning for Unmanned Charging Vehicles based on Improved A* Algorithm
As a key part of autonomous driving technology, path planning is of great value. In response to the path planning issues faced in static practical application scenarios, such as the waste of algorithmic node resources, low search efficiency, insufficient smoothness of the path, and lack of safety assurance in the algorithm, an improved bidirectional A* algorithm is proposed. Firstly, a grid map of a simulated parking lot is constructed, and the direction of the search node is controlled by the optimized heuristic function. Secondly, a further investigation is conducted on the neighboring nodes of the child nodes.. Lastly, a B-spline curve is utilized to smooth the path, enhancing the driving smoothness of the robot. The results demonstrated that the improved algorithm is more capable of planning a safe and reliable path compared to other algorithms, with a shorter duration, higher efficiency, and greater applicability to practical scenarios.
Authors
- Jinsi Zhang (ORCID: https://orcid.org/0009-0008-8044-1127)
- Huifang Bao (ORCID: https://orcid.org/0000-0003-3861-0595)
- Jie Fang (ORCID: https://orcid.org/0000-0002-1382-9884)
- Haoran Hu (ORCID: https://orcid.org/0000-0003-4016-933X)
Institutions
- West Anhui University (CN)
- Anhui Polytechnic University (CN)
Publication Details
- Published
- 2024-11-01
- DOI
- https://doi.org/10.1109/cac63892.2024.10865205
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00