Second-order constrained dynamic optimization
The International Journal of Robotics Research · 2026-11 · 45 (13) · 2018-2055
DOI: 10.1177/02783649251415417 ↗Kurz gefasst
Fachartikel in der Zeitschrift The International Journal of Robotics Research, online erschienen am 20.03.2026. Verfasst von Yuichiro Aoyama und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 98 Literaturangaben. Gefördert von: Alexander S. Onassis Public Benefit Foundation, Army Research Office.
Abstract (Originalsprache)
This paper provides an overview, analysis, and comparison of second-order dynamic optimization algorithms, that is, constrained differential dynamic programming (DDP) and sequential quadratic programming (SQP). Although a variety of these algorithms have been proposed and used successfully, there exists a gap in understanding the key differences and advantages, which we aim to provide in this work. For constrained DDP, we choose methods that incorporate nonlinear programming techniques to handle state and control constraints, including augmented Lagrangian (AL), interior point, primal-dual augmented Lagrangian (PDAL), and alternating direction method of multipliers (ADMM). Both DDP and SQP are provided in single- and multiple-shooting formulations, where constraints that arise from dynamics are encoded implicitly and explicitly, respectively. As a byproduct of the review, we propose a single-shooting PDAL DDP that has more favorable properties than the standard AL variant, such as the robustness to the growth of penalty parameters. We perform extensive numerical experiments on a variety of systems with increasing complexity to investigate the quality of the solutions, the levels of constraint violation, and the sensitivity of final solutions with respect to initialization, as well as targets. The results show that single-shooting PDAL DDP and multiple-shooting SQP are the most robust methods. For multiple-shooting formulation, both DDP and SQP can enjoy informed initial guesses, while the latter appears to be more advantageous in complex systems. It is also worth highlighting that DDP provides favorable computational complexity and feedback gains as a byproduct of optimization as is.
Förderung
- Alexander S. Onassis Public Benefit Foundation
- Army Research Office
Zitieren
APA
Aoyama, Y., So, O., Saravanos, A. D., & Theodorou, E. A. (2026). Second-order constrained dynamic optimization. The International Journal of Robotics Research, 45(13), 2018-2055. https://doi.org/10.1177/02783649251415417
Vancouver
Aoyama Y, So O, Saravanos AD, Theodorou EA. Second-order constrained dynamic optimization. The International Journal of Robotics Research. 2026;45(13):2018-2055. doi:10.1177/02783649251415417
BibTeX
@article{Aoyama2026,
author = {Aoyama, Yuichiro and So, Oswin and Saravanos, Augustinos D. and Theodorou, Evangelos A.},
title = {Second-order constrained dynamic optimization},
journal = {The International Journal of Robotics Research},
year = {2026},
volume = {45},
number = {13},
pages = {2018--2055},
doi = {10.1177/02783649251415417}
}
EUVIMED