首页> 外文期刊>IEEE transactions on automation science and engineering >Energy-Optimal Collision-Free Motion Planning for Multiaxis Motion Systems: An Alternating Quadratic Programming Approach
【24h】

Energy-Optimal Collision-Free Motion Planning for Multiaxis Motion Systems: An Alternating Quadratic Programming Approach

机译:多轴运动系统的能量最佳无碰撞运动规划:一种交替二次规划方法

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

摘要

This work investigates energy-optimal motion planning for a class of multiaxis motion systems where the system dynamics are linear time-invariant and decoupled in each axis. Solving the problem in a reliable and efficient manner remains challenging owing to the presence of various constraints on control and states, nonconvexity in its cost function, and obstacles. This paper shows how the cost function can be convexified by considering the system dynamics, while decomposing decision variables to obtain a convex representation of collision avoidance constraints. With the convexified cost function and constraints, the original problem is decomposed into two quadratic programming (QP) problems. An alternating quadratic programming (AQP) algorithm is proposed to solve both the QP problems alternatingly and iteratively till convergence. Requiring an initial feasible trajectory as a guess, AQP necessarily converges to an energy-efficient solution that is homotopic to the initial guess. Under certain circumstances, AQP is guaranteed to produce a local optimum. Simulation demonstrates that AQP is computationally efficient and reliable while claiming comparable energy saving as the mixed-integer QP approach.
机译:这项工作研究了一类多轴运动系统的能量最优运动计划,其中系统动力学是线性时不变的,并且在每个轴上都是解耦的。由于存在对控制和状态的各种限制,成本函数的不凸性和障碍,以可靠,有效的方式解决问题仍然具有挑战性。本文展示了如何通过考虑系统动力学来凸显成本函数,同时分解决策变量以获得凸显冲突避免约束条件。在凸函数函数和约束条件下,原始问题分解为两个二次规划(QP)问题。提出了一种交替二次规划(AQP)算法来交替和迭代地解决QP问题,直到收敛为止。要求初始可行轨迹作为猜测,AQP必须收敛到与初始猜测同等的节能解决方案。在某些情况下,可以保证AQP产生局部最优。仿真表明,AQP在计算上既高效又可靠,同时声称与混合整数QP方法相比具有相当的节能效果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号