【24h】

OPTIMAL TRAJECTORY PLANNING FOR REDUNDANT MANIPULATORS BASED ON MINIMUM JERK

机译:基于最小跳动的冗余机械臂最优轨迹规划

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

摘要

This paper presents an optimization-based method to solve the smooth trajectory planning problem where the user knows only the start and end points of the end-effector or the via point plus the start and end target points. For the start and end target points, we use an optimization approach to determine the manipulator configurations. Having obtained the desired minimum jerk path in the Cartesian space using the minimum jerk theory and having represented each joint motion by the third-degree B-spline curve with unknown parameters (i.e., control points), an optimization approach, rather than the pseudoinverse technique for inverse kinematics, is used to calculate the control points of each joint spline curve. The objective function includes several parts: (a) dynamic effort; (b) the inconsistency function, which is the joint rate change (first derivative) and predicted overall trend from the initial point to the end point; and (c) the nonsmoothness function of the trajectory, which is the second derivative of the joint trajectory. This method can be used for robotic manipulators with any number of degrees of freedom. Minimum jerk trajectories are desirable for their similarity to human joint movements, for their amenability to limit robot vibrations, and for their control (i.e., enhancement of control performance). Illustrative examples are presented to demonstrate the method.
机译:本文提出了一种基于优化的方法来解决平滑的轨迹规划问题,其中用户仅知道末端执行器或通孔点的起点和终点以及起点和终点目标点。对于起点和终点目标点,我们使用优化方法来确定机械手配置。使用最小加加速度理论获得了笛卡尔空间中所需的最小加加速度路径,并用未知参数(即控制点)的三次B样条曲线表示了每个关节运动,这是一种优化方法,而不是拟逆技术用于逆运动学,用于计算每个关节样条曲线的控制点。目标功能包括几个部分:(a)动态努力; (b)不一致函数,即联合汇率变化(一阶导数)和从起点到终点的总体趋势预测; (c)轨迹的非光滑度函数,它是联合轨迹的二阶导数。此方法可用于任意数量的自由度的机器人操纵器。最小的急动轨迹是理想的,因为它们与人体关节运动相似,可以限制机器人的振动,并且可以进行控制(即增强控制性能)。给出了说明性实例以说明该方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号