Metraipolis › archive › dc_9eff2f4df596

Semi-discrete Optimal Transport for Time-Varying Multi-Agent Coverage Control — arXiv:2601.21753

Source: arXiv (en)
Original: https://arxiv.org/abs/2601.21753
License (as archived): CC0-1.0
Archived: 2026-10-10T02:04:51.935Z
SHA-256 of the archived text: d48c097128959597ad8dc247ecfee66bff3df11a15a8c64d6ea0700794219551
Stable URL of this page: https://metraipolis.com/documento/dc_9eff2f4df596

How to cite

Semi-discrete Optimal Transport for Time-Varying Multi-Agent Coverage Control — arXiv:2601.21753 — arXiv (en), https://arxiv.org/abs/2601.21753 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9eff2f4df596 (Metraipolis archive dc_9eff2f4df596, sha256 d48c097128959597ad8dc247ecfee66bff3df11a15a8c64d6ea0700794219551)

BibTeX

@misc{dc9eff2f4df596,
  title = {Semi-discrete Optimal Transport for Time-Varying Multi-Agent Coverage Control — arXiv:2601.21753},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2601.21753},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9eff2f4df596; sha256 d48c097128959597ad8dc247ecfee66bff3df11a15a8c64d6ea0700794219551},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2601.21753. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Coverage control algorithms have traditionally focused on static target densities, where agents optimally cover a fixed spatial distribution. However, many applications, such as environmental monitoring, surveillance, and adaptive sensing, involve time-varying densities. While time-varying coverage has been studied in Voronoi-based frameworks, extending recent optimal transport formulations of static coverage control to time-varying target densities remains an open problem. This paper presents a semi-discrete optimal transport framework for time-varying coverage control, in which agents track the first-order optimality conditions associated with minimizing the instantaneous Wasserstein distance from an evolving target density. The proposed approach is based on a coupled system of differential equations governing agent positions and the dual variables defining Laguerre regions. The resulting optimality residuals converge exponentially to zero, with global convergence established for one-dimensional domains. We also derive decentralized approximations and numerical simulations demonstrate improved tracking performance over quasi-static and Voronoi-based methods.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.OC).
Categorie arXiv: Systems and Control (eess.SY) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2601.21753 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T01:45:31.251Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).