面向复杂毛坯小余量加工的层次化快速约束配准算法  

A Hierarchical and Fast Algorithm of Constrained Registration for Complex Blanks with Small Machining Allowance

作　　者：李欢[1] 张丽艳[1] 周良明[2] 刘胜兰[1] 

机构地区：[1]南京航空航天大学,南京210016 [2]成都飞机工业(集团)有限责任公司结构件厂,成都610073

出　　处：《中国机械工程》2014年第11期1524-1529,1561,共7页China Mechanical Engineering

基　　金：国家自然科学基金资助项目(50875130);中国博士后科学基金资助项目(2012M521076)

摘　　要：针对复杂结构毛坯的小余量数控加工中很容易出现局部加工余量不足的问题,基于毛坯表面的点云测量数据,提出了一种层次化快速约束配准算法,从而实现加工余量的优化分配。首先通过建立一个知识向导模型并应用局部微分信息,自动分离出毛坯上需要分配余量的各待加工表面,并分别施加最小余量约束,在确定各待加工表面上参与约束配准优化的初始点集的基础上,采用广义乘子法将初始配准点集与设计数模进行约束匹配;然后采用迭代方法将不满足余量约束的测点追加到当前配准点集中,直到所有待加工表面的测点满足余量约束。实验结果表明,该配准算法在最大程度满足余量约束的前提下,显著提高了点云数据的配准效率。For complex structure blanks with small machining allowance, small deviations may result in a shortage of allowance during the machining operation. In order to achieve optimal allocation of machining allowance, a hierarchical and fast algorithm of constrained registration between the dense scanned data of blank parts and the nominal finished part was presented. Firstly, with the aid of an elaborately built segmentation guide, each surface to be machined was separated from the point cloud by using points local differential information. The minimal allowance constraint and an initial data set, which will be involved in the following registration process, were then assigned to each segmented surface respectively. The initial registration datasets were aligned to the design model by u- sing multiplier methods, and then the measured data points that violate the allowance constraint were added iteratively into the current registration dataset until all the scanned points satisfied the allowance constraints. Experiments show that the proposed algorithm can achieve allowance-constrained registration with great efficiency.

关 键 词：余量约束 配准 点云分块 测量数据 

分 类 号：TG659[金属学及工艺—金属切削加工及机床] TP391[自动化与计算机技术—计算机应用技术]