AUTOMATIC DISASSEMBLY AND TOTAL ORDERING IN 3-DIMENSIONS

被引：73

作者：

WOO, TC

DUTTA, D

机构：

[1] Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI

[2] Design Laboratory, Department of Mechanical Engineering, University of Michigan, Ann Arbor, MI

来源：

JOURNAL OF ENGINEERING FOR INDUSTRY-TRANSACTIONS OF THE ASME | 1991年 / 113卷 / 02期

关键词：

D O I：

10.1115/1.2899679

中图分类号：

TH [机械、仪表工业];

学科分类号：

0802 ;

摘要：

Generating a sequence of motions for removing components in a three-dimensional assembly, one at a time, is considered-the robot motion being strictly translational. We map the boundary representation of a given assembly to a tree structure called Disassembly Tree (DT). Traversing the DT in pre- and post-order yields a minimal sequence of operations for disassembly and assembly, respectively. In this paper, an assembly is classified by the logical complexity of its DT (an ordered graph whose nodes are components of the given assembly) and by the geometric complexity of the nodes in DT (in terms of the number of motions needed to remove a single component). Next, whether a component can be removed in one motion is described as a predicate. This predicate is then used in an algorithm for constructing the DT. For a class of assemblies that exhibit total ordering, the algorithm decides whether each component can be removed in a single motion, by constructing a DT in O (N log N) time, on the average, where N is the total number of mating faces in the assembly.

引用

页码：207 / 213

页数：7

共 11 条

[1]

Aho A.V., Hopcroft E., Ullman J.D., Data Structures and Algorithms, (1983)

[2]

Hopcroft J.E., Schwartz J.T., Sharir M., On the Complexity of Motion Planning for Multiple Independent Objects: PSPACE Hardness of the Warehousemans Problem,”, Int. J. Of Robotics Research, 3, 4, pp. 76-88, (1984)

[3]

O'Dunlaing C., Yap C., A Retraction Method for Planning the Motion of a Disc, J. Of Algorithms, 6, pp. 104-111, (1985)

[4]

Preparata F.P., Supowit K., Testing a Simple Polygon for Monotonicity, Information Processing Letters, 12, 4, pp. 161-163, (1981)

[5]

Reif J., Complexity of the Mover’s Problems and Generalizations, Proc. 20Th IEE Symp. On Foundations of Computer Science, pp. 421-427, (1979)

[6]

Schwartz J.T., Sharir M., On the Piano Movers Problem: II. General Techniques for Computing Topological Properties of Real Algebraic Manifolds,”, Advances in Appl. Math, 4, pp. 298-351, (1983)

[7]

Schwartz J.T., Sharir M., On the Piano Movers Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers,”, Int. J. Of Robotics Research, 2, 3, pp. 46-75, (1983)

[8]

Winston P.H., Artificial Intelligence, pp. 157-164, (1977)

[9]

Woo T.C., A Combinatorial Analysis of Boundary Data Structure Schemata, IEEE Computer Graphics &Applications, 5, 3, pp. 19-27, (1985)

[10]

Woo T.C., Wolter J.D., A Constant Average Time and Linear Storage Data Structure for Three-Dimensional Objects, IEEE Trans. Systems, Man and Cybernetics, SMC-14, 3, pp. 510-515, (1984)

← 1 2 →