TY - GEN
T1 - Crocoddyl
T2 - 2020 IEEE International Conference on Robotics and Automation, ICRA 2020
AU - Mastalli, Carlos
AU - Budhiraja, Rohan
AU - Merkt, Wolfgang
AU - Saurel, Guilhem
AU - Hammoud, Bilal
AU - Naveau, Maximilien
AU - Carpentier, Justin
AU - Righetti, Ludovic
AU - Vijayakumar, Sethu
AU - Mansard, Nicolas
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/5
Y1 - 2020/5
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85092743956&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85092743956&partnerID=8YFLogxK
U2 - 10.1109/ICRA40945.2020.9196673
DO - 10.1109/ICRA40945.2020.9196673
M3 - Conference contribution
AN - SCOPUS:85092743956
T3 - Proceedings - IEEE International Conference on Robotics and Automation
SP - 2536
EP - 2542
BT - 2020 IEEE International Conference on Robotics and Automation, ICRA 2020
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 31 May 2020 through 31 August 2020
ER -