A Spatially Informed Gaussian Process UCB Method for Decentralized Coverage Control
Not on the map. Why?
Abstract (arXiv)
We present a novel decentralized algorithm for coverage control in unknown spatial environments modeled by Gaussian Processes (GPs). To trade-off between exploration and exploitation, each agent autonomously determines its trajectory by minimizing a local cost function. Inspired by the GP-UCB (Upper Confidence Bound for GPs) acquisition function, the proposed cost combines the expected locational cost with a variance-based exploration term, guiding agents toward regions that are both high in predicted density and model uncertainty. Compared to previous work, our algorithm operates in a fully decentralized fashion, relying only on local observations and communication with neighboring agents. In particular, agents periodically update their inducing points using a greedy selection strategy, enabling scalable online GP updates. We demonstrate the effectiveness of our algorithm in simulation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 30 references that are in the map. First posted on arXiv 4 Nov 2025.
Builds on
6 of 30 references.
References · 6
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2014Multi-agents adaptive estimation and coverage control using Gaussian regressioncited by 4
- 2021Multi-Robot Gaussian Process Estimation and Coverage: A Deterministic Sequencing Algorithm and Regret Analysiscited by 4
- 2022Fully Decentralized, Scalable Gaussian Processes for Multi-Agent Federated Learningcited by 4
- 2022Decentralized Learning With Limited Communications for Multi-robot Coverage of Unknown Spatial Fieldscited by 2
- 2019Behavior Mixing with Minimum Global and Subgroup Connectivity Maintenance for Large-Scale Multi-Robot Systemscited by 1
Built on by
Not cited yet.