Expected Free Energy-based Informative Path Planning for Robotic Mars Exploration
- URL: http://arxiv.org/abs/2608.14466v1
- Date: Fri, 14 Aug 2026 16:46:18 GMT
- Title: Expected Free Energy-based Informative Path Planning for Robotic Mars Exploration
- Abstract summary: 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.
- Score: 0.5161531917413708
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: An autonomous robot efficiently exploring an unknown environment, such as looking for water sources on Mars, faces two simultaneous demands: building an accurate information map while quickly finding the regions of greatest value, and paying for every meter of travel and the cost of every measurement it takes. Classical information-seeking and reward-seeking criteria address only one of these objectives at a time. Here, we propose Expected Free Energy (EFE), the principled action-selection objective from active inference, as a unifying criterion for budgeted robotic informative path planning. Maintaining a Gaussian-process belief over the information field, our agent plans continuous trajectories that minimize expected free energy under hard path-length constraints. The results from multiple realizations show that EFE-based planning yields accurate posterior maps and locates the highest-value regions simultaneously, outperforming information-theoretic baselines under the same settings. In robotic exploration, these unified, easy-to-tune principled information-gathering strategies facilitate autonomous deployment while enforcing efficiency and resource constraints.
Related papers
- MPPI-based Informative Trajectory Planning for Search and Capture of Drifting Targets with ASVs [0.8602553195689513]
We address the problem of search and capture of drifting targets using a hybrid planning framework.<n>A planner directly generates kinematic-level commands by optimising continuous trajectories over long horizons.<n>Experiments show that our planner outperforms the chosen planning baselines.
arXiv Detail & Related papers (2026-06-10T12:44:25Z) - Scout-Assisted Planning for Heterogeneous Robot Teams under Partially Known Environments [6.8072479152471566]
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.
arXiv Detail & Related papers (2026-05-21T16:36:55Z) - 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) - Bayesian-Driven Graph Reasoning for Active Radio Map Construction [96.08082552413117]
We propose an uncertainty-aware radio map reconstruction framework that explicitly leverages graph-based reasoning tailored for waypoint navigation.<n>Our approach integrates two key deep learning components: (1) a Bayesian neural network that estimates spatial uncertainty in real time, and (2) an attention-based reinforcement learning policy that performs global reasoning.<n> Experimental results show that URAM improves reconstruction accuracy by up to 34% over existing baselines.
arXiv Detail & Related papers (2025-07-29T03:32:01Z) - Information Gain Is Not All You Need [3.053906384469777]
This paper argues that information gain should not serve as an optimization objective in quality-constrained exploration.<n>We propose a novel, distance advantage, which selects frontiers based on a trade-off between proximity to the robot and remoteness from other frontiers.
arXiv Detail & Related papers (2025-03-28T15:03:52Z) - Beyond the Destination: A Novel Benchmark for Exploration-Aware Embodied Question Answering [87.76784654371312]
Embodied Question Answering requires agents to dynamically explore 3D environments, actively gather visual information, and perform multi-step reasoning to answer questions.<n>Existing datasets often introduce biases or prior knowledge, leading to disembodied reasoning.<n>We construct the largest dataset designed specifically to evaluate both exploration and reasoning capabilities.
arXiv Detail & Related papers (2025-03-14T06:29:47Z) - 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) - 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) - 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) - End-to-end Interpretable Neural Motion Planner [78.69295676456085]
We propose a neural motion planner (NMP) for learning to drive autonomously in complex urban scenarios.
We design a holistic model that takes as input raw LIDAR data and a HD map and produces interpretable intermediate representations.
We demonstrate the effectiveness of our approach in real-world driving data captured in several cities in North America.
arXiv Detail & Related papers (2021-01-17T14:16:12Z)
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.