2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2019
DOI: 10.1109/iros40897.2019.8967788
|View full text |Cite
|
Sign up to set email alerts
|

ALTRO: A Fast Solver for Constrained Trajectory Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
100
0
1

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 126 publications
(103 citation statements)
references
References 14 publications
2
100
0
1
Order By: Relevance
“…Contact sequences can even be optimized simultaneously, using relaxations of the contact model [66,67]. Thanks to efficient open-source numerical solvers [68][69][70] exploiting the sparsity of the trajectory optimization problem and exact derivatives of the dynamic models [71][72][73], wholebody motions can be computed online in less than 7 ms [70,74,75].…”
Section: Recent Progress With Whole-body Modelsmentioning
confidence: 99%
“…Contact sequences can even be optimized simultaneously, using relaxations of the contact model [66,67]. Thanks to efficient open-source numerical solvers [68][69][70] exploiting the sparsity of the trajectory optimization problem and exact derivatives of the dynamic models [71][72][73], wholebody motions can be computed online in less than 7 ms [70,74,75].…”
Section: Recent Progress With Whole-body Modelsmentioning
confidence: 99%
“…Besides, they propose to use an Augmented Lagrangian method. Another Augmented Lagrangian extension called ALTRO [15] has been proposed recently.…”
Section: A Motivation and Related Workmentioning
confidence: 99%
“…Now, the aim is to find an expression for g that is bounded (14), monotonic (15) and, importantly for the convergence of FDDP, continuously differentiable. For the rest of this paper, our sigmoid function has the form (see Fig.…”
Section: A Squashing Functionmentioning
confidence: 99%
“…Classical DDP was initially limited to unconstrained problems. Recent works have proposed using various optimization strategies to handle different levels of constraints: box control constraints (aka box-DDP) [8] via box Quadratic Programming (QP), nonlinear equality constraints [9], [10], [11], [12], a mix of box constraints and equality constraints, and generic nonlinear constraints [13], [14], [15] via either AL, penalty, or SQP methods. However, these solutions either provide limited convergence guarantees (no globalization strategies [3]) or require a significant amount of iterations of the DDP algorithm or the internal numerical routines to converge to a feasible solution, limiting then the deployment of these methods for online Model Predictive Control for instance.…”
Section: Introductionmentioning
confidence: 99%