Metraipolis › archive › dc_161db783f502

Embedded Evaluation of Task Admission Coalescing in Decentralized Multi-Robot Systems — arXiv:2610.09187

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.09187
License (as archived)
CC0-1.0
Archived
2026-10-08T12:48:53.424Z
SHA-256 of the archived text
621701a38011aa0c5cd2146e79252d9c9b8777589de2942e83a55181f9734b3e
Stable URL of this page
https://metraipolis.com/documento/dc_161db783f502

How to cite

Embedded Evaluation of Task Admission Coalescing in Decentralized Multi-Robot Systems — arXiv:2610.09187 — arXiv (en), https://arxiv.org/abs/2610.09187 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_161db783f502 (Metraipolis archive dc_161db783f502, sha256 621701a38011aa0c5cd2146e79252d9c9b8777589de2942e83a55181f9734b3e)
BibTeX
@misc{dc161db783f502,
  title = {Embedded Evaluation of Task Admission Coalescing in Decentralized Multi-Robot Systems — arXiv:2610.09187},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.09187},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_161db783f502; sha256 621701a38011aa0c5cd2146e79252d9c9b8777589de2942e83a55181f9734b3e},
  year = {2026}
}

Archived text

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

Multi-robot task allocators in dynamic missions commonly admit newly released tasks immediately, potentially invoking allocation for each new arrival. We evaluate task-admission coalescing as a mechanism for controlling allocator processor work while accounting for target-service latency, using CBAA, ACBBA, PI, and HIPC as a representative MRTA suite. The study comprises a 3,000-mission AGX Orin campaign with measured computation delay, 3,000 paired zero-compute missions, and a 96-mission Pololu 3pi+ RP2040 allocator hardware-in-the-loop campaign. Immediate (Eager) admission is compared with thresholds of two, four, and eight tasks and a four-task policy with a 10-s waiting bound across three arrival rates. Across the AGX experiments, coalescing reduces both allocator calls and processor work in 31 of 48 evaluated conditions, although the magnitude of the saving varies by allocator. The principal cost appears under sparse arrivals, where four-task batching increases online-target mean latency by 20.08-23.57 s, predominantly through admission waiting. Bounded admission reduces mean work in ten of twelve allocator-load conditions, including a 19.35% reduction with a 1.40-s mean latency increase for high-arrival HIPC. RP2040 experiments show that this tradeoff can become more favorable as processor constraints tighten. Across four matched medium-arrival HIPC scenarios, Count b=4 reduces mean RP2040 work by 59.85% and service latency by 39.47%, while the corresponding AGX cases increase latency by 27.69%. These results show that the usefulness of task-admission coalescing depends on arrival intensity, allocator-specific behavior, and the relative cost of computation on the execution platform.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.RO, nuovi lavori del giorno).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2610.09187 — 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-08T12:18:30.501Z dalla pagina https://arxiv.org/list/cs.RO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).