An Improved Goal-bias RRT algorithm for Unmanned Aerial Vehicle Path Planning

Aiming at the problems of Rapidly-Exploring Random Tree (RRT) algorithm for Unmanned Aerial Vehicle (UAV) path planning, such as inefficient searching, no local planning, and unable to avoid dynamic obstacles effectively, an optimized Goal-bias RRT algorithm is proposed. Firstly, a probability factor is introduced to optimize the sampling method and reduce the global path planning time. Secondly, local path planning idea is introduced to avoid dynamic obstacle. Finally, a node selection strategy is used to re-planning local path so that the running speed and success rate are improved. Combined with the UAV body constraints, trajectory smoothing is carried out using cubic spline interpolation. The simulation experiment results show that the proposed method not only shortens the planning time in comparison with the Goal-bias RRT algorithm, but also has the ability to efficiently deal with dynamic path planning.

Authors

Institutions

Publication Details

Published
2024-08-04
DOI
https://doi.org/10.1109/icma61710.2024.10633102
Citations
19
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
4.73
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Improved Goal-bias RRT algorithm for Unmanned Aerial Vehicle Path Planning

Mingzhu Wei, Hongyu Zhang, Xiaomei Xie, Jin Luo et al.
19 citations
Robotic Path Planning Algorithms
4.73
article

An Improved Goal-bias RRT algorithm for Unmanned Aerial Vehicle Path Planning

Mingzhu Wei, Hongyu Zhang, Xiaomei Xie, Jin Luo, Dongjing Song, Xinhua Wang
article en
19 citations

Abstract

Aiming at the problems of Rapidly-Exploring Random Tree (RRT) algorithm for Unmanned Aerial Vehicle (UAV) path planning, such as inefficient searching, no local planning, and unable to avoid dynamic obstacles effectively, an optimized Goal-bias RRT algorithm is proposed. Firstly, a probability factor is introduced to optimize the sampling method and reduce the global path planning time. Secondly, local path planning idea is introduced to avoid dynamic obstacle. Finally, a node selection strategy is used to re-planning local path so that the running speed and success rate are improved. Combined with the UAV body constraints, trajectory smoothing is carried out using cubic spline interpolation. The simulation experiment results show that the proposed method not only shortens the planning time in comparison with the Goal-bias RRT algorithm, but also has the ability to efficiently deal with dynamic path planning.

Nanjing University of Aeronautics and Astronautics (CN)
Openalex Percentile: Top 4%
Robotic Path Planning Algorithms
4.73
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.