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

Unreachable Setpoints in Model Predictive Control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
104
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 145 publications
(107 citation statements)
references
References 12 publications
0
104
0
Order By: Relevance
“…Remark 1: From [14], we know that the steerable set X N is convex and that 0 ∈ X N . We also denote by u * (x) the optimal solution to (2) with initial conditionx and σ(H) the smallest eigenvalue to H.…”
Section: Algorithm 1: Accelerated Gradient Algorithmmentioning
confidence: 99%
“…Remark 1: From [14], we know that the steerable set X N is convex and that 0 ∈ X N . We also denote by u * (x) the optimal solution to (2) with initial conditionx and σ(H) the smallest eigenvalue to H.…”
Section: Algorithm 1: Accelerated Gradient Algorithmmentioning
confidence: 99%
“…The use of unreachable setpoints is analyzed in [7] for linear MPC, and conditions for stability and convergence are established. Moreover, [7] compares MPC using unreachable setpoints to a standard two-layer structure with a target-tracking cost function in two examples, and considerable cost improvements are achieved under certain disturbance scenarios.…”
Section: Unreachable Setpointsmentioning
confidence: 99%
“…Moreover, [7] compares MPC using unreachable setpoints to a standard two-layer structure with a target-tracking cost function in two examples, and considerable cost improvements are achieved under certain disturbance scenarios.…”
Section: Unreachable Setpointsmentioning
confidence: 99%
See 2 more Smart Citations