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

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Mastalli, Carlos, Budhiraja, Rohan, Merkt, Wolfgang, Saurel, Guilhem, Hammoud, Bilal, Naveau, Maximilien, Carpentier, Justin, Righetti, Ludovic, Vijayakumar, Sethu, Mansard, Nicolas
Format: Conference Proceeding
Language:English
Subjects:
Acceleration
Dynamic programming
Heuristic algorithms
Optimal control
Optimization
Robots
Trajectory
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 multipleshooting 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.
ISSN:2577-087X
DOI:10.1109/ICRA40945.2020.9196673