| 基于图分解的装配序列生成算法研究 |
| |
| 引用本文： | 白芳妮,李磊,魏生民,贺辛亥. 基于图分解的装配序列生成算法研究[J]. 机械科学与技术, 2000, 19(6): 1035-1037 |
| |
| 作者姓名： | 白芳妮 李磊 魏生民 贺辛亥 |
| |
| 作者单位： | [1]西北工业大学,西安 [2]西北纺织工学院,西安 |
| |
| 基金项目： | 国家863计划(863-517-9843-006)及国家自然科学基金(69883005)资助 |
| |
| 摘 要： | 对装配序列生成中几种常用的方法进行了详细的探讨与比较 ,提出基于图分解的装配序列生成算法 ,并对图分解法中序列数随零件数剧增的问题 ,采用增加更多的可行性判断标准 ,利用闭环规则、超集规则和子集规则简化计算 ,并预先从部件层次图提取优选子装配体 ,从而使装配序列能够简单、准确、高效生成。
|
| 关 键 词： | 装配序列 割集 与或图 |
| 文章编号： | 1003-8728(2000)06-1035-03 |
| 修稿时间： | 1999-09-06 |
Research on Generation of Assembly Sequences Based on Decomposition of Graph |
| |
| BAI Fang ni ,LI Lei,WEI Sheng min,HE Xin hai. Research on Generation of Assembly Sequences Based on Decomposition of Graph[J]. Mechanical Science and Technology for Aerospace Engineering, 2000, 19(6): 1035-1037 |
| |
| Authors: | BAI Fang ni LI Lei WEI Sheng min HE Xin hai |
| |
| Affiliation: | BAI Fang ni 1,LI Lei,WEI Sheng min,HE Xin hai |
| |
| Abstract: | This paper use the decomposition of assembly connection graph to generate and/or graph representation of all feasible assembly sequences. In order to generate and/or graph efficiently, we first use local geometrical feasibility and global geometrical feasibility conditions to check valid disassembling; then we use three rules to simplify the computation of feasible disassembling. Finally we use component hierarchy graph to retrieve preferred subassemblies to simplify assembly connection graph. After using these three methods, the size of and/or graph can be decreased dramatically, all feasible assembly sequences can be generated correctly and completely. |
| |
| Keywords: | Assembly sequences Decomposition And/or graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
