An Analysis of Closed-Loop Stability for Linear Model Predictive Control Based on Time-Distributed Optimization

Time-distributed Optimization (TDO) is an approach for reducing the computational burden of Model Predictive Control (MPC). When using TDO, optimization iterations are distributed over time by maintaining a running solution estimate and updating it at each sampling instant. In this paper, the specific case of using TDO in linear-quadratic MPC subject to input constraints is studied, and analytic expressions for the system gains and the sufficient amount of iterations required for asymptotic stability are derived. Further, it is shown that the closed-loop stability of TDO-based MPC can be guaranteed using multiple mechanisms including increasing the number of solver iterations, preconditioning the optimal control problem, adjusting the MPC cost matrices, and reducing the length of the receding horizon. These results in a linear system setting also provide insights and guidelines that could be more broadly applicable, e.g., to nonlinear MPC.

[1]  A. Teel A nonlinear small gain theorem for the analysis of control systems with saturation , 1996, IEEE Trans. Autom. Control..

[2]  K. T. Tan,et al.  Linear systems with state and control constraints: the theory and application of maximal output admissible sets , 1991 .

[3]  R. Rockafellar,et al.  Implicit Functions and Solution Mappings , 2009 .

[4]  Ilya Kolmanovsky,et al.  Time-distributed optimization for real-time model predictive control: Stability, robustness, and constraint satisfaction , 2020, Autom..

[5]  Andreas Kugi,et al.  Stability and Incremental Improvement of Suboptimal MPC Without Terminal Constraints , 2010, IEEE Transactions on Automatic Control.

[6]  Adrien B. Taylor,et al.  Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization , 2017, Journal of Optimization Theory and Applications.

[7]  Zhong-Ping Jiang,et al.  Nonlinear small-gain theorems for discrete-time feedback systems and applications , 2004, Autom..

[8]  Christopher M. Kellett,et al.  A compendium of comparison function results , 2014, Math. Control. Signals Syst..

[9]  James B. Rawlings,et al.  On the inherent robustness of optimal and suboptimal nonlinear MPC , 2017, Syst. Control. Lett..

[10]  Zhong-Ping Jiang,et al.  Input-to-state stability for discrete-time nonlinear systems , 1999 .

[11]  M. Diehl,et al.  Nominal stability of real-time iteration scheme for nonlinear model predictive control , 2005 .

[12]  Alberto Bemporad,et al.  Stabilizing Linear Model Predictive Control Under Inexact Numerical Optimization , 2014, IEEE Transactions on Automatic Control.

[13]  David Q. Mayne,et al.  Constrained model predictive control: Stability and optimality , 2000, Autom..

[14]  D. Q. Mayne,et al.  Suboptimal model predictive control (feasibility implies stability) , 1999, IEEE Trans. Autom. Control..

[15]  Takeshi Hatanaka,et al.  Instant MPC for Linear Systems and Dissipativity-Based Stability Analysis , 2019, IEEE Control Systems Letters.

[16]  Goele Pipeleers,et al.  Real-time proximal gradient method for embedded linear MPC , 2019, Mechatronics.

[17]  Yurii Nesterov,et al.  Gradient methods for minimizing composite functions , 2012, Mathematical Programming.

[18]  Manfred Morari,et al.  Computational Complexity Certification for Real-Time MPC With Input Constraints Based on the Fast Gradient Method , 2012, IEEE Transactions on Automatic Control.

[19]  Knut Graichen A fixed-point iteration scheme for real-time model predictive control , 2012, Autom..

[20]  Alberto Bemporad,et al.  An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control , 2014, IEEE Transactions on Automatic Control.

[21]  Ilya V. Kolmanovsky,et al.  Embedding Constrained Model Predictive Control in a Continuous-Time Dynamic Feedback , 2017, IEEE Transactions on Automatic Control.

[22]  Lars Grüne,et al.  Analysis of unconstrained NMPC schemes with incomplete optimization , 2010 .

[23]  Y. Nesterov A method for solving the convex programming problem with convergence rate O(1/k^2) , 1983 .