Metraipolis › archive › dc_4d2aaf3e8fcb
Joint Estimation and Network Configuration in Multi-Agent Systems — arXiv:2610.40826
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40826
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T06:00:41.615Z
- SHA-256 of the archived text
13986bd59ae60f71066574078b0385dfdd935ea2bec396ca976850f7db2894e2- Stable URL of this page
https://metraipolis.com/documento/dc_4d2aaf3e8fcb
How to cite
Joint Estimation and Network Configuration in Multi-Agent Systems — arXiv:2610.40826 — arXiv (en), https://arxiv.org/abs/2610.40826 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4d2aaf3e8fcb (Metraipolis archive dc_4d2aaf3e8fcb, sha256 13986bd59ae60f71066574078b0385dfdd935ea2bec396ca976850f7db2894e2)
BibTeX
@misc{dc4d2aaf3e8fcb,
title = {Joint Estimation and Network Configuration in Multi-Agent Systems — arXiv:2610.40826},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40826},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4d2aaf3e8fcb; sha256 13986bd59ae60f71066574078b0385dfdd935ea2bec396ca976850f7db2894e2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40826. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Distributed consensus-based sensing enables a multi-agent system to collaboratively estimate an unknown state by combining local measurements with information received from neighboring agents. In practice, however, the communication network, transmission delays, and finite-rate communication directly affect the disagreement among agents. On the other hand, agreement among agents does not ensure accuracy, particularly when sensors have different measurement uncertainties. We develop a sampled consensus-plus-innovations framework under realistic wireless network constraints that jointly accounts for inter-agent disagreement and estimation inaccuracy. We derive a computable upper bound on the worst-case steady-state estimation error that captures consensus disagreement due to the communication graph, quantization error, and transmission delay, together with estimation inaccuracy, which accounts for measurement uncertainty against the true state. We then use this bound as a network design objective and propose a semi-distributed auction-based algorithm that jointly modifies the communication graph and link-rate allocation. The proposed method preserves connectivity, converges in finite time to a locally auction-stable network configuration, and reduces the bound on the estimation error at every accepted change. The proposed method has been evaluated on various test cases, and the results show that it reduces the estimation error while maintaining fewer links and allocating moderate link rates in a short time. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv eess.SP, nuovi lavori del giorno). Categorie arXiv: Signal Processing (eess.SP). Pagina del lavoro: https://arxiv.org/abs/2610.40826 — 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-11-03T05:42:34.551Z dalla pagina https://arxiv.org/list/eess.SP/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).