A simple and efficient algorithm for nonlinear model predictive control
- 1 December 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1939-1944
Abstract
We present PANOC, a new algorithm for solving optimal control problems arising in nonlinear model predictive control (NMPC). A usual approach to this type of problems is sequential quadratic programming (SQP), which requires the solution of a quadratic program at every iteration and, consequently, inner iterative procedures. As a result, when the problem is ill-conditioned or the prediction horizon is large, each outer iteration becomes computationally very expensive. We propose a line-search algorithm that combines forward-backward iterations (FB) and Newton-type steps over the recently introduced forward-backward envelope (FBE), a continuous, real-valued, exact merit function for the original problem. The curvature information of Newton-type methods enables asymptotic superlinear rates under mild assumptions at the limit point, and the proposed algorithm is based on very simple operations: access to first-order information of the cost and dynamics and low-cost direct linear algebra. No inner iterative procedure nor Hessian evaluation is required, making our approach computationally simpler than SQP methods. The low-memory requirements and simple implementation make our method particularly suited for embedded NMPC applications.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- Active Sets, Nonsmoothness, and SensitivitySIAM Journal on Optimization, 2002
- Newton's Method for Large Bound-Constrained Optimization ProblemsSIAM Journal on Optimization, 1999
- A Limited Memory Algorithm for Bound Constrained OptimizationSIAM Journal on Scientific Computing, 1995
- Solution of discrete-time optimal control problems on parallel computersParallel Computing, 1990
- Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problemsJournal of Optimization Theory and Applications, 1989
- On the limited memory BFGS method for large scale optimizationMathematical Programming, 1989
- A projected Newton method for minimization problems with nonlinear inequality constraintsNumerische Mathematik, 1988
- Projected gradient methods for linearly constrained problemsMathematical Programming, 1987
- Two-Metric Projection Methods for Constrained OptimizationSIAM Journal on Control and Optimization, 1984