2008 47th IEEE Conference on Decision and Control 2008
DOI: 10.1109/cdc.2008.4738806
|View full text |Cite
|
Sign up to set email alerts
|

A tractable approximation of chance constrained stochastic MPC based on affine disturbance feedback

Abstract: Abstract-This paper deals with model predictive control of uncertain linear discrete-time systems with polytopic constraints on the input and chance constraints on the states. Recently, it has been shown that when having merely polytopic constraints and bounded disturbances, the conservatism of a robust solution can be reduced by applying a closed-loop prediction formulation. We show that in the presence of chance constraints and stochastic disturbances, this closed-loop formulation can be used together with a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
105
0
1

Year Published

2011
2011
2021
2021

Publication Types

Select...
5
2
1

Relationship

2
6

Authors

Journals

citations
Cited by 142 publications
(107 citation statements)
references
References 17 publications
1
105
0
1
Order By: Relevance
“…Problem 4 can be solved as a standard QP, see [12]. Theorem 2 (ADF With BDS): For Problem 4, the following statements hold: (1) Problem 4 is a conservative approximation of Problem 2 in the sense that the level of constraint violation is strictly smaller than α.…”
Section: Problem 4 (Adf With Bds)mentioning
confidence: 99%
See 2 more Smart Citations
“…Problem 4 can be solved as a standard QP, see [12]. Theorem 2 (ADF With BDS): For Problem 4, the following statements hold: (1) Problem 4 is a conservative approximation of Problem 2 in the sense that the level of constraint violation is strictly smaller than α.…”
Section: Problem 4 (Adf With Bds)mentioning
confidence: 99%
“…It can also be seen from the fact that linear constraints are used for inner approximations of SOC constraints. 2) BDS (x 0 ) is convex (see [12]). This together with the cost function of Problem 4 being convex according to Proposition 1 establishes the assertion.…”
Section: (2) Problem 4 Is Convexmentioning
confidence: 99%
See 1 more Smart Citation
“…The main benefit of using this affine disturbance feedback formulation is that the resulting optimization problem can be formulated as a convex problem, so that it can be solved using common commercial codes while providing a very good performance [17,18].…”
Section: Stochastic Mpc (Smpc)mentioning
confidence: 99%
“…This approach is different from the previous ones in that it approximates the probability constraints using linear inequalities and the value function is also a certainty equivalent version [33]. We summarize a slightly…”
Section: A Tractable Approximation Of Probability Constrained Stochasmentioning
confidence: 99%