首页> 外文期刊>IEEE Transactions on Robotics and Automation >A dynamic programming approach to near minimum-time trajectory planning for two robots
【24h】

A dynamic programming approach to near minimum-time trajectory planning for two robots

机译:一种动态编程方法,用于两个机器人的接近最小时间的轨迹规划

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

摘要

A numerical trajectory planning method is proposed which ensures collision-free and near time-optimal motions for two robotic manipulators with limited actuator torques and velocities. Constraints on accelerations of the robots that are derived from the limited torques of actuators are transformed to the constraints on the curvatures of the coordination curve in coordination space. A dynamic programming technique is then provided on the discretized coordination space to derive a collision-free and time-optimal trajectory pair for the robots. A numerical example is included.
机译:提出了一种数字轨迹规划方法,该方法可确保两个机器人机械手在执行器扭矩和速度有限的情况下无碰撞且接近时间最佳运动。由执行器的有限扭矩得出的机器人加速度约束被转换为协调空间中协调曲线曲率的约束。然后在离散化的协调空间上提供了动态编程技术,以导出机器人的无碰撞且时间最优的轨迹对。包括一个数值示例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号