Frontier-Guide Planner for UAV Navigation in Challenging Long-Continuous Obstacle Environments

Recent advancements in unmanned aerial vehicles (UAVs) path planning have shown promise in indoor obstacle-filled and outdoor forest environments, where obstacles are typically of low continuity. In such environments, suboptimal solutions are often close to safe solutions, allowing optimizers to efficiently refine dangerous trajectories. However, in environments with long-continuous obstacles, such as indoor buildings and complex mazes, existing local planning methods face significant challenges. These methods often fail to escape unsafe suboptimal solutions promptly, which can lead to mission failure. In this paper, the Frontier-Guide Planner is proposed to expand the application scenarios of UAVs. First, a mixed sampling method combining uniform and Gaussian approaches is employed to extract high-quality viewpoints from the frontier. Subsequently, the viewpoints are evaluated using the existing environmental information, and the optimal viewpoint is selected as the guiding point. Finally, a safe trajectory based on the perceptual space is generated to guide the flight. The carefully designed simulation comparative experiments have demonstrated the applicability of the proposed method in both dense forest and long-continuous obstacle environments. Compared with existing frontier-based planning algorithms, the task completion time is reduced by 2% to 17%, and the success rate is increased by 14% to 32%.

Authors

Institutions

Publication Details

Published
2025-05-23
DOI
https://doi.org/10.1109/icaisisas64483.2025.11051869
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

Frontier-Guide Planner for UAV Navigation in Challenging Long-Continuous Obstacle Environments

Haikuo Liu, Yanmin Liu, Zhen Li, Yuhang Liu et al.
Robotic Path Planning Algorithms
article

Frontier-Guide Planner for UAV Navigation in Challenging Long-Continuous Obstacle Environments

Haikuo Liu, Yanmin Liu, Zhen Li, Yuhang Liu, Yan Yang, Yi Cui
article en

Abstract

Recent advancements in unmanned aerial vehicles (UAVs) path planning have shown promise in indoor obstacle-filled and outdoor forest environments, where obstacles are typically of low continuity. In such environments, suboptimal solutions are often close to safe solutions, allowing optimizers to efficiently refine dangerous trajectories. However, in environments with long-continuous obstacles, such as indoor buildings and complex mazes, existing local planning methods face significant challenges. These methods often fail to escape unsafe suboptimal solutions promptly, which can lead to mission failure. In this paper, the Frontier-Guide Planner is proposed to expand the application scenarios of UAVs. First, a mixed sampling method combining uniform and Gaussian approaches is employed to extract high-quality viewpoints from the frontier. Subsequently, the viewpoints are evaluated using the existing environmental information, and the optimal viewpoint is selected as the guiding point. Finally, a safe trajectory based on the perceptual space is generated to guide the flight. The carefully designed simulation comparative experiments have demonstrated the applicability of the proposed method in both dense forest and long-continuous obstacle environments. Compared with existing frontier-based planning algorithms, the task completion time is reduced by 2% to 17%, and the success rate is increased by 14% to 32%.

Beijing Institute of Technology (CN)
Life below water
Openalex Percentile: Top 86%
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.