UAV Obstacle Avoidance and Landing on Moving Platform Based on Improved Proximal Policy Optimization Algorithm

Addressing the autonomous obstacle avoidance and landing control problem for unmanned aerial vehicles (UAV) in complex environments, this paper proposes a GRU-P30 algorithm that combines an improved Proximal Policy Optimization (PPO) algorithm and Gated Recurrent Unit (GRU) network. Firstly, we establish a UAV kinematic model and define the constraints for obstacle avoidance and landing. Subsequently, based on these constraints, we design the state and action spaces for the deep reinforcement learning algorithm. Additionally, considering the UAV's flight characteristics, we design a potential-based nested reward function to enhance the training efficiency of the policy network. Furthermore, considering the temporal memory aspect of the UAV's obstacle avoidance and landing phase, we introduce the GRU network structure and employ the P30 algorithm with improved clipping instead of the PPO algorithm, proposing the GRU-P30 algorithm to address the trajectory planning problem for UAV obstacle avoidance and following during landing. Finally, the performance of the algorithm was validated, and simulation results showed that the GRU-P30 algorithm had the highest landing accuracy, with an average time of about 34.407 steps.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/cac63892.2024.10865633
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.25

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

UAV Obstacle Avoidance and Landing on Moving Platform Based on Improved Proximal Policy Optimization Algorithm

Jie Li, Ning Wang, Fengyu Xu, Xiang Zhou
1 citations
Robotic Path Planning Algorithms
0.25
article

UAV Obstacle Avoidance and Landing on Moving Platform Based on Improved Proximal Policy Optimization Algorithm

Jie Li, Ning Wang, Fengyu Xu, Xiang Zhou
article en
1 citations

Abstract

Addressing the autonomous obstacle avoidance and landing control problem for unmanned aerial vehicles (UAV) in complex environments, this paper proposes a GRU-P30 algorithm that combines an improved Proximal Policy Optimization (PPO) algorithm and Gated Recurrent Unit (GRU) network. Firstly, we establish a UAV kinematic model and define the constraints for obstacle avoidance and landing. Subsequently, based on these constraints, we design the state and action spaces for the deep reinforcement learning algorithm. Additionally, considering the UAV's flight characteristics, we design a potential-based nested reward function to enhance the training efficiency of the policy network. Furthermore, considering the temporal memory aspect of the UAV's obstacle avoidance and landing phase, we introduce the GRU network structure and employ the P30 algorithm with improved clipping instead of the PPO algorithm, proposing the GRU-P30 algorithm to address the trajectory planning problem for UAV obstacle avoidance and following during landing. Finally, the performance of the algorithm was validated, and simulation results showed that the GRU-P30 algorithm had the highest landing accuracy, with an average time of about 34.407 steps.

Nanjing University of Posts and Telecommunications (CN)
National Natural Science Foundation of China, Natural Science Foundation of Jiangsu Province, Major Basic Research Project of the Natural Science Foundation of the Jiangsu Higher Education Institutions, Basic Research Program of Jiangsu Province
Climate action
Openalex Percentile: Top 42%
Robotic Path Planning Algorithms
0.25
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.