Metraipolis › archive › dc_6f5f5cc32e41

Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies — arXiv:2608.05830

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.05830
License (as archived)
CC0-1.0
Archived
2026-10-31T10:38:17.768Z
SHA-256 of the archived text
f9955b117c63da17beeb416a54448f09e56bc27235b94def1f3d60bcb9f87231
Stable URL of this page
https://metraipolis.com/documento/dc_6f5f5cc32e41

How to cite

Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies — arXiv:2608.05830 — arXiv (en), https://arxiv.org/abs/2608.05830 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6f5f5cc32e41 (Metraipolis archive dc_6f5f5cc32e41, sha256 f9955b117c63da17beeb416a54448f09e56bc27235b94def1f3d60bcb9f87231)
BibTeX
@misc{dc6f5f5cc32e41,
  title = {Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies — arXiv:2608.05830},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.05830},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6f5f5cc32e41; sha256 f9955b117c63da17beeb416a54448f09e56bc27235b94def1f3d60bcb9f87231},
  year = {2026}
}

Archived text

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

Multi-robot task and motion planning for disassembly tasks requires robots to operate in confined workspaces while coordinating their motions with other robots. To tackle this problem, we propose a planning method called coordinated multi-robot disassembly (CoMuDi). CoMuDi coordinates a team of robots for disassembly tasks. The input is a team of robots, an assembly of objects, and a dependency graph. Based on this information, we create compound tasks for pick, place, and exit motions. By propagating temporal constraints, we ensure that each robot can start and end their tasks as early as possible while avoiding collisions with nearby robots. By integrating the space-time RRT* planner (ST-RRT*) into CoMuDi, we ensure that individual tasks minimize arrival time and thereby help us minimize overall makespan. We compare the performance of CoMuDi using both ST-RRT* and RRT* planners with varying time bounds, demonstrating that the combination of CoMuDi and ST-RRT* leads to a higher success rate while minimizing makespan. Finally, we evaluate CoMuDi on six assemblies with up to 49 pieces and up to 9 robots. In those scenarios, we show that CoMuDi returns robot paths that exhibit low idle times, thereby demonstrating that CoMuDi can reliably solve large-scale assemblies.

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