TY - GEN
T1 - An Improved Informed RRT*-connect Algorithm for UAVs Path Planning
AU - Wang, Yihai
AU - Li, Jie
AU - Yang, Yu
AU - Liu, Chang
AU - Tang, Qia
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - 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.
AB - 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.
KW - Path Planning
KW - RRT
KW - RRT-connect
KW - UAV
UR - https://www.scopus.com/pages/publications/85218006742
U2 - 10.1109/ICUS61736.2024.10839786
DO - 10.1109/ICUS61736.2024.10839786
M3 - Conference contribution
AN - SCOPUS:85218006742
T3 - Proceedings of 2024 IEEE International Conference on Unmanned Systems, ICUS 2024
SP - 325
EP - 333
BT - Proceedings of 2024 IEEE International Conference on Unmanned Systems, ICUS 2024
A2 - Song, Rong
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2024 IEEE International Conference on Unmanned Systems, ICUS 2024
Y2 - 18 October 2024 through 20 October 2024
ER -