2013 Conference on Control and Fault-Tolerant Systems (SysTol) 2013
DOI: 10.1109/systol.2013.6693826
|View full text |Cite
|
Sign up to set email alerts
|

Regions of guaranteed cost for LMI-based robust model predictive controllers for systems with uncertain input delay

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(6 citation statements)
references
References 22 publications
0
6
0
Order By: Relevance
“…where ( ) ∈ R denotes the plant state at time , Φ ∈ R × , Γ ∈ R × are known matrices, and ∈ N is an uncertain delay, which may take values in the range [0, ]. For simplicity, the formulation presented herein is derived for a single-input system (i.e., = 1), as in [28]. However, the extension to the multiple-input case does not pose substantial difficulties, involving mostly changes in notation [35].…”
Section: Handling Of Uncertain Input Delaysmentioning
confidence: 99%
See 3 more Smart Citations
“…where ( ) ∈ R denotes the plant state at time , Φ ∈ R × , Γ ∈ R × are known matrices, and ∈ N is an uncertain delay, which may take values in the range [0, ]. For simplicity, the formulation presented herein is derived for a single-input system (i.e., = 1), as in [28]. However, the extension to the multiple-input case does not pose substantial difficulties, involving mostly changes in notation [35].…”
Section: Handling Of Uncertain Input Delaysmentioning
confidence: 99%
“…Remark 2. This polytopic description of the input delay uncertainty was adopted in [26][27][28] as a direct extension of the original RMPC formulation of [12]. This approach can also be employed if the delay is lower-bounded by a known value > 0, in which case the vertices of the uncertainty polytope Ω corresponding to Λ 0 , Λ 1 , .…”
Section: Handling Of Uncertain Input Delaysmentioning
confidence: 99%
See 2 more Smart Citations
“…GCCs are obtained by either Linear Matrix Inequalities (LMI) [19] or Algebraic Riccati Equations (ARE) [26] and the concept was extended to polytopic-bounded l2-norm RM-PCs problems based on LMIs [21], [23]. However, a semidefinite programming (SDP) problem must be solved for the guaranteed cost constrained optimization, which increases computational requirements in comparison to LPs, QPs and QCQPs.…”
Section: Introductionmentioning
confidence: 99%