SLIDER: Sparse History-Guided Aerial Robot Target Search using Sliding Local Maps

• URL: http://arxiv.org/abs/2607.10553v1
• Date: Sun, 12 Jul 2026 03:55:51 GMT
• Title: SLIDER: Sparse History-Guided Aerial Robot Target Search using Sliding Local Maps
• Abstract summary: 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.
• Score: 8.942263751725413
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficient exploration and target search in large-scale unknown environments remain challenging for aerial robots due to the demands of broad spatial coverage, fine-grained perception, and real-time decision-making. This paper presents SLIDER, a lightweight and memory-efficient framework that avoids reliance on globally dense maps by combining a local sliding map with sparse global history information. A novel observation quality evaluation method is proposed, leveraging historical poses and sensor models to assess point cloud data in real-time, enabling efficient frontier detection. To support scalable and responsive planning, an incremental viewpoint clustering strategy dynamically adapts to local updates, significantly reducing the number of candidate targets and decreasing computational load. A sparse global topological map is incrementally maintained to assist global planning and cost evaluation. Extensive simulations and real-world experiments demonstrate that the proposed system outperforms state-of-the-art methods in memory usage, decision latency, and search efficiency.

Related papers

• SCOPE: Skeleton Graph-Based Computation-Efficient Framework for Autonomous UAV Exploration [30.628401434735906]
  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%.
  arXiv  Detail & Related papers  (2026-02-26T07:31:29Z)
• ReSPIRe: Informative and Reusable Belief Tree Search for Robot Probabilistic Search and Tracking in Unknown Environments [25.261065989248877]
  This paper proposes an informative trajectory planning approach, namely ReSPIRe, for target search and tracking (SAT)<n>We first develop a novel point-based approximation approach to fast and accurately estimate mutual information reward under non-Gaussian belief distributions.<n>To tackle significant uncertainty associated with inadequate prior target information, we propose the hierarchical particle structure in ReSPIRe.
  arXiv  Detail & Related papers  (2025-12-31T07:13:14Z)
• UnLoc: Leveraging Depth Uncertainties for Floorplan Localization [80.55849461031879]
  UnLoc is an efficient data-driven solution for sequential camera localization within floorplans.<n>We introduce a novel probabilistic model that incorporates uncertainty estimation, modeling depth predictions as explicit probability distributions.<n>We evaluate UnLoc on large-scale synthetic and real-world datasets, demonstrating significant improvements in terms of accuracy and robustness.
  arXiv  Detail & Related papers  (2025-09-14T14:45:43Z)
• Next-Best-Trajectory Planning of Robot Manipulators for Effective Observation and Exploration [0.26999000177990923]
  Next-Best-Trajectory principle is developed for a robot manipulator operating in dynamic environments.<n>We employ a voxel map for environment modeling and utilize raycasting from perspectives around a point of interest to estimate the information gain.<n>A global ergodic trajectory planner provides an optional reference trajectory to the local planner, improving exploration and helping to avoid local minima.
  arXiv  Detail & Related papers  (2025-03-28T16:34:29Z)
• ActiveSplat: High-Fidelity Scene Reconstruction through Active Gaussian Splatting [12.644175177979196]
  We propose ActiveSplat, an autonomous high-fidelity reconstruction system leveraging Gaussian splatting.<n>The system establishes a unified framework for online mapping, viewpoint selection, and path planning.
  arXiv  Detail & Related papers  (2024-10-29T11:18:04Z)
• Swarm Intelligence in Geo-Localization: A Multi-Agent Large Vision-Language Model Collaborative Framework [51.26566634946208]
  We introduce smileGeo, a novel visual geo-localization framework. By inter-agent communication, smileGeo integrates the inherent knowledge of these agents with additional retrieved information. Results show that our approach significantly outperforms current state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-08-21T03:31:30Z)
• Learning Where to Look: Self-supervised Viewpoint Selection for Active Localization using Geometrical Information [68.10033984296247]
  This paper explores the domain of active localization, emphasizing the importance of viewpoint selection to enhance localization accuracy. Our contributions involve using a data-driven approach with a simple architecture designed for real-time operation, a self-supervised data training method, and the capability to consistently integrate our map into a planning framework tailored for real-world robotics applications.
  arXiv  Detail & Related papers  (2024-07-22T12:32:09Z)
• Large-scale Fully-Unsupervised Re-Identification [78.47108158030213]
  We propose two strategies to learn from large-scale unlabeled data. The first strategy performs a local neighborhood sampling to reduce the dataset size in each without violating neighborhood relationships. A second strategy leverages a novel Re-Ranking technique, which has a lower time upper bound complexity and reduces the memory complexity from O(n2) to O(kn) with k n.
  arXiv  Detail & Related papers  (2023-07-26T16:19:19Z)
• Adaptive Local-Component-aware Graph Convolutional Network for One-shot Skeleton-based Action Recognition [54.23513799338309]
  We present an Adaptive Local-Component-aware Graph Convolutional Network for skeleton-based action recognition. Our method provides a stronger representation than the global embedding and helps our model reach state-of-the-art.
  arXiv  Detail & Related papers  (2022-09-21T02:33:07Z)
• Lightweight Object-level Topological Semantic Mapping and Long-term Global Localization based on Graph Matching [19.706907816202946]
  We present a novel lightweight object-level mapping and localization method with high accuracy and robustness. We use object-level features with both semantic and geometric information to model landmarks in the environment. Based on the proposed map, the robust localization is achieved by constructing a novel local semantic scene graph descriptor.
  arXiv  Detail & Related papers  (2022-01-16T05:47:07Z)
• Real-time Outdoor Localization Using Radio Maps: A Deep Learning Approach [59.17191114000146]
  LocUNet: A convolutional, end-to-end trained neural network (NN) for the localization task. We show that LocUNet can localize users with state-of-the-art accuracy and enjoys high robustness to inaccuracies in the estimations of radio maps.
  arXiv  Detail & Related papers  (2021-06-23T17:27:04Z)
• 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.