Time-optimal interpolation for five-axis CNC machining along parametric tool path based on linear programming
Time-optimal interpolation for five-axis CNC machining along parametric tool path based on linear programming
复制标题
DOI：
10.1007/s00170-013-5083-x
复制
发表时间：
2013-06
期刊：
影响因子：
--
通讯作者：
Wei Fan;X. Gao;Chen-Han Lee;Ke Zhang;Qiang Zhang
中科院分区：
文献类型：
--
作者：
Wei Fan;X. Gao;Chen-Han Lee;Ke Zhang;Qiang Zhang
研究了在弦误差、加速度和加加速度约束下，五轴数控加工沿着给定参数刀具轨迹的时间最优速度规划问题。通过对刀具轨迹等参数进行离散化处理，将弦误差、进给速度和加速度约束下的速度规划问题转化为等价的线性规划问题。在此基础上，给出了一个计算复杂度为O（N3.5）的多项式时间算法来求解最优解，其中N为刀具轨迹的离散段数，通过用线性函数逼近非线性加加速度约束，将弦误差、进给速度、加速度和加加速度约束下的速度规划问题转化为线性规划问题。因此，一个多项式时间的算法，找到近似的时间最优解。仿真结果表明了算法的有效性。
In this paper, the time-optimal velocity planning problem for five-axis computer numerical control machining along a given parametric tool path under chord error, acceleration, and jerk constraints is studied. The velocity planning problem under confined chord error, feedrate, and acceleration is reduced to an equivalent linear programming problem by discretizing the tool path and other quantities. As a consequence, a polynomial time algorithm with computational complexityO(N3.5) is given to find the optimal solution, whereNis the number of discretized segments of the tool path. The velocity planning problem under confined chord error, feedrate, acceleration, and jerk is reduced to a linear programming program by using a linear function to approximate the nonlinear jerk constraint. As a consequence, a polynomial time algorithm is given to find the approximate time-optimal solution. Simulation results are used to show the efficiency and effectiveness of the algorithms.