Metraipolis › archive › dc_43e74544abe9
Decentralized Multi-Robot Task Allocation Under Degraded Communication: A Benchmark of Performance, Reliability, and Computation — arXiv:2609.13711
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13711
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T02:09:26.027Z
- SHA-256 of the archived text
95728db3a7ebdcbc0d2a271514456f0a3c880ed77fe45305bc316d8b692e2d9c- Stable URL of this page
https://metraipolis.com/documento/dc_43e74544abe9
How to cite
Decentralized Multi-Robot Task Allocation Under Degraded Communication: A Benchmark of Performance, Reliability, and Computation — arXiv:2609.13711 — arXiv (en), https://arxiv.org/abs/2609.13711 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_43e74544abe9 (Metraipolis archive dc_43e74544abe9, sha256 95728db3a7ebdcbc0d2a271514456f0a3c880ed77fe45305bc316d8b692e2d9c)
BibTeX
@misc{dc43e74544abe9,
title = {Decentralized Multi-Robot Task Allocation Under Degraded Communication: A Benchmark of Performance, Reliability, and Computation — arXiv:2609.13711},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13711},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_43e74544abe9; sha256 95728db3a7ebdcbc0d2a271514456f0a3c880ed77fe45305bc316d8b692e2d9c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13711. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Selecting a decentralized Multi-Robot Task Allocation (MRTA) method for embedded deployment on autonomous platforms requires considering more than route performance alone. We benchmark six decentralized MRTA allocators (CBAA, ACBBA, PI, HIPC, DMCHBA, and DGA) in the Collaborative Visit (CV) scenario to characterize tradeoffs among MinMax and MinSum travel, communication robustness and demand, allocation reliability, computational burden, and scale sensitivity. The core study uses 500 paired ten-target instances across 25 ideal and degraded communication conditions spanning Bernoulli loss, Gilbert--Elliott loss, and Rayleigh fading, with additional campaigns examining pre-allocation, execution-integrated computation, and sensitivity to grid size, robot density, and target load. Across the 24 impaired core conditions, DGA and DMCHBA achieved the lowest mean MinMax travel at 24.49 and 24.78 steps, respectively. HIPC narrowly led mean MinSum travel at 66.95 steps, followed by DGA at 67.22, with both methods occupying the top two in every impaired condition. DMCHBA had the lowest publication intensity at 2.08 publications per team step. In ten-target pre-allocation, HIPC and DMCHBA remained viable and stable in every tested condition, while ACBBA, PI, and DGA lost stability or viability as communication degraded. Under ideal delivery, median full-protocol computation $\Cterm$ in the primary ten-target comparison ranged from 4.88 ms for DMCHBA to 1.346 s for DGA. Static route quality preserved DGA and DMCHBA as the leading MinMax methods, while DGA led MinSum at three of four target loads and HIPC led at 50 targets. Static and execution-integrated computation rankings diverged as task load increased. The results identify distinct allocator operating regions across route objective, communication behavior, reliability, and computational constraints. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-15 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2609.13711 — 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-16T01:52:32.304Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).