SIMPLIFIED GENERATION OF ALL MECHANICAL ASSEMBLY SEQUENCES
SIMPLIFIED GENERATION OF ALL MECHANICAL ASSEMBLY SEQUENCES
复制标题
DOI：
10.1109/jra.1987.1087132
复制
发表时间：
1987-12-01
期刊：
影响因子：
--
通讯作者：
WHITNEY, DE
中科院分区：
文献类型：
--
作者：
DEFAZIO, TL;WHITNEY, DE
Bourjault 提出了一种方法，该方法将为构成组件的一组零件生成所有有效的装配序列。提出了对 Bourjault 方法的修改，使这种装配分析技术能够实际应用于零件数量大大增加的装配。两种方法之间的显着区别在于问题的形式和数量，问题的答案产生允许通过算法生成装配序列的关系。 Bourjault 的方法需要 2l^{2} 个问题以及通常大量的后续问题，这些问题的存在取决于前一个问题集的部分答案；所有人都有是或否的答案。 （这里l是部分之间关系的数量。）修改后的方法需要2l个问题，并以优先逻辑形式回答；这些问题类似于工程师在考虑组装一组零件时提出的问题。介绍了应用和使用技术，并显示了 l 至 18 的示例。
Bourjault has presented a method which will generate all valid assembly sequences for the set of parts that constitute an assembly. A modification of Bourjault's method is presented which makes practical the application of this technique of assembly analysis to assemblies with greatly increased part count. The salient difference between the two methods is in the form and number of the questions whose answers yield the relations that allow algorithmic generation of assembly sequences. Bourjault's method requires 2l^{2} questions plus an often-large number of subsequent questions whose existence depends on answers to part of the former question set; all have yes or no answers. (Here l is the number of relations between parts.) The modified method requires 2l questions that are answered in a precedence-logical form; the questions are similar to those asked by an engineer contemplating assembly of a set of parts. Applications and techniques for use are presented, and examples are shown for l as great as 18.