首页> 外文学位 >Time-optimal feedrates for Cartesian machines with axes constraints.
【24h】

Time-optimal feedrates for Cartesian machines with axes constraints.

机译:具有轴约束的笛卡尔机床的时间最优进给率。

获取原文
获取原文并翻译 | 示例

摘要

On a 3-axis CNC milling machine, the cutting tool and work piece move relative to one another along the three Cartesian axes in accordance with the specified tool path r(xi) and feedrate v. The motion is controlled by a computer and actuated by DC motors. This study concerns specification of the feedrate v(xi) providing minimum-time traversal of a curved path, provided axes constraints deriving from actuator physical limitations. The study develops and implements generic feedrate computation and machine interpolator algorithms for three axis constraint cases: (1) constant acceleration limits, (2) constant acceleration and speed limits, and (3) constant and speed-dependent acceleration limits. The solution employs bang-bang control, demanding maximum or minimum acceleration of any one axis throughout traversal. In each case, cutting forces, friction, and other effects are neglected, thus only inertial effects are considered. Implementation examples are provided for several representative curves in each axis constraints case.; The study applies, and extends, algorithms developed in the robotics field in the 1980s concerning minimum-time traversal of an n-link robotic manipulator end-effector along a specified path, provided symmetric joint torque limits. The unique application to Cartesian machines admits closed-form optimal feedrate expressions, with several novel outcomes: feedrates are expressed as a piecewise-analytic functions of the curve parameter; feedrate computation shifts from numerical integration to linear programming and polynomial root solving; an error is highlighted in the established feedrate computation algorithm, prompting a correction and summary; and the feedrate furnishes interpolator algorithms for real-time machine control. The study applies the corrected robotics algorithm to the first axis constraint case, then extends the algorithm to consider the second and third cases.
机译:在三轴CNC铣床上,切削刀具和工件根据指定的刀具路径r(xi)和进给率v沿三个直角坐标轴相对移动。该运动由计算机控制并由直流电动机。这项研究涉及进给率v(xi)的规范,提供了曲线路径的最短时间遍历,条件是轴的约束源自执行机构的物理限制。该研究针对三轴约束情况开发并实现了通用进给率计算和机床插补器算法:(1)恒定加速度极限,(2)恒定加速度和速度极限,以及(3)恒定和速度相关的加速度极限。该解决方案采用bang-bang控制,在整个运行过程中要求任一轴的最大或最小加速度。在每种情况下,切削力,摩擦力和其他影响都可以忽略,因此仅考虑惯性影响。在每个轴约束情况下,提供了一些示例性曲线的实现示例。这项研究适用并扩展了1980年代机器人领域开发的算法,该算法涉及在指定对称关节转矩限制的情况下沿着指定路径最小遍历n链接机器人操纵器末端执行器的算法。笛卡尔机床的独特应用允许闭合形式的最佳进给率表达式,具有一些新颖的结果:进给率表示为曲线参数的分段分析函数;进给率计算从数值积分转向线性规划和多项式根求解;建立的进给率计算算法中突出显示错误,提示进行校正和总结;进给率提供了用于实时机器控制的插补算法。该研究将校正后的机器人算法应用于第一个轴约束情况,然后扩展该算法以考虑第二个和第三个情况。

著录项

  • 作者

    Timar, Sebastian D.;

  • 作者单位

    University of California, Davis.;

  • 授予单位 University of California, Davis.;
  • 学科 Engineering Mechanical.
  • 学位 Ph.D.
  • 年度 2005
  • 页码 120 p.
  • 总页数 120
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 机械、仪表工业;
  • 关键词

  • 入库时间 2022-08-17 11:42:37

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号