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

Stochastic Tubes in Model Predictive Control With Probabilistic Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

2
190
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
8
1
1

Relationship

1
9

Authors

Journals

citations
Cited by 219 publications
(192 citation statements)
references
References 19 publications
2
190
0
Order By: Relevance
“…Recent work [83,84] proposed SMPC algorithms that use probabilistic information on additive disturbances in order to minimize the expected value of a predicted cost subject to hard and soft (probabilistic) constraints. Stochastic tubes were used to provide a recursive guarantee of feasibility and thus ensure closed loop stability and constraint satisfaction.…”
Section: Earlier Workmentioning
confidence: 99%
“…Recent work [83,84] proposed SMPC algorithms that use probabilistic information on additive disturbances in order to minimize the expected value of a predicted cost subject to hard and soft (probabilistic) constraints. Stochastic tubes were used to provide a recursive guarantee of feasibility and thus ensure closed loop stability and constraint satisfaction.…”
Section: Earlier Workmentioning
confidence: 99%
“…The first class consists of stochastic tube approaches [5,6,7] that use stochastic tubes with fixed or variable cross sections to replace chance constraints with linear constraints on the nominal state predictions and to construct terminal sets for guaranteeing recursive feasibility. These approaches use a prestabilizing feedback controller to ensure closed-loop stability.…”
Section: Introductionmentioning
confidence: 99%
“…The occurrence of probabilistic constraints mainly arises from two reasons: one is that random uncertainty may have infinitely support such that constraints will be impossible to be obeyed with a probability of 100%, and the other is that probabilistic constraints can lead to considerably better performance when the corresponding deterministic constraints are over conservative. There are several interesting progresses on the research of the theory of SMPC recently (Cannon et al 2011;Oldewurtel et al 2013;Calafiore and Fagiano 2013;Kouvaritakis et al 2010;Cannon et al 2012), which readers can refer to.…”
Section: Introduction Of Smpcmentioning
confidence: 99%