计算机集成制造系统 ›› 2015, Vol. 21 ›› Issue (第1期): 187-194.DOI: 10.13196/j.cims.2015.01.021

• 产品创新开发技术 • 上一篇    下一篇

数控速度规划中的时间最优凸优化方法

方晨曦1,2,张辉1,2,叶佩青1,2,梁文勇3   

  1. 1.清华大学机械工程系
    2.清华大学精密超精密制造装备及控制北京市重点实验室
    3.甘肃省数控机床工程技术研究中心
  • 出版日期:2015-01-31 发布日期:2015-01-31
  • 基金资助:
    国家科技重大专项资助项目(2011ZX04004-012)。

Convex optimization approach in time-optimal feed-rate planning for CNC

  • Online:2015-01-31 Published:2015-01-31
  • Supported by:
    Project supported by the National Science & Technology Major Project,China(No.2011ZX04004-012).

摘要: 针对数控高速高精加工中的速度规划问题,考虑速度、电机力矩和轮廓误差等约束条件,对以时间最优为目标的凸优化方法进行了研究。建立了包含轮廓误差等约束与速度平滑因子的完整速度规划模型,通过参数离散化使问题转化为静态最优问题。为改善求解效率并保证全局最优解,将离散规划模型中的复杂非凸目标函数和约束通过数学变换最终转化为凸优化问题,得到多项式时间的全局最优解。通过数值仿真实验验证了该方法的有效性,分析了平滑因子的影响与计算效率。

关键词: 数控系统, 速度规划, 凸优化, 时间最优

Abstract: Aiming at the feed-rate planning problem in CNC high-speed high-precision machining,a time-optimal feed-rate planning method with the constraints of velocity,viscous friction,torque and contour error was researched.A complete feed-rate planning model including contour error constraint and speed smoothing factor was established and was converted into a static optimal model through parameterization method.To improve the algorithm efficiency for this static optimization problem,the non-convex object function and constraints were transformed into convex optimization through reformulation,which could obtain global optimal solution in polynomial solving time.Simulation results demonstrated the effectiveness of the proposed approach.The computation time and impact of speed smoothing factor was also analyzed.

Key words: computer numerical control, feed-rate planning, convex optimization, time-optimal

中图分类号: