DISASSEMBLY SEQUENCES FOR OBJECTS BUILT FROM UNIT CUBES

被引:27
作者
BEASLEY, D
MARTIN, RR
机构
[1] Department of Computing Mathematics, University of Wales College of Cardiff, Cardiff, CF2 4YN
关键词
DISASSEMBLY SEQUENCE; GLOBAL GEOMETRIC FEASIBILITY; FACE COUPLING;
D O I
10.1016/0010-4485(93)90102-T
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The geometrical problem of finding a possible disassembly sequence for an object is considered for a limited class of objects: those whose parts can be made from collections of unit cubes. For such objects, we consider motions of their component parts which are translations in one of three orthogonal directions. A working program has been implemented in POP-11, which finds a disassembly sequence for an object defined by a 3D cube map. Each disassembly step may consist of either one or two linear motions of single parts. Removal of subassemblies consisting of more than one part is not considered. To ensure properly the validity of a disassembly motion, both local and global geometric information must be considered. The local geometric feasibility of a motion relates to whether an infinitesimal motion can be made, and it is determined by the surface contacts (mates) between a part and other parts. The global geometric feasibility of a motion relates to whether a finite (or infinite) motion can be made in a particular direction. It depends not only on the relationship between the part to be moved and those that it touches, but also on its relationship with, potentially, all the other parts in the assembly. To determine the global geometric feasibility of a motion, the idea of coupling between two faces is introduced. Coupling is a directional quantity which gives the finite limit on the relative motion between two faces. By considering the coupling information for all the faces of a part, it is easy to determine the finite motions that are possible in any direction.
引用
收藏
页码:751 / 761
页数:11
相关论文
共 12 条
  • [1] Woo, Dutta, Automatic disassembly and total ordering in three dimensions, Journal of Engineering for Industry, pp. 207-213, (1991)
  • [2] DeFazio, Whitney, Simplified generation of all mechanical assembly sequences, IEEE J. Robot. & Automat., Vol RA3, 6, pp. 640-658, (1987)
  • [3] Wesley, Lozano-Perez, Lieberman, Lavin, Grossman, A geometric modeling system for automated mechanical assembly, IBM J. Res. & Develop., 24, 1, pp. 64-74, (1980)
  • [4] Woodwark, Computing Shape, (1986)
  • [5] Ko, Lee, Automatic assembly procedure generation from mating conditions, Comput.-Aided Des., 19, 1, pp. 3-10, (1987)
  • [6] Khosla, Mattikali, Determining the assembly sequence from a 3D model, J. Mech. Working Tech., 20, 9, pp. 153-162, (1989)
  • [7] Homem de Mello, Sanderson, A correct and complete algorithm for the generation of mechanical assembly sequences, IEEE Trans. Robot. & Automat., 7, 2, pp. 228-240, (1991)
  • [8] Barrett, Ramsay, Sloman, POP-11: A Practical Language for Artificial Intelligence, (1985)
  • [9] Woo, Interfacing solid modeling to CAD and CAM: data structures and algorithms for decomposing a solid, Computer, 17, 12, (1984)
  • [10] Woo, A combinatorial analysis of boundary data structure schemata, IEEE Comput. Graph. & Applic., 5, 3, pp. 19-27, (1985)