An algorithmic guide for finite-dimensional optimal control problems
Preprint
Abstract
We survey the main numerical techniques for finite-dimensional nonlinear optimal control. The chapter is written as a guide to practitioners who wish to get rapidly acquainted with the main numerical methods used to efficiently solve an optimal control problem. We consider two classical examples, simple but significant enough to be enriched and generalized to other settings: Zermelo and Goddard problems. We provide sample of the codes used to solve them and make these codes available online. We discuss direct and indirect methods, Hamilton-Jacobi approach, ending with optimistic planning. The examples illustrate the pros and cons of each method, and we show how these approaches can be combined into powerful tools for the numerical solution of optimal control problems for ordinary differential equations.Keywords
All Related Versions
This publication has 55 references indexed in Scilit:
- An interior penalty method for optimal control problems with state and input constraints of nonlinear systemsOptimal Control Applications and Methods, 2014
- Functional Analysis, Calculus of Variations and Optimal Control2013
- On relations of the adjoint state to the value function for optimal control problems with state constraintsNonlinear Differential Equations and Applications NoDEA, 2012
- Morse-Sard type results in sub-Riemannian geometryMathematische Annalen, 2005
- Semi-Lagrangian Schemes for Hamilton–Jacobi Equations, Discrete Representation Formulae and Godunov MethodsJournal of Computational Physics, 2002
- $L^1$-Stability and error estimates for approximate Hamilton-Jacobi solutionsNumerische Mathematik, 2001
- Nonsmooth Analysis and Control Theory1998
- Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations1997
- WaveLab and Reproducible Research1995
- New results on the relationship between dynamic programming and the maximum principleMathematics of Control, Signals, and Systems, 1988