Abstract: Assembly planning based on force-based reasoning of decomposable subassemblies, clusters of parts that are naturally broken apart from an assembly by decomposition forces is presented. The proposed force-based approach does not depend on combinatorial cut-set enumerations, but it generates only the minimal cut-sets of force-flow networks through a max-flow/min-cut algorithm, which incurs only polynomial time complexity. The key features of the proposed approach are as follows: (1) force-flow networks are constructed from the liaison graph of an assembly to represent the maximum amount of forces that individual parts can deliver to their mating parts for the chosen disassembly directions, fixtured and grasped parts, and removable connectors, (2) decomposable subassemblies are identified from the minimal cut- sets of force-flow networks based on a max-flow/min-cut algorithm, (3) the assemblability of the identified decomposable subassemblies are evaluated based on a force-based stability analysis, and (4) planning is done by the recursive decomposition of an assembly into subassemblies and verification of its reversibility.!12
展开▼
