【24h】

A global optimization approach to trajectory planning forindustrial robots

机译:一种用于轨迹规划的全局优化方法工业机器人

获取原文

摘要

A deterministic global optimization approach is proposed for theoptimal trajectory planning of D-joint industrial robots. After mappingCartesian knots into joint knots, by inverse kinematics, they areinterpolated with spline functions under constraints on jointaccelerations and jerks. An interval algorithm, a procedure based oninterval analysis techniques, is presented to determine an optimalpiecewise trajectory which globally minimizes the total travelling time.With arbitrarily sharp precision, this procedure solves the nonlinearlyconstrained optimization problem which is obtained using thebranch-and-bound principle where the branching is performed by uniformsubdivision and the bounding via interval inclusion functions. Theinterval algorithm, implemented in C++ with the PROFIL/BIAS libraries,has been applied to the optimal four-spline planning of a 6-joint arm,and computational results are included
机译:提出了一种确定性的全局优化方法。 D关节工业机器人的最佳轨迹规划。映射后 笛卡尔结变成关节结,通过逆运动学,它们是 在关节约束下用样条函数插值 加速和抽搐。间隔算法,基于 提出了区间分析技术来确定最佳 分段轨迹,总体上使总行驶时间最小化。 该程序以极高的精度,以非线性方式求解 使用 分支定界原理,其中分支由统一执行 通过区间包含函数进行细分和定界。这 间隔算法,使用PROFIL / BIAS库在C ++中实现, 已经应用于6关节手臂的最佳4样条规划, 并包括计算结果

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号