pith. sign in

arxiv: 2511.02398 · v2 · pith:P6QXBXDPnew · submitted 2025-11-04 · 💻 cs.LG

A Spatially Informed Gaussian Process UCB Method for Decentralized Coverage Control

classification 💻 cs.LG
keywords agentsalgorithmcostdecentralizedcontrolcoverageexplorationfunction
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.