Autonomous Exploration-Oriented UAV Approach for Real-Time Spatial Mapping in Unknown Environments

Autonomous exploration is essential for various mapping tasks, including data collection, environmental monitoring, and search and rescue operations. Unmanned aerial vehicles (UAVs), owing to their low cost and high maneuverability, have become key enablers of such applications, particularly in complex or hazardous environments. However, existing approaches often suffer from issues such as redundant exploration and unstable flight behavior. In this study, we propose a hierarchical exploration approach specifically designed for limited-field-of-view UAVs in geospatial mapping applications. The approach addresses these challenges through hybrid viewpoint generation, an innovative boundary exploration sequence, and a two-stage global path planning strategy. To balance exploration efficiency and computational cost, we adopt a hybrid approach that combines collision-free spherical sampling with adaptive viewpoint generation based on stochastic differential equations. This approach generates high-quality candidate viewpoints while minimizing computational overhead. Furthermore, we introduce a novel heuristic evaluation function to prioritize frontiers within small regions, thereby facilitating optimal path planning. Based on this formulation, the global coverage path is modeled as a traveling salesman problem (TSP). The two-stage global planning framework consists of an initial stage that applies a history-aware trajectory enhancement strategy with smoothing corrections, followed by a second stage employing a sliding-window TSP algorithm to construct the global path. This design mitigates motion inconsistencies caused by frequent heuristic updates and enhances flight stability and trajectory smoothness. To evaluate the performance of the proposed framework, we compare it with state-of-the-art approaches in both simulated and real-world environments. Experimental results demonstrate that our approach shortens flight paths and reduces exploration time, thereby improving overall exploration efficiency.

Authors

Institutions

Publication Details

Journal
Drones
Published
2025-12-08
DOI
https://doi.org/10.3390/drones9120844
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Autonomous Exploration-Oriented UAV Approach for Real-Time Spatial Mapping in Unknown Environments

Guohua Gou, Xuanhao Wang, Haigang Sui, Han Li et al.
1 citations
Drones
Robotic Path Planning Algorithms
1.28
article

Autonomous Exploration-Oriented UAV Approach for Real-Time Spatial Mapping in Unknown Environments

Guohua Gou, Xuanhao Wang, Haigang Sui, Han Li, Ye Yang, Hao Zhang
article en
1 citations

Abstract

Autonomous exploration is essential for various mapping tasks, including data collection, environmental monitoring, and search and rescue operations. Unmanned aerial vehicles (UAVs), owing to their low cost and high maneuverability, have become key enablers of such applications, particularly in complex or hazardous environments. However, existing approaches often suffer from issues such as redundant exploration and unstable flight behavior. In this study, we propose a hierarchical exploration approach specifically designed for limited-field-of-view UAVs in geospatial mapping applications. The approach addresses these challenges through hybrid viewpoint generation, an innovative boundary exploration sequence, and a two-stage global path planning strategy. To balance exploration efficiency and computational cost, we adopt a hybrid approach that combines collision-free spherical sampling with adaptive viewpoint generation based on stochastic differential equations. This approach generates high-quality candidate viewpoints while minimizing computational overhead. Furthermore, we introduce a novel heuristic evaluation function to prioritize frontiers within small regions, thereby facilitating optimal path planning. Based on this formulation, the global coverage path is modeled as a traveling salesman problem (TSP). The two-stage global planning framework consists of an initial stage that applies a history-aware trajectory enhancement strategy with smoothing corrections, followed by a second stage employing a sliding-window TSP algorithm to construct the global path. This design mitigates motion inconsistencies caused by frequent heuristic updates and enhances flight stability and trajectory smoothness. To evaluate the performance of the proposed framework, we compare it with state-of-the-art approaches in both simulated and real-world environments. Experimental results demonstrate that our approach shortens flight paths and reduces exploration time, thereby improving overall exploration efficiency.

DronesVol. 9(12)
Wuhan University (CN), State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing (CN)
Openalex Percentile: Top 14%
Robotic Path Planning Algorithms
1.28
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.