Multi-Step Gaussian Process Propagation for Adaptive Path Planning

• URL: http://arxiv.org/abs/2604.19148v1
• Date: Tue, 21 Apr 2026 06:55:14 GMT
• Title: Multi-Step Gaussian Process Propagation for Adaptive Path Planning
• Abstract summary: We present a Gaussian process based path planning method that adapts to multi-modal environmental sensing data and incorporates state and input constraints.<n>We demonstrate this method 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.
• Score: 1.7883249184785492
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Closing the Train-Test Gap in World Models for Gradient-Based Planning [64.36544881136405]
  We propose improved methods for training world models that enable efficient gradient-based planning.<n>At test time, our approach outperforms or matches the classical gradient-free cross-entropy method.
  arXiv  Detail & Related papers  (2025-12-10T18:59:45Z)
• Flow Density Control: Generative Optimization Beyond Entropy-Regularized Fine-Tuning [59.11663802446183]
  Flow and diffusion generative models can be adapted to optimize task-specific objectives while preserving prior information.<n>We introduce Flow Density Control (FDC), a simple algorithm that reduces this complex problem to a specific sequence of simpler fine-tuning tasks.<n>We derive convergence guarantees for the proposed scheme under realistic assumptions by leveraging recent understanding of mirror flows.
  arXiv  Detail & Related papers  (2025-11-27T17:19:01Z)
• Robust variable selection for spatial point processes observed with noise [1.8047694351309207]
  We propose a method variable selection in the intensity function of point processes that combines sparsity-promoting estimation with noise-robust model selection.<n>We demonstrate that an approach reliably recovers true spatial cos under diverse noise scenarios and improves both selection stability.<n>This shows the practical utility of the method, which provides a systematic framework for robust variable selection in point-process models under noise.
  arXiv  Detail & Related papers  (2025-10-29T14:18:08Z)
• Informative Path Planning to Explore and Map Unknown Planetary Surfaces with Gaussian Processes [0.0]
  This study evaluates an informative path planning algorithm for mapping a scalar variable distribution.<n>We compare traditional open loop coverage methods with information-theoretic approaches.<n>The algorithm's performance is tested on three surfaces, a parabola, Townsend function, and lunar crater hydration map.
  arXiv  Detail & Related papers  (2025-03-20T18:10:13Z)
• Real-time Spatial-temporal Traversability Assessment via Feature-based Sparse Gaussian Process [15.756895046886406]
  We propose a novel spatial-temporal traversability assessment method, which aims to enable autonomous robots to navigate through complex terrains.<n>Our method outper- forms SOTA approaches in both accuracy and computational efficiency.<n>We develop an autonomous navigation framework integrated with the traversability map and validate it with a differential driven vehicle in complex outdoor envi- ronments.
  arXiv  Detail & Related papers  (2025-03-06T06:26:57Z)
• Enhancing Path Planning Performance through Image Representation Learning of High-Dimensional Configuration Spaces [0.4143603294943439]
  We present a novel method for accelerating path-planning tasks in unknown scenes with obstacles.<n>We approximate the distribution of waypoints for a collision-free path using the Rapidly-exploring Random Tree algorithm.<n>Our experiments demonstrate promising results in accelerating path-planning tasks under critical time constraints.
  arXiv  Detail & Related papers  (2025-01-11T21:14:52Z)
• Dynamical Measure Transport and Neural PDE Solvers for Sampling [77.38204731939273]
  We tackle the task of sampling from a probability density as transporting a tractable density function to the target. We employ physics-informed neural networks (PINNs) to approximate the respective partial differential equations (PDEs) solutions. PINNs allow for simulation- and discretization-free optimization and can be trained very efficiently.
  arXiv  Detail & Related papers  (2024-07-10T17:39:50Z)
• Diffusion Generative Flow Samplers: Improving learning signals through partial trajectory optimization [87.21285093582446]
  Diffusion Generative Flow Samplers (DGFS) is a sampling-based framework where the learning process can be tractably broken down into short partial trajectory segments. Our method takes inspiration from the theory developed for generative flow networks (GFlowNets)
  arXiv  Detail & Related papers  (2023-10-04T09:39:05Z)
• Dynamic Flows on Curved Space Generated by Labeled Data [17.621847430986854]
  We propose a gradient flow method to generate new samples close to a dataset of interest. We show that our method can improve the accuracy of classification models in transfer learning settings.
  arXiv  Detail & Related papers  (2023-01-31T19:53:01Z)
• Localized active learning of Gaussian process state space models [63.97366815968177]
  A globally accurate model is not required to achieve good performance in many common control applications. We propose an active learning strategy for Gaussian process state space models that aims to obtain an accurate model on a bounded subset of the state-action space. By employing model predictive control, the proposed technique integrates information collected during exploration and adaptively improves its exploration strategy.
  arXiv  Detail & Related papers  (2020-05-04T05:35:02Z)
• A Near-Optimal Gradient Flow for Learning Neural Energy-Based Models [93.24030378630175]
  We propose a novel numerical scheme to optimize the gradient flows for learning energy-based models (EBMs) We derive a second-order Wasserstein gradient flow of the global relative entropy from Fokker-Planck equation. Compared with existing schemes, Wasserstein gradient flow is a smoother and near-optimal numerical scheme to approximate real data densities.
  arXiv  Detail & Related papers  (2019-10-31T02:26:20Z)

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.