cs.RONov 12, 2026

Informative Path Planning with Gaussian Processes: Error Bounds, Algorithms, and Benchmarks

Authors: Kalvik Jakkala, Jennifer Wakulicz, Donald G. Dansereau, Srinivas Akella, Lantao Liu, Jason M. O'Kane

Organizations: Department of Computer Science and Engineering, Texas A&M University, College Station, TX 77843 USA · Australian Centre for Robotics, School of Aerospace, Mechanical and Mechatronic Engineering, University of Sydney, NSW 2006, Australia · University of North Carolina at Charlotte, Charlotte, NC 28223 USA · Luddy School of Informatics, Computing, and Engineering, Indiana University, Bloomington, IN 47408 USA

Abstract

Accurate environmental monitoring relies on Informative Path Planning (IPP) to deploy autonomous systems that maximize information gain. While Gaussian Processes (GPs) provide a robust mathematical foundation for modeling the environment, contemporary IPP approaches remain hindered by heuristic operational constraints and the lack of simultaneous theoretical guarantees for worst-case estimation error and approximation quality. Rather than introducing yet another heuristic, this paper presents a rigorous theoretical analysis of existing error bounds and algorithms to further develop the mathematical foundation for IPP. By evaluating probabilistic and deterministic bounds on reconstruction error, we establish that predictive variance is the theoretically ideal optimization objective for GP-based IPP. Furthermore, we analyze GreedyCover, a recent approach for optimizing predictive variance, and demonstrate that its near-optimal approximation guarantee matches the fundamental hardness-of-approximation limit for the problem. Comprehensive benchmarking confirms that this approach delivers superior estimation accuracy and computational efficiency compared to prominent information-theoretic objectives and optimization methods used in IPP. Finally, this theoretical analysis establishes a rigorous, near-optimal foundation for discrete offline IPP under bounded uncertainty constraints, offering clear and principled guidance for future work in continuous-space and online formulations.

Figures & tables

Explore similar work

CardsList
  1. Multi-Step Gaussian Process Propagation for Adaptive Path Planning

    Apr 21, 2026Alex Beaudin, Bjørn Andreas Kristiansen, Kristoffer Gryte +4Informative Path PlanningMotion Planning

  2. LIPP: Load-Aware Informative Path Planning with Physical Sampling

    Mar 6, 2026Hojune Kim, Guangyao Shi, Gaurav S. SukhatmeInformative Path PlanningConstrained Optimization

  3. Calibrated Uncertainty for Informative Path Planning in Aquatic Environmental Monitoring

    Sep 28, 2026Samuel Yanes Luis, Alejandro Casado Pérez, Alejandro Mendoza Barrionuevo +3Informative Path PlanningDeep Ensembles