State-Based Disassembly Planning
Chao Lei, Nir Lipovetzky, Krista A. Ehinger
Abstract
It has been shown recently that physics-based simulation significantly enhances the disassembly capabilities of real-world assemblies with diverse 3D shapes and stringent motion constraints. However, the efficiency suffers when tackling intricate disassembly tasks that require numerous simulations and increased simulation time. In this work, we propose a State-Based Disassembly Planning (SBDP) approach, prioritizing physics-based simulation with translational motion over rotational motion to facilitate autonomy, reducing dependency on human input, while storing intermediate motion states to improve search scalability. We introduce two novel evaluation functions derived from new Directional Blocking Graphs (DBGs) enriched with state information to scale up the search. Our experiments show that SBDP with new evaluation functions and DBGs constraints outperforms the state-of-the-art in disassembly planning in terms of success rate and computational efficiency over benchmark datasets consisting of thousands of physically valid industrial assemblies.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Related papers
- Operator-Potential Heuristics for Symbolic SearchDaniel Fiser, Álvaro Torralba, Jörg HoffmannAAAI 2022 · 8 citations
- Computational Design of Coordinate-Motion AssembliesYukun Lu, Ke Chen, Ligang Liu, Peng SongSIGGRAPH 2026
- Beyond Conservation: Flexible Molecular Assembly with Unbalanced Diffusion BridgeRongchao Zhang, Yiwei Lou, Yu Huang, Yi Xin et al.AAAI 2026
- C-Space tunnel discovery for puzzle path planningXinya Zhang, Robert Belfer, Paul G. Kry, Etienne VougaSIGGRAPH 2020 · 19 citations
- Computational design of high-level interlocking puzzlesRulin Chen, Ziqi Wang, Peng Song, Bernd BickelSIGGRAPH 2022 · 25 citations
