Metraipolis › archive › dc_81ccc52ca89d

Dispersive Tree Agreements for Multi-Robot Coordination — arXiv:2610.31540

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.31540
License (as archived)
CC0-1.0
Archived
2026-10-25T08:30:50.724Z
SHA-256 of the archived text
5d11cdaf80719e0fdaf331d8988c42b88e9545cdf952560d70be94d5f07c303b
Stable URL of this page
https://metraipolis.com/documento/dc_81ccc52ca89d

How to cite

Dispersive Tree Agreements for Multi-Robot Coordination — arXiv:2610.31540 — arXiv (en), https://arxiv.org/abs/2610.31540 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_81ccc52ca89d (Metraipolis archive dc_81ccc52ca89d, sha256 5d11cdaf80719e0fdaf331d8988c42b88e9545cdf952560d70be94d5f07c303b)
BibTeX
@misc{dc81ccc52ca89d,
  title = {Dispersive Tree Agreements for Multi-Robot Coordination — arXiv:2610.31540},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.31540},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_81ccc52ca89d; sha256 5d11cdaf80719e0fdaf331d8988c42b88e9545cdf952560d70be94d5f07c303b},
  year = {2026}
}

Archived text

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

Multi-robot coordination of nonlinear systems is naturally formulated as joint-space optimal control subject to constraints over groups of robots. Existing methods that approach joint optimality remain largely centralized, offline, and confined to collision-free motion planning, while decentralized, real-time counterparts target safe navigation without pursuing the joint optimum. This paper develops a decentralized, real-time planner that approaches the joint optimum as an anytime process. We extend a recent single-robot framework that searches dispersive trees of forward-propagated commands for differentially flat systems to coordinate a multi-robot team near-optimally. We first show that the inter-robot coupling can be effectively replaced by some local constraints, under which locally grown dispersive trees contain a near-optimal agreement. It is this structure that the robots pursue by decentralized column generation, negotiating rents on the shared space that guide the search of each robot's tree. The negotiation settles on an agreement whose near-optimality is certified at quiescence. Our protocol, WarpWeaver, implements this negotiation as an asynchronous real-time loop over a receding horizon, and demonstrates effective closure to quiesced agreements even when real-time deadlines cut the negotiation short. In simulation, WarpWeaver reduces total travel time by up to 22% against centralized offline planners on the Dynobench suite and by up to 37% against a decentralized real-time baseline, and nearly doubles the success rate of a task-specific planner on graph connectivity. Hardware experiments on six robots planning onboard demonstrate real-world implementability.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.MA, nuovi lavori del giorno).
Categorie arXiv: Robotics (cs.RO) ; Multiagent Systems (cs.MA); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.31540 — 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-25T08:30:42.673Z dalla pagina https://arxiv.org/list/cs.MA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).