摘要
本文提出一个求解机械装配规划的算法,其计算量～O(sN^2),其中s是零件所有可能装配方向的个数,N是工件的零件数(一般s～O(N)).而现行的求机械装配规划的算法,其计算量均随N的增加按指数律增加.
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.
出处
《计算机学报》
EI
CSCD
北大核心
1991年第8期561-569,共9页
Chinese Journal of Computers
基金
国家教委博士点基金
关键词
装配规划
机械工件
复杂性
算法
Assembly planning, computational complexity, mechanical product.
