Continuity Path Planning for UAV with Enhanced Douglas-Peucker Algorithm

This paper proposes a continuous path planning method, where Deep Q-network (DQN) is employed for initial grid map path planning, followed by the enhanced Douglas-Peucker (DP) algorithm to address obstacles, and culminating in the generation of discrete path points using curvature-continuous Bézier curves. First, for grid maps, an unmanned aerial vehicle (UAV) path planning method is designed, utilizing the DQN algorithm to generate a discrete set of path points. Second, an enhanced DP algorithm is used to filter the discrete path points in an environment with obstacles. Then, the filtered set of path points is smoothed using Bézier curves with continuous curvature to conform to the flight physical characteristics of the fixed-wing UAV. Finally, the effectiveness of the proposed path planning and smoothing algorithm is verified through numerical simulations and comparative simulations in a grid map environment with random obstacles.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icus61736.2024.10839909
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

Continuity Path Planning for UAV with Enhanced Douglas-Peucker Algorithm

Liyan Wen, Xiuhui Peng, Renkai Yi, Shiyu Lv
Robotic Path Planning Algorithms
article

Continuity Path Planning for UAV with Enhanced Douglas-Peucker Algorithm

Liyan Wen, Xiuhui Peng, Renkai Yi, Shiyu Lv
article en

Abstract

This paper proposes a continuous path planning method, where Deep Q-network (DQN) is employed for initial grid map path planning, followed by the enhanced Douglas-Peucker (DP) algorithm to address obstacles, and culminating in the generation of discrete path points using curvature-continuous Bézier curves. First, for grid maps, an unmanned aerial vehicle (UAV) path planning method is designed, utilizing the DQN algorithm to generate a discrete set of path points. Second, an enhanced DP algorithm is used to filter the discrete path points in an environment with obstacles. Then, the filtered set of path points is smoothed using Bézier curves with continuous curvature to conform to the flight physical characteristics of the fixed-wing UAV. Finally, the effectiveness of the proposed path planning and smoothing algorithm is verified through numerical simulations and comparative simulations in a grid map environment with random obstacles.

Nanjing University of Aeronautics and Astronautics (CN)
Openalex Percentile: Top 74%
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.