REPRESENTATIONS OF MECHANICAL ASSEMBLY SEQUENCES

被引：140

作者：

DEMELLO, LSH ^{[1
]}

SANDERSON, AC ^{[1
]}

机构：

[1] RENSSELAER POLYTECH INST,DEPT ELECT COMP & SYST ENGN,TROY,NY 12180

来源：

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION | 1991年 / 7卷 / 02期

关键词：

Robotic Assembly;

D O I：

10.1109/70.75904

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper analyzes five representations of assembly sequences. These are based on directed graphs, on AND/OR graphs, on establishment conditions, and on precedence relationships. The latter includes two types: precedence relationships between the establishment of one connection between parts and the establishment of another connection, and precedence relationships between the establishment of one connection and states of the assembly process. The paper discusses how each representation is related to the others. The correctness and completeness of these representations are also addressed. The results presented are needed in the proof of correctness and completeness of algorithms for the generation of mechanical assembly sequences.

引用

页码：211 / 227

页数：17

共 9 条

[1]

Boneschanscher N., 1988, AAAI 88. Seventh National Conference on Artificial Intelligence, P780

[2]

BOURJAULT A, 1984, THESIS U FRANCHECOMT

[3] SIMPLIFIED GENERATION OF ALL MECHANICAL ASSEMBLY SEQUENCES [J].

DEFAZIO, TL ;

WHITNEY, DE .

IEEE JOURNAL OF ROBOTICS AND AUTOMATION, 1987, 3 (06) :640-658

[4]

DEFAZIO TL, 1988, IEEE T ROBOTIC AUTOM, V4, P705

[5] AND OR GRAPH REPRESENTATION OF ASSEMBLY PLANS [J].

DEMELLO, LSH ;

SANDERSON, AC .

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1990, 6 (02) :188-199

[6]

DEMELLO LSH, 1988, 12TH P WORLD C SCI C, V3, P390

[7]

DEMELLO LSH, 1989, THESIS CARNEGIEMELLO

[8]

DEMELLO LSH, 1988, CMURITR8819 CARN U R

[9]

EBBINGHAUS HD, 1984, MATH LOGIC

← 1 →