首页> 外文期刊>International Journal of Control, Automation and Systems >Algebraic solution to minimum-time velocity planning
【24h】

Algebraic solution to minimum-time velocity planning

机译:最小时间速度规划的代数解

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

摘要

The paper poses the problem of minimum-time velocity planning subject to a jerk amplitude constraint and to arbitrary velocity/acceleration boundary conditions. This problem which is relevant in the field of autonomous robotic navigation and also for inertial one-dimensional mechatronics systems is dealt with an algebraic approach based on Pontryagin’s Maximum Principle. The exposed complete solution shows how this time-optimal planning can be reduced to the problem of determining the positive real roots of a quartic equation. An algorithm that is suitable for real-time applications is then presented. The paper includes detailed examples also highlighting the special cases of this planning problem.
机译:本文提出了一个最短时间的速度规划问题,该速度规划受到急动幅度约束和任意速度/加速度边界条件的影响。这个问题与自主机器人导航领域以及惯性一维机电一体化系统都息息相关,它是基于庞特里亚金最大原理的代数方法来解决的。完整的公开解决方案显示了如何将这种时间最优计划简化为确定四次方程的正实根的问题。然后提出了适合实时应用的算法。本文提供了详细的示例,还突出了此计划问题的特殊情况。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号