2014
DOI: 10.1007/s11071-014-1479-x
|View full text |Cite
|
Sign up to set email alerts
|

$$\mathcal {H}_{\infty }$$ H ∞ filtering for sample data systems with stochastic sampling and Markovian jumping parameters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(4 citation statements)
references
References 41 publications
0
4
0
Order By: Relevance
“…More precisely, to solve the sampled‐data H ∞ control problem, the sampled‐data system is modeled as a continuous‐time one with an input delay , which the sampling period is assumed to be time varying but bounded delays. In recent years, the H ∞ sampled‐data control problem with system models expressed by dynamical systems has become a popular research topic and has gained extensive attentions . Also, to reduce the conservativeness, some of the researchers have used the free weighting matrix approach for the control design problems and it plays an important role in deriving delay‐dependent stabilization condition .…”
Section: Introductionmentioning
confidence: 99%
“…More precisely, to solve the sampled‐data H ∞ control problem, the sampled‐data system is modeled as a continuous‐time one with an input delay , which the sampling period is assumed to be time varying but bounded delays. In recent years, the H ∞ sampled‐data control problem with system models expressed by dynamical systems has become a popular research topic and has gained extensive attentions . Also, to reduce the conservativeness, some of the researchers have used the free weighting matrix approach for the control design problems and it plays an important role in deriving delay‐dependent stabilization condition .…”
Section: Introductionmentioning
confidence: 99%
“…Furthermore, based on the relations false((σ1σ1(t))/σ1(t))=1+false(1/σ1(t)) and false(σ1(t)/(σ1σ1(t)))=1+false(1/((σ1σ1(t))), it can be considered as one of the reciprocally convex combination in [27, 33], which can be effectively treated as the simple variation of lower bound lemma. Inspired by the work [27, 33], without any conservative approximation, we can find the upper bound of (28) by using (12) and lower bound lemma 3, where right left right left right left right left right left right left0.278em 2em 0.278em 2em 0.278em 2em 0.278em 2em 0.278em 2em 0.278em3pt][σ1false(tfalse)false(σ1σ1false(tfalse)false)tσ1tσ1false(tfalse)x˙false(sfalse)thinmathspacedsfalse(σ1σ1false(tfalse)false)σ1false(tfalse)tσ1false(tfalse)tx˙false(sfalse)thinmathspacedsnormalTcenter center1em4ptσ<...>…”
Section: Resultsmentioning
confidence: 99%
“…For wireless transmission networks, with the increasing of the amount of data transmitted, packet dropouts and time delays are inevitable in the case of limited communication channel capacity [22]- [24]. How to study networked control systems has become an important problem [25]- [28].…”
Section: Introductionmentioning
confidence: 99%