Geometric abstractions to support disassembly analysis

Determining whether an assembly can be constructed from its components at the design stage potentially reduces downstream assembly problems. This determination can be accomplished by performing a disassembly analysis of the assembly′s geometric model. This paper presents two abstractions derived from the assembly′s geometric model that can determine the validity of the assembly: (1) the Assembly Topology Graph (ATG); and (2) the set of boundary components. The first abstraction, the ATG, is a graph whose nodes represent the components in the assembly and whose edges represent a non-null intersection of the convex hulls of component pairs. The second abstraction, the set of boundary components, represents components that intersect the boundary (or convex hull) of the assembly. These boundary components are typically the ones most accessible with respect to disassembly. This paper also discusses an algorithm, which utilizes the ATG to determine pair-wise interlocking components. If such component pairs are absent, then the disassembly sequence for the removal of components in the assembly is determined by analyzing the set of boundary components for disassembly. This procedure is repeated until all the components in the assembly are disassembled (for a valid assembly).

[1]  Arthur C. Sanderson,et al.  Representations of mechanical assembly sequences , 1991, IEEE Trans. Robotics Autom..

[2]  Leora Morgenstern,et al.  Motivated Action Theory: a Formal Theory of Causal Reasoning , 1994, Artif. Intell..

[3]  Bernard Chazelle,et al.  An optimal convex hull algorithm in any fixed dimension , 1993, Discret. Comput. Geom..

[4]  Yangsheng Xu,et al.  Generation of partial medial axis for disassembly motion planning , 1991, Conference Proceedings 1991 IEEE International Conference on Systems, Man, and Cybernetics.

[5]  Joshua U. Turner.  Relative positioning of parts in assemblies using mathematical programming , 1990, Comput. Aided Des..

[6]  Aristides A. G. Requicha,et al.  Representations for assemblies , 1991 .

[7]  Yanxi Liu,et al.  Planning for assembly from solid models , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[8]  D. Halperin,et al.  Assembly partitioning with a constant number of translations , 1994 .

[9]  Bernard Chazelle,et al.  An optimal algorithm for intersecting three-dimensional convex polyhedra , 1989, 30th Annual Symposium on Foundations of Computer Science.

[10]  Micha Sharir,et al.  Efficient generation of k-directional assembly sequences , 1996, SODA '96.

[11]  David G. Kirkpatrick,et al.  A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

[12]  J. Stoer,et al.  Convexity and Optimization in Finite Dimensions I , 1970 .

[13]  Jan Wolter,et al.  A hierarchical approach to assembly planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[14]  David E. Muller,et al.  Finding the Intersection of two Convex Polyhedra , 1978, Theor. Comput. Sci..

[15]  Pradeep K. Khosla,et al.  Motion constraints from contact geometry: representation and analysis , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[16]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[17]  D. Dutta,et al.  Automatic Disassembly and Total Ordering in Three Dimensions , 1991 .

[18]  Rajeev Motwani,et al.  Complexity measures for assembly sequences , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[19]  P.K. Khosla,et al.  Subassembly identification and motion generation for assembly: a geometric approach , 1990, 1990 IEEE International Conference on Systems Engineering.

[20]  Rajit Gadh,et al.  Destructive disassembly to support virtual prototyping , 1998 .

[21]  Jean-Claude Latombe,et al.  Geometric Reasoning About Mechanical Assembly , 1994, Artif. Intell..

[22]  Ralph R. Martin,et al.  Disassembly sequences for objects built from unit cubes , 1993, Comput. Aided Des..

[23]  Andrew Klapper.  A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra , 1987, Inf. Process. Lett..

[24]  Hyung Suck Cho,et al.  On the generation of robotic assembly sequences based on separability and assembly motion stability , 1994, Robotica.