SCOPE: Skeleton Graph-Based Computation-Efficient Framework for Autonomous UAV Exploration

• URL: http://arxiv.org/abs/2602.22707v1
• Date: Thu, 26 Feb 2026 07:31:29 GMT
• Title: SCOPE: Skeleton Graph-Based Computation-Efficient Framework for Autonomous UAV Exploration
• Abstract summary: SCOPE is a novel framework that incrementally constructs a real-time skeletal graph and introduces Implicit Unknown Region Analysis.<n>It achieves competitive exploration performance comparable to state-of-the-art global planners, while reducing computational cost by an average of 86.9%.
• Score: 30.628401434735906
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Autonomous exploration in unknown environments is key for mobile robots, helping them perceive, map, and make decisions in complex areas. However, current methods often rely on frequent global optimization, suffering from high computational latency and trajectory oscillation, especially on resource-constrained edge devices. To address these limitations, we propose SCOPE, a novel framework that incrementally constructs a real-time skeletal graph and introduces Implicit Unknown Region Analysis for efficient spatial reasoning. The planning layer adopts a hierarchical on-demand strategy: the Proximal Planner generates smooth, high-frequency local trajectories, while the Region-Sequence Planner is activated only when necessary to optimize global visitation order. Comparative evaluations in simulation demonstrate that SCOPE achieves competitive exploration performance comparable to state-of-the-art global planners, while reducing computational cost by an average of 86.9%. Real-world experiments further validate the system's robustness and low latency in practical scenarios.

Related papers

• SLIDER: Sparse History-Guided Aerial Robot Target Search using Sliding Local Maps [8.942263751725413]
  This paper presents SLIDER, a lightweight framework that avoids reliance on globally dense maps by combining a local sliding map with sparse global history information.<n>A novel observation quality evaluation method is proposed, leveraging historical poses and sensor models to assess point cloud data in real-time.<n>To support scalable and responsive planning, an incremental viewpoint clustering strategy dynamically adapts to local updates.<n>A sparse global topological map is incrementally maintained to assist global planning and cost evaluation.
  arXiv  Detail & Related papers  (2026-07-12T03:55:51Z)
• Hierarchical Informative Path Planning via Graph Guidance and Trajectory Optimization [10.020847331719398]
  We study informative path planning (IPP) with travel budgets in cluttered environments, where an agent collects measurements of a latent field modeled as a Gaussian process (GP) to reduce uncertainty at target locations.<n>We propose a hierarchical framework with three stages: (i) graph-based global planning, (ii) segment-wise budget allocation using geometric and kernel bounds, and (iii) spline-based refinement of each segment with hard constraints and obstacle pruning.
  arXiv  Detail & Related papers  (2026-01-23T23:27:20Z)
• Neural Nonmyopic Bayesian Optimization in Dynamic Cost Settings [73.44599934855067]
  LookaHES is a nonmyopic BO framework designed for dynamic, history-dependent cost environments.<n>LookaHES combines a multi-step variant of $H$-Entropy Search with pathwise sampling and neural policy optimization.<n>Our innovation is the integration of neural policies, including large language models, to effectively navigate structured, domain-specific action spaces.
  arXiv  Detail & Related papers  (2026-01-10T09:49:45Z)
• Scaling Up Occupancy-centric Driving Scene Generation: Dataset and Method [54.461213497603154]
  Occupancy-centric methods have recently achieved state-of-the-art results by offering consistent conditioning across frames and modalities.<n>Nuplan-Occ is the largest occupancy dataset to date, constructed from the widely used Nuplan benchmark.<n>We develop a unified framework that jointly synthesizes high-quality occupancy, multi-view videos, and LiDAR point clouds.
  arXiv  Detail & Related papers  (2025-10-27T03:52:45Z)
• Real-time Spatial-temporal Traversability Assessment via Feature-based Sparse Gaussian Process [15.756895046886406]
  We propose a novel spatial-temporal traversability assessment method, which aims to enable autonomous robots to navigate through complex terrains.<n>Our method outper- forms SOTA approaches in both accuracy and computational efficiency.<n>We develop an autonomous navigation framework integrated with the traversability map and validate it with a differential driven vehicle in complex outdoor envi- ronments.
  arXiv  Detail & Related papers  (2025-03-06T06:26:57Z)
• Learning to Initialize Trajectory Optimization for Vision-Based Autonomous Flight in Unknown Environments [4.0543433786183485]
  We present a Neural-Enhanced Tray Planner (NEO-Planner) for autonomous flight in unknown environments.<n>NEO-Planner learns to predict spatial and temporal parameters for trajectories directly from raw sensor observations.<n>It reduces optimization by 20%, leading to a 26% decrease in trajectory time compared with pure optimization-based methods.
  arXiv  Detail & Related papers  (2023-09-19T15:07:26Z)
• Learning Regions of Interest for Bayesian Optimization with Adaptive Level-Set Estimation [84.0621253654014]
  We propose a framework, called BALLET, which adaptively filters for a high-confidence region of interest. We show theoretically that BALLET can efficiently shrink the search space, and can exhibit a tighter regret bound than standard BO.
  arXiv  Detail & Related papers  (2023-07-25T09:45:47Z)
• Maximize to Explore: One Objective Function Fusing Estimation, Planning, and Exploration [87.53543137162488]
  We propose an easy-to-implement online reinforcement learning (online RL) framework called textttMEX. textttMEX integrates estimation and planning components while balancing exploration exploitation automatically. It can outperform baselines by a stable margin in various MuJoCo environments with sparse rewards.
  arXiv  Detail & Related papers  (2023-05-29T17:25:26Z)
• Near-optimal Policy Identification in Active Reinforcement Learning [84.27592560211909]
  AE-LSVI is a novel variant of the kernelized least-squares value RL (LSVI) algorithm that combines optimism with pessimism for active exploration. We show that AE-LSVI outperforms other algorithms in a variety of environments when robustness to the initial state is required.
  arXiv  Detail & Related papers  (2022-12-19T14:46:57Z)
• Learning Space Partitions for Path Planning [54.475949279050596]
  PlaLaM outperforms existing path planning methods in 2D navigation tasks, especially in the presence of difficult-to-escape local optima. These gains transfer to highly multimodal real-world tasks, where we outperform strong baselines in compiler phase ordering by up to 245% and in molecular design by up to 0.4 on properties on a 0-1 scale.
  arXiv  Detail & Related papers  (2021-06-19T18:06:11Z)
• Locally induced Gaussian processes for large-scale simulation experiments [0.0]
  We show how placement of inducing points and their multitude can be thwarted by pathologies. Our proposed methodology hybridizes global inducing point and data subset-based local GP approximation. We show that local inducing points extend their global and data-subset component parts on the accuracy--computational efficiency frontier.
  arXiv  Detail & Related papers  (2020-08-28T21:37:46Z)
• Localized active learning of Gaussian process state space models [63.97366815968177]
  A globally accurate model is not required to achieve good performance in many common control applications. We propose an active learning strategy for Gaussian process state space models that aims to obtain an accurate model on a bounded subset of the state-action space. By employing model predictive control, the proposed technique integrates information collected during exploration and adaptively improves its exploration strategy.
  arXiv  Detail & Related papers  (2020-05-04T05:35:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.