Metraipolis › archive › dc_fdd68753dcc5
Dual-arm Cooperation for Tabletop Wiping with Temporal Object Removal — arXiv:2610.19527
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.19527
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T21:57:51.940Z
- SHA-256 of the archived text
5fecaf9c5941677b20d4e54ca94f22071c9c6513f0dddec28632b04108165941- Stable URL of this page
https://metraipolis.com/documento/dc_fdd68753dcc5
How to cite
Dual-arm Cooperation for Tabletop Wiping with Temporal Object Removal — arXiv:2610.19527 — arXiv (en), https://arxiv.org/abs/2610.19527 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fdd68753dcc5 (Metraipolis archive dc_fdd68753dcc5, sha256 5fecaf9c5941677b20d4e54ca94f22071c9c6513f0dddec28632b04108165941)
BibTeX
@misc{dcfdd68753dcc5,
title = {Dual-arm Cooperation for Tabletop Wiping with Temporal Object Removal — arXiv:2610.19527},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.19527},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fdd68753dcc5; sha256 5fecaf9c5941677b20d4e54ca94f22071c9c6513f0dddec28632b04108165941},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19527. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We devise a dual-arm cooperative planning framework for wiping table surface in the presence of scattered objects. Unlike conventional surface-cleaning strategies that only cover free areas and detour around obstacles, our framework explicitly assigns one arm to rearrange objects while the other performs coverage wiping, thereby enabling access to previously obstructed regions. Specifically, we first construct a set of wiping and object-rearrangement action primitives. Based on these primitives, we introduce Geo-MILP, a geometry-aware task planner formulated as Mixed-Integer Linear Programming (MILP). By integrating Logic-Based Benders Decomposition (LBBD), Geo-MILP iteratively optimizes action sequencingand timing to resolve geometric conflicts, promoting efficient cooperation between wiping and object rearrangement. We then employ K-Order Markov Optimization (KOMO) to generate smooth, collision-free motions to ensure feasible execution. Simulation and physical experiments demonstrate that the proposed framework not only increases reachable coverage by enabling access to obstructed areas, but also significantly improves time efficiency compared to Task and Motion Planning (TAMP) baselines, reducing planning time by up to 9 times and execution makespan by approximately 40%. 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.19527 — 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-15T21:38:44.452Z dalla pagina https://arxiv.org/list/cs.RO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).