1998
DOI: 10.1109/9.704989
|View full text |Cite
|
Sign up to set email alerts
|

Min-max feedback model predictive control for constrained linear systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
480
0
2

Year Published

2006
2006
2017
2017

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 805 publications
(494 citation statements)
references
References 5 publications
2
480
0
2
Order By: Relevance
“…This is important because it allows one to efficiently compute the value of the RHC law u = µ N (x) via the minimization of a convex function over a convex set. In particular, we note that if W is a polytope as in Example 7,then (26) can be written as a convex quadratic program (QP) in a tractable number of variables and constraints. If W is an ellipsoid or the affine map of a Euclidean ball as in Example 8, then the optimization problem in (26) can be converted to a tractable SOCP [20].…”
Section: Exploiting Equivalence To Compute the Rhc Lawmentioning
confidence: 99%
See 1 more Smart Citation
“…This is important because it allows one to efficiently compute the value of the RHC law u = µ N (x) via the minimization of a convex function over a convex set. In particular, we note that if W is a polytope as in Example 7,then (26) can be written as a convex quadratic program (QP) in a tractable number of variables and constraints. If W is an ellipsoid or the affine map of a Euclidean ball as in Example 8, then the optimization problem in (26) can be converted to a tractable SOCP [20].…”
Section: Exploiting Equivalence To Compute the Rhc Lawmentioning
confidence: 99%
“…However, optimization over arbitrary (nonlinear) feedback policies is particularly difficult if constraints have to be satisfied. Current proposals for achieving this using finite dimensional optimization, such as [26], are computationally intractable since the size of the optimization problem grows exponentially with the size of the problem data.…”
Section: Introductionmentioning
confidence: 99%
“…Note that, if memberships are considered as "uncertainty" and the controller cannot depend on them, the above problem statement would be that of the so-called minimax predictive control [18,19]. Intermediate cases with partiallyknown membership components [36,Eq.…”
Section: Remarkmentioning
confidence: 99%
“…Kassmann et al [171] on-line Apply robustness constraints to steady state target calculation. Scokaert and Mayne [266] on-line min worst case quadratic, invariant set for stability. Lee and Cooley [195] on-line min worst case quadratic cost s.t.…”
Section: The Paroc Frameworkmentioning
confidence: 99%