2015
DOI: 10.1109/tac.2014.2336358
|View full text |Cite
|
Sign up to set email alerts
|

Robust Tube MPC for Linear Systems With Multiplicative Uncertainty

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

3
125
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 115 publications
(128 citation statements)
references
References 6 publications
3
125
0
Order By: Relevance
“…From the fact that limlvp,lfalse(jfalse)=0, limlfp,l=0, and limlfcp,l=0, the existence of these terminal sets, ie, the existence of trueθ˜p for each subsystem satisfying , can be ensured if l = N 1 − N is chosen to be sufficiently large and the following conditions are satisfied: false‖Mpmaxj‖‖trued¯pfalse(jfalse)1maxj‖‖Mpfalse(jfalse)<hptrueβ¯p,1empscriptP,-2em truep=1Npfalse‖Mcpmaxj‖‖trued¯pfalse(jfalse)1maxj‖‖Mpfalse(jfalse)<bctrueκ¯c,1emcscriptC. …”
Section: Centralized Smpc Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…From the fact that limlvp,lfalse(jfalse)=0, limlfp,l=0, and limlfcp,l=0, the existence of these terminal sets, ie, the existence of trueθ˜p for each subsystem satisfying , can be ensured if l = N 1 − N is chosen to be sufficiently large and the following conditions are satisfied: false‖Mpmaxj‖‖trued¯pfalse(jfalse)1maxj‖‖Mpfalse(jfalse)<hptrueβ¯p,1empscriptP,-2em truep=1Npfalse‖Mcpmaxj‖‖trued¯pfalse(jfalse)1maxj‖‖Mpfalse(jfalse)<bctrueκ¯c,1emcscriptC. …”
Section: Centralized Smpc Algorithmmentioning
confidence: 99%
“…Motivated by the works discussed above, using the tube invariant set theory,() this paper considers a more challenging problem of DSMPC for a group of linear subsystems in a simultaneous presence of parameter uncertainty and stochastic disturbances as well as coupled probabilistic constraints. To make the optimization problem tractable in a distributed manner, we adopt the distributed update strategy in the work of Trodden and Richards that only one subsystem is permitted to optimize at each time step.…”
Section: Introductionmentioning
confidence: 99%
“…The first two elements of the disturbance vector v z in (26), namely, w andx * , are confined to sets centred around the origin (see the description of w in Section 2 and the bound oñ x * in (23), respectively). The third and fourth elements of v, ie,x andū, belong to sets centred at x s and u s , respectively (see (8)). Hence, the disturbance term can be bounded as…”
Section: Healthy Set Computationmentioning
confidence: 99%
“…While MPC provides a widely effective means of computing an “optimal” control law in the presence of constraints for linear systems (see, eg, the work of Goodwin et al), the effects of model uncertainty projected over the evolution of predicted states can cause the computational burden to grow exponentially with the prediction horizon. This difficulty can be overcome through the use of tube‐based MPC (see, eg, the work of Fleming et al), whereby one can recursively define tubes with cross‐sections that will contain the predicted state trajectory. Knowing that the predicted states lie in sets (cross‐sections of the “tube”), it is possible to formulate conditions that guarantee satisfaction of hard constraints (see, eg, the work of Rawlings and Mayne).…”
Section: Introductionmentioning
confidence: 99%
“…The first control input of the sequence is applied to the plant at the current state and the process is repeated, which provides an effective way to approximate the optimal solution. 2,3 In the real control process with constraints and disturbances, MPC provides a suitable method to overcome the potential performance degradation and stability problems. [4][5][6][7] In published literatures on MPC, there are many instructive results to reduce the impacts of uncertainty and disturbances.…”
Section: Introductionmentioning
confidence: 99%