An Improved Informed RRT*-connect Algorithm for UAVs Path Planning
With the widespread application of UAVs, the demand for efficient and accurate path planning algorithms has become increasingly important. This paper proposes an algorithm called Improved Informed RRT*-connect, which makes three key enhancements: bias extension, probabilistic guidance, and node clipping. These enhancements aim to optimize the algorithm's efficiency and path quality in complex environments. First, the bias extension directs the random tree growth towards the goal point; secondly, the probabilistic guidance strategy attempts to connect directly to the goal point with a certain probability after generating nodes; finally, node clipping optimization simplifies the path by removing unnecessary nodes. Preliminary experiments have been conducted to determine the optimal values for the bias extension weight parameter and the probabilistic guidance parameter. Moreover, the improved algorithm has been compared with several classical RRT algorithms in terms of cost time, path length, and node count. Simulation results show that in all four scenarios, the improved algorithm outperforms classical algorithms in terms of both search speed and path optimization performance.
Authors
- Q.R. Tang (ORCID: https://orcid.org/0000-0002-8598-4699)
- Yuhao Wang (ORCID: https://orcid.org/0009-0000-0255-2413)
- Chang Liu (ORCID: https://orcid.org/0000-0003-2195-6178)
- Jie Li (ORCID: https://orcid.org/0000-0002-7582-7630)
- Yu Yang (ORCID: https://orcid.org/0000-0002-6360-7323)
Institutions
- Beijing Institute of Technology (CN)
- Beijing University of Posts and Telecommunications (CN)
Publication Details
- Published
- 2024-10-18
- DOI
- https://doi.org/10.1109/icus61736.2024.10839786
- Citations
- 4
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 1.00