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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Improved Informed RRT*-connect Algorithm for UAVs Path Planning

Q.R. Tang, Yuhao Wang, Chang Liu, Jie Li et al.
4 citations
Robotic Path Planning Algorithms
1.00
article

An Improved Informed RRT*-connect Algorithm for UAVs Path Planning

Q.R. Tang, Yuhao Wang, Chang Liu, Jie Li, Yu Yang
article en
4 citations

Abstract

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.

Beijing Institute of Technology (CN), Beijing University of Posts and Telecommunications (CN)
Openalex Percentile: Top 21%
Robotic Path Planning Algorithms
1.00
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Improved Informed RRT*-connect Algorithm for UAVs Path Planning — Q.R. Tang, Yuhao Wang, et al. · (2024) | TGRS Research Map | TGRS