2012
DOI: 10.1016/j.sysconle.2012.02.004
|View full text |Cite
|
Sign up to set email alerts
|

Robust variable horizon MPC with move blocking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
19
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 44 publications
(19 citation statements)
references
References 10 publications
0
19
0
Order By: Relevance
“…For small problems, it may be possible to simply calculate the volume approximation over all possible blocking structures for a given N and r, choosing the structure giving the largest approximate ROA volume. There are however  N − 1 r − 1  possible ways of blocking an Nstep horizon into r blocks (Shekhar & Maciejowski, 2012b), which grows rapidly with N.…”
Section: Theorem 7 a Blocking Structure To Subdivide N Inputs Into Rmentioning
confidence: 99%
See 2 more Smart Citations
“…For small problems, it may be possible to simply calculate the volume approximation over all possible blocking structures for a given N and r, choosing the structure giving the largest approximate ROA volume. There are however  N − 1 r − 1  possible ways of blocking an Nstep horizon into r blocks (Shekhar & Maciejowski, 2012b), which grows rapidly with N.…”
Section: Theorem 7 a Blocking Structure To Subdivide N Inputs Into Rmentioning
confidence: 99%
“…Let a feasible solution to P ′ (N,r) be given by the tuple (P, c, Q , d,δ N ). Then, a corresponding feasible solution to P ′ (N, r) is given by the tuple (P, c, Q , d, δ N ), where δ N =δ N ∨ γ , for any γ ∈ {0, 1} N such that ∥δ N ∥ 1 = r. This is evident from the fact that a more restrictive blocking structure withr blocks can always be relaxed (Shekhar & Maciejowski, 2012b) to a less restrictive structure with r >r blocks, whilst still admitting Q and d as part of the feasible solution. In other words, reducing the number of blocks always introduces more restrictive equality constraints on (41b)-(41c).…”
Section: Theorem 7 a Blocking Structure To Subdivide N Inputs Into Rmentioning
confidence: 99%
See 1 more Smart Citation
“…The so-called Variable-Horizon model predictive control (VH-MPC) which varies the horizon length according to a constrained optimization problem is well-suited to handle time-varying disturbances. The VH-MPC algorithm drives the system state to a closed set in finite time irrespective of bounded disturbances (Michalska & Mayne, 1993;Richards & How, 2006;Scokaert & Mayne, 1998;Shekhar & Maciejowski, 2012). It is possible to reduce the complexity of the algorithm by setting the variable horizon to predefinite values according to the onset of a disturbance.…”
Section: Introductionmentioning
confidence: 99%
“…Several approaches have been developed to deal with the computational complexity problem of MPC. Shekhar and Maciejowski [15] introduced a new formulation of variable horizon MPC that utilised move blocking for reducing computational complexity. Ling et al [16] proposed a form of MPC in which the control variables were moved asynchronously.…”
Section: Introductionmentioning
confidence: 99%