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
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
Fig. 1 : Informative path generated by GreedyCover on the SRTM elevation dataset ( 45∘N,123∘W ). By leveraging a non-stationary kernel, the method adapts sampling density to spatial variations while guaranteeing bounded maximum posterior variance. Red: informative path and sensing locations.
Fig. 2 : GP regression on an illustrative non-stationary 1D data field. Observations (dashed vertical lines) are sampled near the outer intervals, leaving an unobserved gap in the middle. The estimated GP predictive mean μpost(x∣P) closely fits the ground-truth function f(x) , while the 95% confidence interval ( ±1.96σpost ) expands across the unsampled center to reflect increased predictive uncertainty.
Fig. 3 : Empirical validation of the GP MSE lower bound from Theorem 1 . The observed MSE and its theoretical lower bound are plotted alongside the pointwise squared errors from 1,000 realizations of the underlying stochastic process used to compute the MSE. y -axis shown on a logarithmic scale with a linear region near zero. The central peak reflects the spatial distribution of sensing locations (Figure. 2 ), which are placed symmetrically in the outer regions and leave an unobserved gap in the center.
Fig. 4 : Empirical validation of the deterministic absolute error upper bound from Theorem 2 . y -axis shown on a logarithmic scale with a linear region near zero.
Fig. 5 : Empirical validation of the deterministic squared error upper bound from Corollary 1 . y -axis shown on a logarithmic scale with a linear region near zero.
Fig. 6 : GP error upper and lower bounds along with corresponding errors. y -axis shown on a logarithmic scale with a linear region near zero.
Fig. 7 : (45∘N,123∘W) Estimation error (MSE) and path length across information-theoretic objectives. GreedyCover achieves lower overall error despite its discrete-space constraints, outperforming baseline objectives optimized in continuous space using CMA-ES.
Fig. 8 : (45∘N,123∘W) Runtime comparison of prominent information-theoretic objectives (right: zoomed version of the left). While continuous-space optimization severely inflates the search space and computational overhead for CMA-ES, GreedyCover leverages its discrete formulation to deliver solutions orders of magnitude faster.
Fig. 9 : (45∘N,123∘W) Estimation error (MSE) and path length across prominent optimization methods. GreedyCover matches the best-in-class accuracy of continuous planners while avoiding the susceptibility to local minima inherent in gradient-based approaches.
Fig. 10 : (45∘N,123∘W) Runtime comparison of prominent optimization methods (right: zoomed version of the left). GreedyCover delivers unparalleled computational speed, sharply contrasting with competing baselines that are hindered by the need for numerous, expensive objective function evaluations.
Objective
Equation Formulation
Mutual Information [ 31 ]
log∣KPP∣+log∣KVV∣−log∣Kcombined∣
Schur MI [ 26 ]
log∣KPP∣−log∣KPP−KPVKVV−1KVP∣
B-Optimal [ 37 ]
Tr(KPP−1)
D-Optimal [ 31 ]
−log∣KPP∣
Predictive Variance [ 42 ]
−Tr(Σpost)
Entropy [ 42 ]
−0.5log∣Σpost∣
TABLE I : Information-theoretic objective functions used in the benchmark.
Optimization Method
Description
GreedyCover [ 22 ]
A near-optimal discrete algorithm that utilizes a submodular set-cover formulation to strictly constrain predictive variance.
Bayesian Optimization [ 17 ]
A continuous-space black-box Bayesian optimization method utilizing surrogate modeling for objective maximization.
CMA-ES [ 19 ]
A derivative-free, continuous-space evolutionary algorithm based on covariance matrix adaptation.
Continuous SGP [ 25 ]
A gradient-based continuous space path planner leveraging variational Sparse Gaussian Process approximations.
Gradient Descent [ 26 ]
A continuous-space method using exact analytical gradients with the Adam optimizer.
Ergodic Control [ 35 ]
A continuous-space trajectory planner that optimizes paths to match the spatial distribution of an underlying information map.
TABLE II : Informative path planning optimization methods used in the benchmark.
Fig. 11 : (17∘N,073∘W) Estimation error (MSE and path length) across prominent information-theoretic objectives.
Fig. 12 : (17∘N,073∘W) Runtime evaluation across information-theoretic objectives (right: zoomed version of the left).
Fig. 13 : (17∘N,073∘W) Estimation error (MSE and path length) across prominent optimization methods.
Fig. 14 : (17∘N,073∘W) Runtime evaluation across prominent optimization methods (right: zoomed version of the left).
Fig. 15 : (02∘N,021∘W) Estimation error (MSE and path length) across prominent information-theoretic objectives.
Fig. 16 : (02∘N,021∘W) Runtime evaluation across information-theoretic objectives (right: zoomed version of the left).
Fig. 17 : (02∘N,021∘W) Estimation error (MSE and path length) across prominent optimization methods.
Fig. 18 : (02∘N,021∘W) Runtime evaluation across prominent optimization methods (right: zoomed version of the left).
Fig. 19 : (47∘N,124∘W) Estimation error (MSE and path length) across prominent information-theoretic objectives.
Fig. 20 : (47∘N,124∘W) Runtime evaluation across information-theoretic objectives (right: zoomed version of the left).
Fig. 21 : (47∘N,124∘W) Estimation error (MSE and path length) across prominent optimization methods.
Fig. 22 : (47∘N,124∘W) Runtime evaluation across prominent optimization methods (right: zoomed version of the left).
Informative path planning chooses robot routes and sensing actions that gather useful information while respecting travel, energy, time, and safety constraints.
Efficient and robust path planning hinges on combining all accessible information sources. In particular, the task of path planning for robotic environmental exploration and monitoring depends highly on the current belief of the world. To capture the uncertainty in the belief, we present a Gaussian process based path planning method that adapts to multi-modal environmental sensing data and incorporates state and input constraints. To solve the path planning problem, we optimize over future waypoints in a receding horizon fashion, and our cost is thus a function of the Gaussian process posterior over all these waypoints. We demonstrate this method, dubbed OLAhGP, on an autonomous surface vessel using oceanic algal bloom data from both a high-fidelity model and in-situ sensing data in a monitoring scenario. Our simulated and experimental results demonstrate significant improvement over existing methods. With the same number of samples, our method generates more informative paths and achieves greater accuracy in identifying algal blooms in chlorophyll a rich waters, measured with respect to total misclassification probability and binary misclassification rate over the domain of interest.
Alex Beaudin, Bjørn Andreas Kristiansen, Kristoffer Gryte +4
Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA 94720, USA · Department of Engineering Cybernetics, Norwegian University of Science and Technology (NTNU), NO-7491, Norway · Department of Electronic Systems, Norwegian University of Science and Technology (NTNU), NO-7491, Norway
In classical Informative Path Planning (C-IPP), robots are typically modeled as mobile sensors that acquire digital measurements such as images or radiation levels. In this model, since making a measurement leaves the robot's physical state unchanged, the cost of traversing an edge remains static regardless of when it is traversed. This is a natural assumption for many missions, but does not extend to settings involving physical sample collection, where each collected sample adds mass and increases the energy cost of all subsequent motion. As a result, IPP formulations that ignore this coupling between information gain and load-dependent traversal cost can produce plans that are distance-efficient but energy-suboptimal, collecting fewer samples and less data than the energy budget would permit. In this paper, we first introduce Load-aware Informative Path Planning (LIPP), a strict generalization of C-IPP that explicitly models this coupling, with C-IPP recovered as the special case of zero sample mass. We then formulate LIPP as a Mixed-Integer Quadratic Program (MIQP) that jointly optimizes visitation location, order, and per-location sampling count under an energy budget. We further derive theoretical bounds on the path-length increase of LIPP relative to C-IPP, characterizing the trade-off for improved energy efficiency. Finally, through extensive simulations across 2,000 diverse mission scenarios, we demonstrate that LIPP progressively achieves higher uncertainty reduction per unit energy as sample mass increases.
Hojune Kim, Guangyao Shi, Gaurav S. Sukhatme
School of Electrical and Computer Engineering University of Southern California Los Angeles, California · School of Computer Science University of Southern California Los Angeles, California
Informative Path Planning for scalar field reconstruction uses predictive uncertainty to direct sensing vehicles toward maximally informative locations. Gaussian Processes provide this signal but their stationary isotropic kernels are misspecified for non-homogeneous phenomena such as oil spills, producing miscalibrated estimates that degrade planning. We investigate whether replacing the Gaussian Process with a well-calibrated Deep Ensemble improves path planning outcomes, and whether uncertainty quality interacts with the choice of planning algorithm. Five strategies (ε-Greedy, Value Greedy, Uncertainty Greedy, Monte Carlo Tree Search, and Receding Horizon Orienteering) share a common Deep Ensemble backbone trained on physics-based oil spill simulations. On held-out stochastic spill scenarios, the Deep Ensemble reduces normalised reconstruction error by 83% relative to the Gaussian Process baseline. Crucially, well-calibrated uncertainty amplifies the importance of the planning strategy: the performance gap between algorithms is negligible under miscalibrated models but becomes substantial under the ensemble, where multi-step lookahead planners outperform greedy selection by up to 32% in reconstruction error and achieve IoU above 0.85. Monte Carlo Tree Search is the recommended planner, matching Orienteering in reconstruction quality at an order-of-magnitude lower computational cost.
Samuel Yanes Luis, Alejandro Casado Pérez, Alejandro Mendoza Barrionuevo +3
Department of Electronic Technology, University of Sevilla, Sevilla, Spain · Department of Electronic Engineering, University of Sevilla, Sevilla, Spain