Metraipolis › archive › dc_10ccf56cec82

Asymptotically Optimal Multi-Robot Task and Motion Planning — arXiv:2609.18813

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.18813
License (as archived)
CC0-1.0
Archived
2026-10-15T16:58:48.974Z
SHA-256 of the archived text
b3d8bd213f0fb81c15888cc19eec7207a556d57a1c94f34220dd07beb3454c24
Stable URL of this page
https://metraipolis.com/documento/dc_10ccf56cec82

How to cite

Asymptotically Optimal Multi-Robot Task and Motion Planning — arXiv:2609.18813 — arXiv (en), https://arxiv.org/abs/2609.18813 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_10ccf56cec82 (Metraipolis archive dc_10ccf56cec82, sha256 b3d8bd213f0fb81c15888cc19eec7207a556d57a1c94f34220dd07beb3454c24)
BibTeX
@misc{dc10ccf56cec82,
  title = {Asymptotically Optimal Multi-Robot Task and Motion Planning — arXiv:2609.18813},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.18813},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_10ccf56cec82; sha256 b3d8bd213f0fb81c15888cc19eec7207a556d57a1c94f34220dd07beb3454c24},
  year = {2026}
}

Archived text

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

Multi-robot task and motion planning (MR-TAMP) requires jointly reasoning about discrete task decisions and continuous collision-free motions of multiple interacting robots. Although asymptotically optimal algorithms have been developed for task and motion planning, extending these guarantees to the multi-robot setting introduces an important challenge: different task transitions may involve different subsets of robots and therefore impose constraints of different dimensions on the composite configuration space. Consequently, an asymptotically optimal planner must not only optimize motion within each task mode, but also ensure sufficient exploration of the different types of transitions connecting them. We characterize this transition structure and establish sufficient conditions for global asymptotic optimality in MR-TAMP, requiring persistent coverage of relevant transitions and asymptotically improving motion planning within connected feasible regions. Based on these conditions, we develop an efficient asymptotically optimal MR-TAMP algorithm that combines evolving individual-robot roadmaps with implicit tensor-product search, avoiding explicit construction of the composite roadmap. The planner further employs conditional transition sampling, lazy collision checking, and mode- and solution-level guidance to improve finite-time planning efficiency while retaining persistent exploration. The resulting framework provides asymptotic optimality guarantees for multi-robot manipulation while efficiently exploiting the structure of individual-robot motion planning.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-17 in cs.RO).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2609.18813 — 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-15T16:13:27.329Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).