TY - GEN
T1 - Distributed stochastic MPC of linear systems with parameter uncertainty and disturbances
AU - Dai, Li
AU - Xia, Yuanqing
AU - Gao, Yulong
AU - Cannon, Mark
N1 - Publisher Copyright:
© 2016 TCCT.
PY - 2016/8/26
Y1 - 2016/8/26
N2 - In this paper, we propose a distributed stochastic model predictive control (DSMPC) algorithm for a team of linear subsystems sharing coupled probabilistic constraints. Each subsystem is subject to both parameter uncertainty and stochastic disturbances. To handle the probabilistic constraints, we first decompose the state trajectory into a nominal part and an uncertain part. The latter one is further divided into two parts: one is bounded by probabilistic tubes that are calculated offline by making full use of the probabilistic information on disturbances, whereas the other is bounded by polytopic tubes whose scaling is optimized online and whose facets' orientations are chosen offline. Under the update strategy that only one subsystem is permitted to optimize at each time step, probabilistic constraints are transformed into linear constraints, and the original optimization problem is then formulated as a convex problem. In addition, this new algorithm does not rely on instantaneous inter-subsystem exchanges of data during a time step, and therefore may have a relatively low susceptibility to communication delay. By constructing a decoupled terminal set for each subsystem, the proposed algorithm guarantees recursive feasibility with respect to both local and coupled probabilistic constraints and ensures stability in closed-loop operation. Finally, numerical simulations illustrate the efficacy of the theoretical results.
AB - In this paper, we propose a distributed stochastic model predictive control (DSMPC) algorithm for a team of linear subsystems sharing coupled probabilistic constraints. Each subsystem is subject to both parameter uncertainty and stochastic disturbances. To handle the probabilistic constraints, we first decompose the state trajectory into a nominal part and an uncertain part. The latter one is further divided into two parts: one is bounded by probabilistic tubes that are calculated offline by making full use of the probabilistic information on disturbances, whereas the other is bounded by polytopic tubes whose scaling is optimized online and whose facets' orientations are chosen offline. Under the update strategy that only one subsystem is permitted to optimize at each time step, probabilistic constraints are transformed into linear constraints, and the original optimization problem is then formulated as a convex problem. In addition, this new algorithm does not rely on instantaneous inter-subsystem exchanges of data during a time step, and therefore may have a relatively low susceptibility to communication delay. By constructing a decoupled terminal set for each subsystem, the proposed algorithm guarantees recursive feasibility with respect to both local and coupled probabilistic constraints and ensures stability in closed-loop operation. Finally, numerical simulations illustrate the efficacy of the theoretical results.
KW - Distributed control
KW - Model predictive control (MPC)
KW - Probabilistic constraints
KW - Stochastic systems
UR - http://www.scopus.com/inward/record.url?scp=84987896899&partnerID=8YFLogxK
U2 - 10.1109/ChiCC.2016.7554022
DO - 10.1109/ChiCC.2016.7554022
M3 - Conference contribution
AN - SCOPUS:84987896899
T3 - Chinese Control Conference, CCC
SP - 4312
EP - 4317
BT - Proceedings of the 35th Chinese Control Conference, CCC 2016
A2 - Chen, Jie
A2 - Zhao, Qianchuan
A2 - Chen, Jie
PB - IEEE Computer Society
T2 - 35th Chinese Control Conference, CCC 2016
Y2 - 27 July 2016 through 29 July 2016
ER -