Iterative Linear Quadratic Optimization for Nonlinear Control: Differentiable Programming Algorithmic Templates
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915372512313344 |
|---|---|
| author | Roulet, Vincent Srinivasa, Siddhartha Fazel, Maryam Harchaoui, Zaid |
| author_facet | Roulet, Vincent Srinivasa, Siddhartha Fazel, Maryam Harchaoui, Zaid |
| contents | Iterative optimization algorithms depend on access to information about the objective function. In a differentiable programming framework, this information, such as gradients, can be automatically derived from the computational graph. We explore how nonlinear control algorithms, often employing linear and/or quadratic approximations, can be effectively cast within this framework. Our approach illuminates shared components and differences between gradient descent, Gauss-Newton, Newton, and differential dynamic programming methods in the context of discrete time nonlinear control. Furthermore, we present line-search strategies and regularized variants of these algorithms, along with a comprehensive analysis of their computational complexities. We study the performance of the aforementioned algorithms on various nonlinear control benchmarks, including autonomous car racing simulations using a simplified car model. All implementations are publicly available in a package coded in a differentiable programming language. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2207_06362 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Iterative Linear Quadratic Optimization for Nonlinear Control: Differentiable Programming Algorithmic Templates Roulet, Vincent Srinivasa, Siddhartha Fazel, Maryam Harchaoui, Zaid Optimization and Control Machine Learning Systems and Control 68Q25, 49M37 G.1.6 Iterative optimization algorithms depend on access to information about the objective function. In a differentiable programming framework, this information, such as gradients, can be automatically derived from the computational graph. We explore how nonlinear control algorithms, often employing linear and/or quadratic approximations, can be effectively cast within this framework. Our approach illuminates shared components and differences between gradient descent, Gauss-Newton, Newton, and differential dynamic programming methods in the context of discrete time nonlinear control. Furthermore, we present line-search strategies and regularized variants of these algorithms, along with a comprehensive analysis of their computational complexities. We study the performance of the aforementioned algorithms on various nonlinear control benchmarks, including autonomous car racing simulations using a simplified car model. All implementations are publicly available in a package coded in a differentiable programming language. |
| title | Iterative Linear Quadratic Optimization for Nonlinear Control: Differentiable Programming Algorithmic Templates |
| topic | Optimization and Control Machine Learning Systems and Control 68Q25, 49M37 G.1.6 |
| url | https://arxiv.org/abs/2207.06362 |