首页> 外文期刊>IEEE Transactions on Robotics >Regularized Hierarchical Differential Dynamic Programming
【24h】

Regularized Hierarchical Differential Dynamic Programming

机译:正则化分层微分动态规划

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

This paper presents a new algorithm for optimal control (OC) of nonlinear dynamical systems. The main feature of this algorithm is that it allows the specification of the control objectives as a hierarchy of tasks, each task representing an action that the robot should perform. Each task is described by a cost function that the algorithm tries to minimize, while not affecting the tasks of higher priority. The concept of strict priority allows for an easier and more robust specification of the control objectives, without hand tuning of task weights. The hierarchy also makes it possible to properly regularize the behavior of each task independently. For the first time, we properly define the problem of regularizing the task cost functions in the presence of a hierarchy and propose an algorithm to compute an approximate solution. Several simulated scenarios with different robots compare our solution with other state-of-the-art methods, validating the interest of the hierarchy in OC and empirically demonstrating the importance of regularization to generate feasible behaviors.
机译:本文提出了一种非线性动力学系统最优控制的新算法。该算法的主要特征是它允许将控制目标指定为任务的层次结构,每个任务代表机器人应执行的动作。每个任务都由成本函数描述,算法会尝试将其最小化,同时不影响优先级较高的任务。严格优先级的概念允许更轻松,更可靠地指定控制目标,而无需手动调整任务权重。层次结构还可以独立地适当规范每个任务的行为。第一次,我们适当地定义了在存在层次结构的情况下对任务成本函数进行正则化的问题,并提出了一种计算近似解的算法。几种使用不同机器人的模拟场景将我们的解决方案与其他最新方法进行了比较,验证了OC中层次结构的兴趣,并从经验上证明了进行正则化以生成可行行为的重要性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号