Scout-Assisted Planning for Heterogeneous Robot Teams under Partially Known Environments

• URL: http://arxiv.org/abs/2605.22693v1
• Date: Thu, 21 May 2026 16:36:55 GMT
• Title: Scout-Assisted Planning for Heterogeneous Robot Teams under Partially Known Environments
• Abstract summary: We propose Information Gain-based Action Pruning, which scores candidate scouting actions by their expected impact on ground robot behavior.<n>Experiments show that SAP with Information Gain Action Pruning reduces ground robot travel cost by 31.9--37.7% over the Canadian Traveler Problem baseline.<n>We conclude that principled information-gain-guided scouting is both more effective and computationally feasible for real-world deployment.
• Score: 6.8072479152471566
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Autonomous robot teams navigating partially known environments face costly backtracking when ground robots encounter blocked roads that are only revealed upon physical traversal. We address this with Scout-Assisted Planning, a heterogeneous planning framework in which scouting Unmanned Aerial Vehicles proactively gather environmental information to improve Unmanned Ground Vehicle navigation. To focus scouting on the most consequential edges, we propose Information Gain-based Action Pruning, which scores candidate scouting actions by their expected impact on ground robot behavior. Since exact Information Gain-based Action Pruning computation is prohibitively expensive, we develop a Graph Neural Network based model that predicts information gain values directly from graph structure and belief state, reducing planning time to real-time levels without sacrificing solution quality. Experiments across three environment types show that SAP with Information Gain Action Pruning reduces ground robot travel cost by 31.9--37.7% over the Canadian Traveler Problem baseline, and outperforms proximity-based scouting guidance by an additional 8--14%, confirming that principled information-gain-guided scouting is both more effective and computationally feasible for real-world deployment

Related papers

• Cooperative Risk-Aware Exploration in Heterogeneous Multi-Robot Systems Using Algorithmic Altruism [5.8411170261618865]
  This paper develops a game-theoretic framework for cooperative risk-aware exploration based on ecologically inspired altruistic behavior.<n>We define an exploration utility for agents that rewards area coverage and uncertainty reduction, while also penalizing redundancy and risk.<n> Simulations show that altruistic planning reduces redundant exploration, improves inter-robot separation, and reallocates risk according to agent value.
  arXiv  Detail & Related papers  (2026-08-28T14:57:36Z)
• Expected Free Energy-based Informative Path Planning for Robotic Mars Exploration [0.5161531917413708]
  Expected Free Energy is a principled action-selection objective from active inference.<n>We show that EFE-based planning yields accurate posterior maps and locates the highest-value regions simultaneously.<n>In robotic exploration, these unified, easy-to-tune principled information-gathering strategies facilitate autonomous deployment.
  arXiv  Detail & Related papers  (2026-08-14T16:46:18Z)
• Collaborative Navigation and Exploration with $β$-Sparse Gaussian Processes [14.685150015050164]
  Collaborative navigation of heterogeneous robots in unknown environments poses significant challenges due to sensing, communication, and computational limitations.<n>We propose a framework that enables the sensor to jointly select its transmitted map points and navigation actions online, while also predicting unexplored regions of the environment.
  arXiv  Detail & Related papers  (2026-05-25T19:55:59Z)
• ForesightNav: Learning Scene Imagination for Efficient Exploration [57.49417653636244]
  We propose ForesightNav, a novel exploration strategy inspired by human imagination and reasoning.<n>Our approach equips robotic agents with the capability to predict contextual information, such as occupancy and semantic details, for unexplored regions.<n>We validate our imagination-based approach using the Structured3D dataset, demonstrating accurate occupancy prediction and superior performance in anticipating unseen scene geometry.
  arXiv  Detail & Related papers  (2025-04-22T17:38:38Z)
• Deep Reinforcement Learning with Dynamic Graphs for Adaptive Informative Path Planning [22.48658555542736]
  Key task in robotic data acquisition is planning paths through an initially unknown environment to collect observations. We propose a novel deep reinforcement learning approach for adaptively replanning robot paths to map targets of interest in unknown 3D environments.
  arXiv  Detail & Related papers  (2024-02-07T14:24:41Z)
• VAPOR: Legged Robot Navigation in Outdoor Vegetation Using Offline Reinforcement Learning [53.13393315664145]
  We present VAPOR, a novel method for autonomous legged robot navigation in unstructured, densely vegetated outdoor environments. Our method trains a novel RL policy using an actor-critic network and arbitrary data collected in real outdoor vegetation. We observe that VAPOR's actions improve success rates by up to 40%, decrease the average current consumption by up to 2.9%, and decrease the normalized trajectory length by up to 11.2%.
  arXiv  Detail & Related papers  (2023-09-14T16:21:27Z)
• Incremental 3D Scene Completion for Safe and Efficient Exploration Mapping and Planning [60.599223456298915]
  We propose a novel way to integrate deep learning into exploration by leveraging 3D scene completion for informed, safe, and interpretable mapping and planning. We show that our method can speed up coverage of an environment by 73% compared to the baselines with only minimal reduction in map accuracy. Even if scene completions are not included in the final map, we show that they can be used to guide the robot to choose more informative paths, speeding up the measurement of the scene with the robot's sensors by 35%.
  arXiv  Detail & Related papers  (2022-08-17T14:19:33Z)
• Off-Policy Evaluation with Online Adaptation for Robot Exploration in Challenging Environments [6.4617907823964345]
  This paper presents a method to learn how "good" states are, measured by the state value function, to provide a guidance for robot exploration. It consists of offline Monte-Carlo training on real-world data and performs Temporal Difference (TD) online adaptation to optimize the trained value estimator. Results show that our method enables the robot to predict the value of future states so as to better guide robot exploration.
  arXiv  Detail & Related papers  (2022-04-07T00:46:57Z)
• ViKiNG: Vision-Based Kilometer-Scale Navigation with Geographic Hints [94.60414567852536]
  Long-range navigation requires both planning and reasoning about local traversability. We propose a learning-based approach that integrates learning and planning. ViKiNG can leverage its image-based learned controller and goal-directed to navigate to goals up to 3 kilometers away.
  arXiv  Detail & Related papers  (2022-02-23T02:14:23Z)
• SABER: Data-Driven Motion Planner for Autonomously Navigating Heterogeneous Robots [112.2491765424719]
  We present an end-to-end online motion planning framework that uses a data-driven approach to navigate a heterogeneous robot team towards a global goal. We use model predictive control (SMPC) to calculate control inputs that satisfy robot dynamics, and consider uncertainty during obstacle avoidance with chance constraints. recurrent neural networks are used to provide a quick estimate of future state uncertainty considered in the SMPC finite-time horizon solution. A Deep Q-learning agent is employed to serve as a high-level path planner, providing the SMPC with target positions that move the robots towards a desired global goal.
  arXiv  Detail & Related papers  (2021-08-03T02:56:21Z)
• Rapid Exploration for Open-World Navigation with Latent Goal Models [78.45339342966196]
  We describe a robotic learning system for autonomous exploration and navigation in diverse, open-world environments. At the core of our method is a learned latent variable model of distances and actions, along with a non-parametric topological memory of images. We use an information bottleneck to regularize the learned policy, giving us (i) a compact visual representation of goals, (ii) improved generalization capabilities, and (iii) a mechanism for sampling feasible goals for exploration.
  arXiv  Detail & Related papers  (2021-04-12T23:14:41Z)
• Occupancy Anticipation for Efficient Exploration and Navigation [97.17517060585875]
  We propose occupancy anticipation, where the agent uses its egocentric RGB-D observations to infer the occupancy state beyond the visible regions. By exploiting context in both the egocentric views and top-down maps our model successfully anticipates a broader map of the environment. Our approach is the winning entry in the 2020 Habitat PointNav Challenge.
  arXiv  Detail & Related papers  (2020-08-21T03:16:51Z)
• Autonomous Exploration Under Uncertainty via Deep Reinforcement Learning on Graphs [5.043563227694137]
  We consider an autonomous exploration problem in which a range-sensing mobile robot is tasked with accurately mapping the landmarks in an a priori unknown environment efficiently in real-time. We propose a novel approach that uses graph neural networks (GNNs) in conjunction with deep reinforcement learning (DRL), enabling decision-making over graphs containing exploration information to predict a robot's optimal sensing action in belief space.
  arXiv  Detail & Related papers  (2020-07-24T16:50:41Z)

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.