| 求解机械装配规划的新方法 |
| |
| 引用本文： | 张钹 张铃. 求解机械装配规划的新方法[J]. 计算机学报, 1991, 14(8): 561-569 |
| |
| 作者姓名： | 张钹 张铃 |
| |
| 作者单位： | 清华大学计算机科学与技术系，安庆师范学院数学系 北京 100084，安徽 246011 |
| |
| 摘 要： | 本文提出一个求解机械装配规划的算法,其计算量～O(sN~2),其中s是零件所有可能装配方向的个数,N是工件的零件数(一般s～O(N)).而现行的求机械装配规划的算法,其计算量均随N的增加按指数律增加.
|
| 关 键 词： | 装配规划 机械工件 复杂性 算法 |
A NEW ALGORITHM FOR PLANNING MECHANICAL ASSEMBLY SEQUENCES |
| |
| Zhang Bo. A NEW ALGORITHM FOR PLANNING MECHANICAL ASSEMBLY SEQUENCES[J]. Chinese Journal of Computers, 1991, 14(8): 561-569 |
| |
| Authors: | Zhang Bo |
| |
| Abstract: | A new algorithm for planning mechanical assembly sequences is presented. Its computational complexity is-O(sN2), where s is the number of possible assembly directions of all parts and N is the number of parts composing the given workpiece. Generally, s-O(N). For existed algorithms, the computational complexity grew exponentially with N. |
| |
| Keywords: | Assembly planning computational complexity mechanical product. |
| 本文献已被 CNKI 维普 等数据库收录！ |
