Stochastic model predictive control for probabilistically constrained Markovian jump linear systems with additive disturbance

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,...

Full description

Saved in:
Bibliographic Details
Published in:International journal of robust and nonlinear control Vol. 29; no. 15; pp. 5002 - 5016
Main Authors: Lu, Jianbo, Xi, Yugeng, Li, Dewei
Format: Journal Article
Language:English
Published: Bognor Regis Wiley Subscription Services, Inc 01.10.2019
Subjects:
Algorithms
Constraints
Control theory
Feedback control
Linear systems
long‐run average cost
Markov chains
Markovian jump linear systems
maximal admissible sets
Optimal control
Optimization
Perturbation
Predictive control
probabilistic constraints
Probability theory
Quadratic programming
stochastic model predictive control
Stochastic models
ISSN:1049-8923, 1099-1239
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1049-8923
1099-1239
DOI:10.1002/rnc.3971