Iterative Motion Planning for UAVs Based on Safe Airspace Skeleton and Kinematic Feasibility Constraints

Due to adverse environmental conditions, unmanned aerial vehicles(UAVs) are more easily affected than autonomous land vehicles(ALVs), making it more difficult for the control modules to follow the generated trajectories accurately. Besides, the limited payload capacity, which can only afford low-power onboard computers and low-precision sensors, leads to unreliable upstream localization and mapping. Therefore, robust motion planning systems are essential for safe navigation in environments with dense obstacles. In this paper, Iterative Motion Planning for UAVs Based on Safe Airspace Skeleton and Kinematic Feasibility Constraints is proposed, which consists of a safe airspace skeleton generation method leveraging kinematic feasibility constraints to enhance efficiency and solution quality. A motion risk query interface is proposed to replace traditional ESDF maps, which improves safety cost query efficiency. Additionally, hard and soft constraints are integrated by a dual-layer iterative heuristic module to optimize path planning safety and efficiency. Experiments are conducted in both simulations and real world, showing that the average planning time of the method is 0.17 seconds. Furthermore, all hazardous trajectory segments are eliminated and the process does not require parameter returning in different environments, proving its adaptability in various complex scenarios.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/cac63892.2024.10864576
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Iterative Motion Planning for UAVs Based on Safe Airspace Skeleton and Kinematic Feasibility Constraints

Lingli Yu, Zhu Weiwei, Jian Ping Zhou, Zheng Tan
1 citations
Robotic Path Planning Algorithms
0.25
article

Iterative Motion Planning for UAVs Based on Safe Airspace Skeleton and Kinematic Feasibility Constraints

Lingli Yu, Zhu Weiwei, Jian Ping Zhou, Zheng Tan
article en
1 citations

Abstract

Due to adverse environmental conditions, unmanned aerial vehicles(UAVs) are more easily affected than autonomous land vehicles(ALVs), making it more difficult for the control modules to follow the generated trajectories accurately. Besides, the limited payload capacity, which can only afford low-power onboard computers and low-precision sensors, leads to unreliable upstream localization and mapping. Therefore, robust motion planning systems are essential for safe navigation in environments with dense obstacles. In this paper, Iterative Motion Planning for UAVs Based on Safe Airspace Skeleton and Kinematic Feasibility Constraints is proposed, which consists of a safe airspace skeleton generation method leveraging kinematic feasibility constraints to enhance efficiency and solution quality. A motion risk query interface is proposed to replace traditional ESDF maps, which improves safety cost query efficiency. Additionally, hard and soft constraints are integrated by a dual-layer iterative heuristic module to optimize path planning safety and efficiency. Experiments are conducted in both simulations and real world, showing that the average planning time of the method is 0.17 seconds. Furthermore, all hazardous trajectory segments are eliminated and the process does not require parameter returning in different environments, proving its adaptability in various complex scenarios.

Central South University (CN)
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.