Informative Path Planning with Guaranteed Estimation Uncertainty

• URL: http://arxiv.org/abs/2602.05198v1
• Date: Thu, 05 Feb 2026 01:51:38 GMT
• Title: Informative Path Planning with Guaranteed Estimation Uncertainty
• Abstract summary: Environmental monitoring budget robots need to reconstruct spatial fields under tight distance and energy constraints.<n>We present methods with provable approximation guarantees for sensing-location selection and for the joint selection-and-routing problem under a travel path.<n> Experiments on real-world data show that our planners meet the uncertainty target using fewer sensing locations and shorter travel distances.
• Score: 7.2097330104931325
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Environmental monitoring robots often need to reconstruct spatial fields (e.g., salinity, temperature, bathymetry) under tight distance and energy constraints. Classical boustrophedon lawnmower surveys provide geometric coverage guarantees but can waste effort by oversampling predictable regions. In contrast, informative path planning (IPP) methods leverage spatial correlations to reduce oversampling, yet typically offer no guarantees on reconstruction quality. This paper bridges these approaches by addressing informative path planning with guaranteed estimation uncertainty: computing the shortest path whose measurements ensure that the Gaussian-process (GP) posterior variance -- an intrinsic uncertainty measure that lower-bounds the mean-squared prediction error under the GP model -- falls below a user-specified threshold over the monitoring region. We propose a three-stage approach: (i) learn a GP model from available prior information; (ii) transform the learned GP kernel into binary coverage maps for each candidate sensing location, indicating which locations' uncertainty can be reduced below a specified target; and (iii) plan a near-shortest route whose combined coverage satisfies the global uncertainty constraint. To address heterogeneous phenomena, we incorporate a nonstationary kernel that captures spatially varying correlation structure, and we accommodate non-convex environments with obstacles. Algorithmically, we present methods with provable approximation guarantees for sensing-location selection and for the joint selection-and-routing problem under a travel budget. Experiments on real-world topographic data show that our planners meet the uncertainty target using fewer sensing locations and shorter travel distances than a recent baseline, and field experiments with bathymetry-mapping autonomous surface and underwater vehicles demonstrate real-world feasibility.

Related papers

• Active Timepoint Selection for Learning Measure-Valued Trajectories [55.49809248697036]
  Inferring continuous probability paths from snapshots is a fundamental challenge in domains like single-cell biology.<n>We introduce a framework which extends active experimentation to the space of sparse measures.<n>This yields an acquisition policy that iteratively selects measurement times to minimize uncertainty.
  arXiv  Detail & Related papers  (2026-05-28T22:22:35Z)
• Local Conformal Calibration of Dynamics Uncertainty from Semantic Images [11.10792616622245]
  We introduce Observation-aware Conformal Uncertainty Local-Calibration (OCULAR)<n>OCULAR is a conformal prediction-based algorithm that uses perception information to provide uncertainty quantification guarantees.<n>We validate our algorithm on a double-integrator system subject to random perturbations and significant model mismatch.
  arXiv  Detail & Related papers  (2026-05-13T05:33:42Z)
• Uncertainty Estimation for Deep Reconstruction in Actuatic Disaster Scenarios with Autonomous Vehicles [68.82821445619759]
  principled uncertainty quantification is critical for active sensing strategies.<n>Evidential Deep Learning achieves the best reconstruction accuracy and uncertainty calibration across all sensor configurations.<n>These findings support Evidential Deep Learning as the preferred method for uncertainty-aware field reconstruction in real-time autonomous vehicle deployments.
  arXiv  Detail & Related papers  (2026-04-07T19:17:44Z)
• Multi-Agent Off-World Exploration for Sparse Evidence Discovery via Gaussian Belief Mapping and Dual-Domain Coverage [15.524614683513834]
  We propose a multi-agent informative path planning framework for sparse evidence discovery based on Gaussian belief mapping and dual-domain coverage.<n> Experimental results in simulated lunar environments show that the proposed method consistently outperforms sampling-based and greedy baselines under different budgets and communication ranges.
  arXiv  Detail & Related papers  (2026-03-08T14:27:41Z)
• U-OBCA: Uncertainty-Aware Optimization-Based Collision Avoidance via Wasserstein Distributionally Robust Chance Constraints [20.749251189493563]
  Uncertainty arising from localization error, trajectory prediction errors of the moving obstacles and environmental disturbances pose significant challenges to robot's safe navigation.<n>Existing uncertainty-aware planners often approximate polygon-shaped robots and obstacles using simple geometric primitives such as circles or ellipses.<n>We extend the Optimization-Based Collision Avoidance framework to an uncertainty-aware formulation, termed emphU-OBCA.<n>We show that U-OBCA significantly mitigates the conservatism in trajectory planning and achieves higher navigation efficiency compared to existing baseline methods.
  arXiv  Detail & Related papers  (2026-03-05T07:59:09Z)
• Geometry-Aware Uncertainty Quantification via Conformal Prediction on Manifolds [3.2848713528308817]
  We propose a framework that replaces Euclidean residuals with geodesic nonconformity scores and normalizes them by a cross-validated difficulty estimator to handle heteroscedastic noise.<n>The resulting prediction regions, geodesic caps on the sphere, have position-independent area and adapt their size to local prediction difficulty, yielding substantially more uniform conditional coverage than non-adaptive alternatives.
  arXiv  Detail & Related papers  (2026-02-17T21:12:47Z)
• Calibrated Probabilistic Interpolation for GEDI Biomass [0.0]
  We introduce Attentive Neural Processes (ANPs), a probabilistic meta-learning framework that explicitly conditions predictions on local observation sets.<n>We validate this approach across five distinct biomes ranging from Tropical Amazonian forests to Boreal and Alpine ecosystems.<n>This work provides a scalable, theoretically rigorous alternative to ensemble variance for continental scale earth observation.
  arXiv  Detail & Related papers  (2026-01-23T15:35:33Z)
• 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)
• Conditional Coverage Diagnostics for Conformal Prediction [47.93989136542648]
  We show that conditional coverage estimation can be a classification problem.<n>We call the resulting family of metrics excess risk of the target coverage (ERT)<n>We release an open-source package for ERT as well as previous conditional coverage metrics.
  arXiv  Detail & Related papers  (2025-12-12T18:47:39Z)
• Adaptive Dual Uncertainty Optimization: Boosting Monocular 3D Object Detection under Test-Time Shifts [80.32933059529135]
  Test-Time Adaptation (TTA) methods have emerged to adapt to target distributions during inference.<n>We propose Dual Uncertainty Optimization (DUO), the first TTA framework designed to jointly minimize both uncertainties for robust M3OD.<n>In parallel, we design a semantic-aware normal field constraint that preserves geometric coherence in regions with clear semantic cues.
  arXiv  Detail & Related papers  (2025-08-28T07:09:21Z)
• CertainNet: Sampling-free Uncertainty Estimation for Object Detection [65.28989536741658]
  Estimating the uncertainty of a neural network plays a fundamental role in safety-critical settings. In this work, we propose a novel sampling-free uncertainty estimation method for object detection. We call it CertainNet, and it is the first to provide separate uncertainties for each output signal: objectness, class, location and size.
  arXiv  Detail & Related papers  (2021-10-04T17:59:31Z)
• Adaptive Selection of Informative Path Planning Strategies via Reinforcement Learning [6.015556590955814]
  "Local planning" approaches adopt various spatial ranges within which next sampling locations are prioritized to investigate their effects on the prediction performance as well as incurred travel distance. Experiments on use cases of temperature monitoring robots demonstrate that the dynamic mixtures of planners can not only generate sophisticated, informative plans but also ensure significantly reduced distances at no cost of prediction reliability.
  arXiv  Detail & Related papers  (2021-08-14T21:32:33Z)
• Temporal Difference Uncertainties as a Signal for Exploration [76.6341354269013]
  An effective approach to exploration in reinforcement learning is to rely on an agent's uncertainty over the optimal policy. In this paper, we highlight that value estimates are easily biased and temporally inconsistent. We propose a novel method for estimating uncertainty over the value function that relies on inducing a distribution over temporal difference errors.
  arXiv  Detail & Related papers  (2020-10-05T18:11:22Z)
• Localization Uncertainty Estimation for Anchor-Free Object Detection [48.931731695431374]
  There are several limitations of the existing uncertainty estimation methods for anchor-based object detection. We propose a new localization uncertainty estimation method called UAD for anchor-free object detection. Our method captures the uncertainty in four directions of box offsets that are homogeneous, so that it can tell which direction is uncertain.
  arXiv  Detail & Related papers  (2020-06-28T13:49:30Z)
• Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment [52.02794488304448]
  We propose a new distribution alignment method based on a log-likelihood ratio statistic and normalizing flows. We experimentally verify that minimizing the resulting objective results in domain alignment that preserves the local structure of input domains.
  arXiv  Detail & Related papers  (2020-03-26T22:10:04Z)

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.