arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.04947cs.ROmath.OC
收藏

Crocoddyl:一种高效通用的多触点最优控制框架

Crocoddyl: An Efficient and Versatile Framework for Multi-Contact Optimal Control

LAAS-CNRS(法国国家科学研究中心自动化、机器人与微电子实验室);University of Edinburgh(爱丁堡大学);The Alan Turing Institute(阿兰·图灵研究所);University of Oxford(牛津大学);Max Planck Institute for Intelligent Systems(马克斯·普朗克智能系统研究所);New York University(纽约大学);INRIA(法国国家信息与自动化研究所);ENS(巴黎高等师范学院);CNRS(法国国家科学研究中心);PSL Research University(巴黎文理研究大学)

Carlos Mastalli, Rohan Budhiraja, Wolfgang Merkt, Guilhem Saurel, Bilal Hammoud, Maximilien Naveau, Justin Carpentier, Ludovic Righetti, Sethu Vijayakumar, Nicolas Mansard

摘要:

我们介绍Crocoddyl(接触机器人控制差分动态库),一个开源的框架,为高效的多接触最优控制。Crocoddyl有效地计算状态轨迹和控制策略,为一个给定的预定义的接触序列。它的效率是由于使用稀疏的解析导数,开发的问题结构,和数据共享。它采用微分几何来正确描述任何几何系统的状态,例如浮基系统。此外,我们还提出了一种新的最优控制算法--柔性驱动微分动态规划(FDDP)。我们的方法不添加额外的决策变量,这通常会增加每次迭代的计算时间,由于因式分解。与经典的差分动态规划(DDP)算法相比,FDDP算法具有更好的全局化策略.具体来说,我们提出了两个修改经典的DDP算法。首先,向后传递接受不可行的状态控制轨迹。第二,在早期的“探索性”迭代中,卷展保持间隙开放(正如在只有等式约束的多次射击方法中所期望的那样)。我们展示了我们的框架使用不同的任务的性能。使用我们的方法,我们可以在几毫秒内计算高动态机动(例如跳跃,前空翻)。

英文摘要:

We introduce Crocoddyl (Contact RObot COntrol by Differential DYnamic Library), an open-source framework tailored for efficient multi-contact optimal control. Crocoddyl efficiently computes the state trajectory and the control policy for a given predefined sequence of contacts. Its efficiency is due to the use of sparse analytical derivatives, exploitation of the problem structure, and data sharing. It employs differential geometry to properly describe the state of any geometrical system, e.g. floating-base systems. Additionally, we propose a novel optimal control algorithm called Feasibility-driven Differential Dynamic Programming (FDDP). Our method does not add extra decision variables which often increases the computation time per iteration due to factorization. FDDP shows a greater globalization strategy compared to classical Differential Dynamic Programming (DDP) algorithms. Concretely, we propose two modifications to the classical DDP algorithm. First, the backward pass accepts infeasible state-control trajectories. Second, the rollout keeps the gaps open during the early "exploratory" iterations (as expected in multiple-shooting methods with only equality constraints). We showcase the performance of our framework using different tasks. With our method, we can compute highly-dynamic maneuvers (e.g. jumping, front-flip) within few milliseconds.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑