State-Based Disassembly Planning
Chao Lei, Nir Lipovetzky, Krista A. Ehinger
TL;DR
This paper addresses the inefficiency and limited autonomy of physics-based disassembly planners that rely on exhaustive simulations and manual motion-mode selection. It introduces State-Based Disassembly Planning (SBDP), a framework that prioritizes translational motion, stores intermediate motion states, and uses Directional Blocking Graphs (DBGs) with state information to guide search. DBG-guided SBDP achieves state-of-the-art performance on a large benchmark, solving 4135 of 4196 problems (98.55%) and reducing search space and planning time relative to prior methods, while enabling mixed translational and rotational actions within a single plan. The work significantly advances autonomous, scalable disassembly planning and offers pathways for integration with learning-based guidance and assembly-by-disassembly tasks in industrial settings.
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.
