2018
DOI: 10.1016/j.ins.2018.04.052
|View full text |Cite
|
Sign up to set email alerts
|

Robust MPC under event-triggered mechanism and Round-Robin protocol: An average dwell-time approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
35
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
5

Relationship

4
1

Authors

Journals

citations
Cited by 64 publications
(35 citation statements)
references
References 46 publications
0
35
0
Order By: Relevance
“…which guarantees (14) and (16). By virtue of Lemma 2, it follows from (29) and (30) that V * (k) (k) is exponentially stable, which completes the proof.…”
Section: Theoremmentioning
confidence: 59%
See 1 more Smart Citation
“…which guarantees (14) and (16). By virtue of Lemma 2, it follows from (29) and (30) that V * (k) (k) is exponentially stable, which completes the proof.…”
Section: Theoremmentioning
confidence: 59%
“…[23][24][25][26][27][28] In such a case, data collision and network congestion might occur during data transmission via a shared communication network. In order to avoid these unexpected network-induced phenomena, some communication protocols such as the round-robin 29 protocol, the try-once-discard (TOD) protocol, and the stochastic communication protocol, [30][31][32][33] have been increasingly introduced to orchestrate the date transmission order, where only a subset of components obtaining the privilege has an access to the shared network. Among the aforementioned protocols, the TOD protocol has received much attention because the priority of data has been accurately taken into consideration.…”
Section: Introductionmentioning
confidence: 99%
“…Proof The proof can be easily obtained by the similar lines to that in the work of Zhu et al, and it is thus omitted.…”
Section: Resultsmentioning
confidence: 89%
“…In line with the work of Zhu et al, the event‐triggered mechanism that contributes to the event‐triggering instant sequence 0k1<k2<<kτ< can be given by kτ+1=inf{}kfalse|k>kτ,false‖efalse(kfalse)false‖2>ρfalse(kfalse)trueρ^, where k τ and k τ +1 denote the adjacent two event‐triggering instants. ρfalse(kfalse)εγk+ε0 is a time‐varying threshold with known scalars ε >1, 0γ<1, ε 0 >0, and trueρ^>0.…”
Section: Problem Formulation and Preliminariesmentioning
confidence: 74%
See 1 more Smart Citation