Metraipolis › archive › dc_ad41e7d8a851
PEEL: Parallel Extraction for Long-Horizon Disassembly Planning via Scale-Invariant Sampling — arXiv:2608.08773
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.08773
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:12:37.983Z
- SHA-256 of the archived text
11d13b9eb2e02754e72268f67b6e57a1f68a391deb391c002b84d0d04fb1080b- Stable URL of this page
https://metraipolis.com/documento/dc_ad41e7d8a851
How to cite
PEEL: Parallel Extraction for Long-Horizon Disassembly Planning via Scale-Invariant Sampling — arXiv:2608.08773 — arXiv (en), https://arxiv.org/abs/2608.08773 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ad41e7d8a851 (Metraipolis archive dc_ad41e7d8a851, sha256 11d13b9eb2e02754e72268f67b6e57a1f68a391deb391c002b84d0d04fb1080b)
BibTeX
@misc{dcad41e7d8a851,
title = {PEEL: Parallel Extraction for Long-Horizon Disassembly Planning via Scale-Invariant Sampling — arXiv:2608.08773},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.08773},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ad41e7d8a851; sha256 11d13b9eb2e02754e72268f67b6e57a1f68a391deb391c002b84d0d04fb1080b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08773. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Long-horizon multi-part object disassembly requires robots to compute feasible sequences of collision-free removal motions, even in the presence of tight, narrow escape corridors. To efficiently solve such disassembly problems, we propose Parallel Extraction for Long-Horizon Disassembly (PEEL), an algorithm which efficiently computes disassembly motions for object assemblies and feeds them to a robot manipulator for execution. PEEL uses sampling-based motion planning to compute single-object motions through the use of a scale-invariant sampling scheme, where the object scale is estimated in a burn-in phase and a subsequent directional sampler exploits the scale. This sampling scheme is integrated into a multi-arm bandit rapidly-exploring random tree (MAB-RRT) planner, which switches between different samplers depending on the reward signal received. Using MAB-RRT, the PEEL algorithm runs a batch of planners in parallel to obtain an ordered graph specifying the sequence in which object parts have to be removed. We show that MAB-RRT can efficiently solve single-part disassemblies with 100 percent success rate on 76 assemblies, and that it is robust to its parameters. By integrating MAB-RRT into PEEL, we solve four long-horizon disassembly problems using the Fetch manipulator robot involving 10 to 17 individual object parts. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-11 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2608.08773 — 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-19T09:11:58.754Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).