An Efficient Trajectory Planning Algorithm for UAV

Proper trajectory planning can ensure flight safety, facilitate Unmanned aerial vehicle(UAV) efficiency and reduce cost. A trajectory planning strategy is proposed in this paper, which combines depth and breadth exploration based on enhanced kd-tree algorithm. The simulation results show that compared with the traditional PRM algorithm, RRT algorithm, RRT<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">*</sup> algorithm, 4-neighborhood A* algorithm and 8-neighborhood A* algorithm. This paper reduces runtime by 61.81% at most, and the distance by 25.65% at most in general environment. And it reduces runtime by 84.53% at most, and the distance by 67.16% at most in narrow environment. The proposed algorithm also has others advantages. Specifically, the planned trajectory is farther away from the obstacles, the number of turns in the trajectory is less, the turning angle is larger and the higher the success rate of trajectory planning in narrow environment, which ensures the safety of UAV flight.

Authors

Institutions

Publication Details

Published
2025-03-21
DOI
https://doi.org/10.1109/icaace65325.2025.11020028
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Trajectory Planning Algorithm for UAV

Xin Liu, Jialiang Liu, Huan Wang, Yanxia Liang et al.
1 links
Robotic Path Planning Algorithms
article

An Efficient Trajectory Planning Algorithm for UAV

Xin Liu, Jialiang Liu, Huan Wang, Yanxia Liang, Hua He, Xiaofan Zhao, Songlin Zhao
article en

Abstract

Proper trajectory planning can ensure flight safety, facilitate Unmanned aerial vehicle(UAV) efficiency and reduce cost. A trajectory planning strategy is proposed in this paper, which combines depth and breadth exploration based on enhanced kd-tree algorithm. The simulation results show that compared with the traditional PRM algorithm, RRT algorithm, RRT<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">*</sup> algorithm, 4-neighborhood A* algorithm and 8-neighborhood A* algorithm. This paper reduces runtime by 61.81% at most, and the distance by 25.65% at most in general environment. And it reduces runtime by 84.53% at most, and the distance by 67.16% at most in narrow environment. The proposed algorithm also has others advantages. Specifically, the planned trajectory is farther away from the obstacles, the number of turns in the trajectory is less, the turning angle is larger and the higher the success rate of trajectory planning in narrow environment, which ensures the safety of UAV flight.

Xi’an University of Posts and Telecommunications (CN), Shaanxi Normal University (CN)
Openalex Percentile: Top 89%
Robotic Path Planning Algorithms
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.