Aligator

Aligator is an efficient and versatile trajectory optimization library for robotics and beyond.

It can be used for motion generation and planning, optimal estimation, deployment of model-predictive control on complex systems, and much more.

Developing advanced, open-source, and versatile robotic software such as Aligator takes time and energy while requiring a lot of engineering support. In recognition of our commitment, we would be grateful if you would quote our papers and software in your publications, software, and research articles. Please refer to the Citation section for further details.

Features

Aligator is a C++ template library, which provides

a modeling interface for optimal control problems, node-per-node
a set of efficient solvers for constrained trajectory optimization
support for the pinocchio rigid-body dynamics library and its analytical derivatives
an interface to the Crocoddyl trajectory optimization library which can be used as an alternative frontend
Python bindings leveraging eigenpy

Aligator provides efficient implementations of the following algorithms for (constrained) trajectory optimization:

ProxDDP: Proximal Differentiable Dynamic Programming, detailed in this paper
FeasibleDDP: Feasible Differentiable Dynamic Programming, detailed in this paper

Installation

From Conda

From our channel.

conda install -c simple-robotics aligator

Build from source

git clone https://github.com/Simple-Robotics/aligator --recursive
cmake -DCMAKE_INSTALL_PREFIX=your_install_folder -S . -B build/ && cd build/
cmake --build . -jNCPUS

Dependencies

proxsuite-nlp
Eigen3 >= 3.3.7
Boost >= 1.71.0
(optional) eigenpy>=3.2.0 | conda (Python bindings)
(optional) Pinocchio | conda
(optional) Crocoddyl | conda
(optional) example-robot-data | conda (required for some examples and benchmarks)
a C++14 compliant compiler

Python dependencies

Notes

For developers, add the -DCMAKE_EXPORT_COMPILE_COMMANDS=1 when working with language servers e.g. clangd.
To use the Crocoddyl interface, add -DBUILD_CROCODDYL_COMPAT=ON
By default, building the library will instantiate the templates for the double scalar type.
To build against a Conda environment, activate the environment and run export CMAKE_PREFIX_PATH=$CONDA_PREFIX before running CMake and use $CONDA_PREFIX as your install folder.

Benchmarking

We recommend using Flame Graphs to evaluate performance. If you have the Rust toolchain and cargo installed, we suggest you install cargo-flamegraph. Then, you can create a flame graph with the following command:

flamegraph -o my_flamegraph.svg -- ./build/examples/example-croc-talos-arm

Citing Aligator

To cite Aligator in your academic research, please use the following bibtex entry:

@misc{aligatorweb,
  author = {Jallet, Wilson and Bambade, Antoine and El Kazdadi, Sarah and Justin, Carpentier and Nicolas, Mansard},
  title = {aligator},
  url = {https://github.com/Simple-Robotics/aligator}
}

Please also consider citing the reference paper for the ProxDDP algorithm:

@misc{jalletPROXDDPProximalConstrained2023,
  title = {{PROXDDP: Proximal Constrained Trajectory Optimization}},
  author = {Jallet, Wilson and Bambade, Antoine and Arlaud, Etienne and {El-Kazdadi}, Sarah and Mansard, Nicolas and Carpentier, Justin},
  year = {2023},
  abstract = {Trajectory optimization (TO) has proven, over the last decade, to be a versatile and effective framework for robot control. Several numerical solvers have been demonstrated to be fast enough to allow recomputing full-dynamics trajectories for various systems at control time, enabling model predictive control (MPC) of complex robots. These first implementations of MPC in robotics predominantly utilize some differential dynamic programming (DDP) variant for its computational speed and ease of use in constraint-free settings. Nevertheless, many scenarios in robotics call for adding hard constraints in TO problems (e.g., torque limits, obstacle avoidance), which existing solvers, based on DDP, often struggle to handle. Effectively addressing path constraints still poses optimization challenges (e.g., numerical stability, efficiency, accuracy of constraint satisfaction) that we propose to solve by combining advances in numerical optimization with the foundational efficiency of DDP. In this article, we leverage proximal methods for constrained optimization and introduce a DDP-like method to achieve fast, constrained trajectory optimization with an efficient warm-starting strategy particularly suited for MPC applications. Compared to earlier solvers, our approach effectively manages hard constraints without warm-start limitations and exhibits commendable convergence accuracy. Additionally, we leverage the computational efficiency of DDP, enabling real-time resolution of complex problems such as whole-body quadruped locomotion. We provide a complete implementation as part of an open-source and flexible C++ trajectory optimization library called ALIGATOR. These algorithmic contributions are validated through several trajectory planning scenarios from the robotics literature and the real-time whole-body MPC of a quadruped robot.},
  langid = {english},
  note = {https://inria.hal.science/hal-04332348v1}
}

Contributors

Antoine Bambade (Inria): mathematics and algorithms developer
Justin Carpentier (Inria): project instructor
Wilson Jallet (LAAS-CNRS/Inria): main developer and manager of the project
Sarah Kazdadi: linear algebra czar
Quentin Le Lidec (Inria): feature developer
Joris Vaillant (Inria): core developer
Nicolas Mansard (LAAS-CNRS): project coordinator
Guilhem Saurel (LAAS-CNRS): core maintener
Fabian Schramm (Inria): core developer
Ludovic De Matteïs (LAAS-CNRS/Inria): feature developer
Ewen Dantec (Inria): feature developer

Acknowledgments

The development of Aligator is actively supported by the Willow team @INRIA and the Gepetto team @LAAS-CNRS.

jcarpent / aligator