【24h】

MINIMUM-JERK TRAJECTORY PLANNING OF A 3-DOF TRANSLATIONAL PARALLEL MANIPULATOR

机译:三自由度平移并联机械手的最小冲击弹道规划

获取原文

摘要

Since jerk-limiting is universally recognized to possess the advantages of reducing residual vibration and improving accuracy, this paper utilizes a minimum-jerk trajectory planning algorithm in trajectory planning of a three degree-of-freedom 3-Prismatic-Universal-Universal (3PUU) translational parallel manipulator. The trajectory execution time is set to fixed time duration. The sequence of joint positions are derived by a series of predefined via-points in Cartesian space through kinematic inversion. In order to generate a trajectory featuring great continuity and fine smoothness, a piecewise fifth-order polynomial is used to interpolate the joint position series and generate a s-mooth trajectory characterized by continuous velocity, acceleration, and jerk. The minimum jerk trajectory planning algorithm, which minimizes the maximum of the absolute value of joints' jerk, is actually a constrained minimax optimization problem. Subjecting to the specified limitations of kinematic constraints, this multi-variables constrained optimization problem is solved by the sequential quadratic programming (SQP) strategy. The simulated results demonstrate that this trajectory planning algorithm for the designed parallel manipulator is effective and feasible.
机译:由于加速度率限制已被普遍认为具有减少残留振动和提高精度的优点,因此本文将最小加速度率轨迹规划算法用于三自由度3棱镜通用宇宙(3PUU)的轨迹规划中平移并联机械手。轨迹执行时间设置为固定的持续时间。关节位置的顺序是通过运动学反演由笛卡尔空间中的一系列预定义通孔点得出的。为了生成具有极大连续性和优良平滑度的轨迹,使用分段五阶多项式对关节位置序列进行插值,并生成以连续速度,加速度和加加速度为特征的s平滑轨迹。最小颠簸轨迹规划算法将关节颠簸的绝对值的最大值最小化,实际上是一个受约束的极大极小优化问题。受到运动学约束的指定限制,此多变量约束优化问题通过顺序二次规划(SQP)策略解决。仿真结果表明,所设计的并联机械手轨迹规划算法是有效可行的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号