摘要
将多轴联动插补指令的各坐标相对移动值作为树中节点的权值 ,用 Huffm an算法建立插补树 ,每次插补计算时使用逐点比较法搜索一遍插补树。基于动态 Huffman编码树的坐标分组是最优的 ,在插补运算中具有最快的速度。以联动轴数作为输入考察插补速度 ,算法时间复杂度是对数阶的。
An interpolation tree is created based on Huffman algorithm by considering relative displacements of each coordinate of the multi-axis linkage NC instructions as the weight of tree nodes. Searching the Huffman tree with a point-by-point comparative algorithm is performed at every interpolating computation. Because of the optimum coordinate grouping based on dynamic Huffman coding tree, greatest speed is attained in the interpolating computation. The algorithm running time is a logarithmic function of the number of linkage axes. This algorithm is applied in machining turbine rimed blade bisk of aerospace and rocket engines with EDM.
出处
《中国机械工程》
EI
CAS
CSCD
北大核心
2003年第13期1097-1099,1146,共4页
China Mechanical Engineering
基金
总装备部国防预研项目(41 318.3.2 .5)
