2013
DOI: 10.1016/j.automatica.2013.01.010
|View full text |Cite
|
Sign up to set email alerts
|

Synthesis of dynamic output feedback RMPC with saturated inputs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
116
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 91 publications
(117 citation statements)
references
References 12 publications
1
116
0
Order By: Relevance
“…Remark It is worth noting that the term trueB˜FtrueC˜ in involves a product between the uncertain matrices trueB˜ and trueC˜. Therefore, in order to account for all possible convex combinations of the vertices of the original model, the LMI conditions in the proposed OFRMPC formulation will be imposed on all combinations of trueB˜i and trueC˜j, with i = 1, 2, …, n v and j =1,2,…, n v , as in .…”
Section: Preliminaries and Problem Statementmentioning
confidence: 99%
“…Remark It is worth noting that the term trueB˜FtrueC˜ in involves a product between the uncertain matrices trueB˜ and trueC˜. Therefore, in order to account for all possible convex combinations of the vertices of the original model, the LMI conditions in the proposed OFRMPC formulation will be imposed on all combinations of trueB˜i and trueC˜j, with i = 1, 2, …, n v and j =1,2,…, n v , as in .…”
Section: Preliminaries and Problem Statementmentioning
confidence: 99%
“…The actuator saturation is an essential issue in the control community, thus has been focused on in recent years, e.g. Li, Xi, and Gao (2013) and Huang et al (2013). Packet loss is another hot topic lately due to the potential source of instability and poor performance in networks in control systems.…”
Section: Problem Formulationmentioning
confidence: 99%
“…is polytopic, then one can refer to [2], [11] when x(k) is measurable, and to [14], [16] when x(k) is unmeasurable and w(k) ≡ 0. In comparison, this paper and [5], [7], [3], [4] consider a general form of (1), where x(k) can be unmeasurable, [A|B|C|D|E](k) is polytopic, and w(k) is persistent unknown norm-bounded.…”
Section: Problem Statementmentioning
confidence: 99%
“…We simulate three methods: Mthd2 and Mthd3, by applying (19) and (25), respectively, where η rs 's are optimized according to Algorithm 1; Mthd1, which is similar to Mthd2 but η 1s = η 3s = 1 2 and η 2s = 1 3 (see Remark 2). In the absence of state constraint |x(k + 1)| ≤ 0.5, Mthd1 is referred to as in [3] (except that in [3], α lj = α, and the invariance condition (14) and the optimality condition (15) have been combined -these are not the intrinsic differences). Choose {N 0 , d, d 0 , κ} = {200, 0, 0, 0.98} (see [3]: N 0 is the maximum allowable amount of iterations in the cone complementarity approach; d and d 0 are the complexity index and the maximum complexity index, respectively; κ is the accuracy for minimizing γ).…”
Section: Illustrative Examplementioning
confidence: 99%