Optimally designed Lyapunov–Krasovskii terminal costs for robust stable–feasible model predictive control of uncertain time-delay nonlinear dynamical systems

Abstract

This article details a new Model Predictive Control algorithm ensuring robust stability and control feasibility for uncertain nonlinear multi-input multi-output dynamical systems considering uncertain time-delay effects. The proposed control algorithm is based on construction of a Lyapunov–Krasovskii functional as terminal cost. Incorporation of this terminal cost into the Model Predictive Control optimization problem and calculation of the associated admissible set result in robust feasibility and robust stability of closed-loop system in presence of uncertain time-delay effects and bounded disturbance signals. The Lyapunov–Krasovskii functional term is constructed with respect to predicted sliding functions over the prediction horizon and considers the effects of dynamical variations over the prediction horizon in generation of control inputs. As dynamical variations are investigated in a sample-to-sample basis, feasible sliding regions are updated at each sample as well. Finally, based on expression of sliding functions as a combination of dynamical variations and input-based terms, required control inputs are calculated in the admissible bound by the optimization algorithm. Construction of control scheme on this basis permits straightforward calculation of robust stability and feasibility conditions for a general class of uncertain nonlinear system in finite prediction horizon whereas in the previous works, often-restrictive conditions were considered for the investigated dynamical systems. Numerical illustrations indicate precision and efficiency of control algorithm and improved stability and convergence rate for multivariable nonlinear dynamical systems considering uncertain time-delay effects. Finally, hardware-in-the-loop implementation indicates applicability of the proposed scheme in real-time control applications particularly in case appropriate compromises between optimality and calculation speed are considered.