2009 European Control Conference (ECC) 2009
DOI: 10.23919/ecc.2009.7074699
|View full text |Cite
|
Sign up to set email alerts
|

Closed-loop subspace Predictive Control for Linear Parameter Varying systems (i) - the nominal case

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 15 publications
0
6
0
Order By: Relevance
“…Now, given the current value and the future trajectory of the scheduling variable and the input of the system, the future output of G I in (5) can be computed as follows: (6). Therefore, the key prediction equation for G I with h 0 (k) ≡ 0 is given by…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…Now, given the current value and the future trajectory of the scheduling variable and the input of the system, the future output of G I in (5) can be computed as follows: (6). Therefore, the key prediction equation for G I with h 0 (k) ≡ 0 is given by…”
Section: Preliminariesmentioning
confidence: 99%
“…The use of observers to access the state information may deteriorate significantly closed-loop performance in terms of input disturbance rejection when plant input constraints become activated, as in that case, the nonlinearities start to dominate the behavior of the closed-loop system, see [5]. To cope with these issues, a subspace-based predictive control for LPV systems has been proposed in [6]. The critical issue in this approach is that no stability guarantee has been provided.…”
Section: Introductionmentioning
confidence: 98%
“…For the evaluation of performance, residual signal which is the difference between measured output and predicted one is used. Thus, residual, , is derived from (6,7,8) with inclusion of fault as follows:…”
Section: Problem Setupmentioning
confidence: 99%
“…for j = 0, 1, 2, … , N −1, whereθ(k+j) ∈ R n x ×n y is computed as in Equation 16 except its rows from (1+n y n a ) to (n u +n y n a ) are given byθ [1+n y n a ,n u +n y n a ] (k + j) = θ [1+n y n a ,n u +n y n a ] (k + j)…”
Section: The Prediction Equationmentioning
confidence: 99%
“…Moreover, the use of observers to estimate the states may also deteriorate closed‐loop performance significantly in terms of input disturbance rejection when input constraints become activated . To handle this, a subspace‐based predictive control for LPV systems has been proposed in the work of Dong et al without stability guarantee. However, the complexity of this scheme increases exponentially with the order and number of scheduling variables.…”
Section: Introductionmentioning
confidence: 99%