摘要
本文提出一种基于二次B样条曲线对G01代码的拟合及插补方法,先通过自适应方法选取G01代码所描述的加工轨迹形状特征的各个特征点,再用通过所有特征点的二次B样条曲线拟合待加工路径.由于Timar等人提出的最优速度规划算法对于三次及三次以上的高阶次样条曲线的计算极为复杂,本文提出了一种改进的基于二次B样条曲线的时间最优插补计算方法.最后,将所提出的算法应用到实际的图案加工仿真与实际数控加工中.
In this paper, curve fitting of 3-D points generated by G01 codes and interpolation based on quadratic B-splines are studied. Feature points of G01 codes are selected using an adaptive method. Next, quadratic B-splines are obtained as the fitting curve by interpolating these feature points. Computations required in implementing the velocity planning algorithm mentioned by Timer et al. are very complicated because of the appearance of high-order curves. An improved time-optimal method for the quadratic B-spline curves is presented to circumvent this issue. The algorithms are verified with simulations as well as on real CNC machines.
出处
《中国科学：信息科学》
CSCD
2011年第11期1388-1400,共13页
Scientia Sinica(Informationis)
基金
中国科学院知识创新工程重要方向项目(批准号:KGCX2-YW-119-1)
基金委创新群体项目(批准号:NSFC608210021/F02)资助
