Stochastic model predictive control for probabilistically constrained Markovian jump linear systems with additive disturbance. (23rd October 2017)

• Record Type: Journal Article
• Authors: Lu, Jianbo; Xi, Yugeng; Li, Dewei
• Other Names: Quevedo Daniel E. guestEditor.; Chatterjee Debasish guestEditor.
• Is Part Of: International journal of robust and nonlinear control. Volume 29:Number 15(2019)
• Page Start: 5002
• Page End: 5016
• Publication Date: 2017-10-23
• Subjects: long‐run average cost -- Markovian jump linear systems -- maximal admissible sets -- optimal control -- probabilistic constraints -- stochastic model predictive control; Automatic control -- Periodicals; Control theory -- Periodicals; Nonlinear systems -- Periodicals; 629.836
• DOI: 10.1002/rnc.3971
• Languages: English
• ISSNs: 1049-8923

Abstract

Summary: Model predictive control (MPC) for Markovian jump linear systems with probabilistic constraints has received much attention in recent years. However, in existing results, the disturbance is usually assumed with infinite support, which is not considered reasonable in real applications. Thus, by considering random additive disturbance with finite support, this paper is devoted to a systematic approach to stochastic MPC for Markovian jump linear systems with probabilistic constraints. The adopted MPC law is parameterized by a mode‐dependent feedback control law superimposed with a perturbation generated by a dynamic controller. Probabilistic constraints can be guaranteed by confining the augmented system state to a maximal admissible set. Then, the MPC algorithm is given in the form of linearly constrained quadratic programming problems by optimizing the infinite sum of derivation of the stage cost from its steady‐state value. The proposed algorithm is proved to be recursively feasible and to guarantee constraints satisfaction, and the closed‐loop long‐run average cost is not more than that of the unconstrained closed‐loop system with static feedback. Finally, when adopting the optimal feedback gains in the predictive control law, the resulting MPC algorithm has been proved to converge in the mean square sense to the optimal control. A numerical example is given to verify the efficiency of the proposed results.