Metraipolis › archive › dc_aeed736d6e19
AC-DC: Adaptive Communication for Scalable Dynamic Average Consensus in Multi-Robot Ergodic Search — arXiv:2609.24702
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.24702
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T22:24:33.398Z
- SHA-256 of the archived text
d5470aa1798db00d51e7b05253223490489c3b4db5c21e4c90ce58a914fe0a20- Stable URL of this page
https://metraipolis.com/documento/dc_aeed736d6e19
How to cite
AC-DC: Adaptive Communication for Scalable Dynamic Average Consensus in Multi-Robot Ergodic Search — arXiv:2609.24702 — arXiv (en), https://arxiv.org/abs/2609.24702 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aeed736d6e19 (Metraipolis archive dc_aeed736d6e19, sha256 d5470aa1798db00d51e7b05253223490489c3b4db5c21e4c90ce58a914fe0a20)
BibTeX
@misc{dcaeed736d6e19,
title = {AC-DC: Adaptive Communication for Scalable Dynamic Average Consensus in Multi-Robot Ergodic Search — arXiv:2609.24702},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.24702},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aeed736d6e19; sha256 d5470aa1798db00d51e7b05253223490489c3b4db5c21e4c90ce58a914fe0a20},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24702. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study scalable peer-to-peer dynamic average consensus (DC) for multi-robot systems under finite-range, finite-rate, and interference-constrained communication. We introduce Adaptive Communication for Dynamic Average Consensus (AC-DC), which jointly adapts Who communicates with whom, When, and over What parts of the consensus state, using local inputs and successfully received neighbor information. Each robot's consensus state estimates the current average of the robots' local inputs. AC-DC updates these estimates as local inputs change and averages the values exchanged between robot pairs. In AC-DC, robot pairs update without waiting for every robot to complete a communication round, and the selected-state messages carry consensus state coordinates independent of team size for a fixed state representation. We apply AC-DC to dynamic-priority multi-robot ergodic search: one consensus stream estimates team visitation for motion coordination, while the other fuses regional measurement information to update uncertainty maps and search targets. Across twelve settings with up to 80 robots and 20 paired trials per setting, AC-DC has the lowest mean (i) normalized covariance-trace area under the curve (AUC) and (ii) attempted modeled communication payload among the compared decentralized methods. Averaged across settings, AC-DC achieves paired AUC reductions of 27.5% relative to state-of-the-art baselines, with 8.7x less communication traffic. As the number of robots increases, we observe that AC-DC's communication payload approaches that of the ideal centralized baseline (one ground compute-station communicating directly with all robots): with 120 robots in a fixed 600 x 600 m scaling test, AC-DC uses 19.3 MB versus 19.2 MB for the ideal centralized baseline, while remaining peer-to-peer. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-22 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2609.24702 — 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-09T21:59:59.748Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).