首页> 外文会议>23rd International Conference on Robotics in Alpe-Adria-Danube Region >A real-time nearly time-optimal point-to-point trajectory planning method using dynamic movement primitives
【24h】

A real-time nearly time-optimal point-to-point trajectory planning method using dynamic movement primitives

机译:使用动态运动基元的实时近时间最优点对点轨迹规划方法

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

摘要

This paper focuses on highly efficient real-time capable time-optimal trajectory planning for point-to-point motions. A method based on the concept of dynamic movement primitives is developed. Thereby an offline generated time-optimal point-to-point trajectory considering nonlinear physical constraints serves as reference for a movement primitive. Through variation of the goal position in a small range around the reference target, new nearly time-optimal point-to-point trajectories are obtained. For the required reconsideration of the physical constraints, a strategy is derived from a common minimum-time optimization problem formulation. Finally a comparison between this and existing realtime capable time-optimal trajectory planning methods is drawn using a six degree-of-freedom serial robot.
机译:本文着重于针对点到点运动的高效实时能力最佳时间轨迹规划。提出了一种基于动态运动原语概念的方法。因此,考虑非线性物理约束的离线生成的时间最优点对点轨迹用作运动原语的参考。通过在参考目标周围的小范围内改变目标位置,可以获得新的近乎时间最佳的点对点轨迹。为了重新考虑物理约束,从常见的最短时间优化问题公式中得出了一种策略。最后,使用六自由度串行机器人对这种方法与现有的实时时间最优轨迹规划方法进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号