An Adaptive Partial Sensitivity Updating Scheme for Fast Nonlinear Model Predictive Control

In recent years, efficient optimization algorithms for nonlinear model predictive control (NMPC) have been proposed, that significantly reduce the online computational time. In particular, the direct multiple shooting and the sequential quadratic programming (SQP) are used to efficiently solve nonli...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on automatic control Ročník 64; číslo 7; s. 2712 - 2726
Hlavní autoři: Chen, Yutao, Bruschetta, Mattia, Cuccato, Davide, Beghi, Alessandro
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.07.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Adaptive control
Algorithms
Computer simulation
Computing time
Convergence
Curvature
Dynamical systems
Error detection
Iterative methods
Jacobian matrices
Nonlinear control
Nonlinear dynamics
Nonlinear model predictive control (NMPC)
Nonlinear programming
Nonlinearity
Optimization
partial sensitivity update optimization algorithms
Prediction algorithms
Predictive control
Quadratic programming
real-time iteration (RTI)
Sensitivity
Stiffness
Tuning
ISSN:0018-9286, 1558-2523
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In recent years, efficient optimization algorithms for nonlinear model predictive control (NMPC) have been proposed, that significantly reduce the online computational time. In particular, the direct multiple shooting and the sequential quadratic programming (SQP) are used to efficiently solve nonlinear programming (NLP) problems arising from continuous-time NMPC applications. One of the computationally demanding steps for the online optimization is the computation of sensitivities of the nonlinear dynamics at every sampling instant, especially for systems of large dimensions, strong stiffness, and when using long prediction horizons. In this paper, within the algorithmic framework of the real-time iteration scheme based on multiple shooting, an inexact sensitivity updating scheme is proposed, that performs a partial update of the Jacobian of the constraints in the NLP. Such update is triggered by using a curvature-like measure of nonlinearity, so that only sensitivities exhibiting highly nonlinear behavior are updated, thus adapting to system operating conditions and possibly reducing the computational burden. An advanced tuning strategy for the updating scheme is provided to automatically determine the number of sensitivities being updated, with a guaranteed bounded error on the quadratic programming solution. Numerical and control performance of the scheme is evaluated by means of two simulation examples performed on a dedicated implementation. Local convergence analysis is also presented and a tunable convergence rate is proven, when applied to the SQP method.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2018.2867916