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

Networked H∞ filtering for linear discrete-time systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
26
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6
2
1

Relationship

3
6

Authors

Journals

citations
Cited by 52 publications
(26 citation statements)
references
References 30 publications
0
26
0
Order By: Relevance
“…Similarly to that in Zhai, Hu, Yasuda, and Michel (2002) and Song, Yu, and Zhang (2011), we sum (24) from k ¼ k 0 þ 1 to k ¼ 1 and change the order of summation yielding…”
Section: Resultsmentioning
confidence: 99%
“…Similarly to that in Zhai, Hu, Yasuda, and Michel (2002) and Song, Yu, and Zhang (2011), we sum (24) from k ¼ k 0 þ 1 to k ¼ 1 and change the order of summation yielding…”
Section: Resultsmentioning
confidence: 99%
“…Consider a linear continuous-time system described by (1) as follows The disturbance attenuation level is set as γ = 0.5. By solving the linear-matrix inequality (25), the desired filter parameters under different sensor failure rates can be designed as shown in Table 1.…”
Section: Illustrative Examplementioning
confidence: 99%
“…The difference between these two estimation structures is that the sensors in a centralised scheme are connected to a fusion centre (FC) and act like transfers, while the sensors in a distributed scheme can communicate with the neighbours and act like local FCs. To deal with the multiple measurements from the deployed sensors, many centralised and distributed filtering algorithms have been proposed by concerning the packet dropouts [1][2][3][4], stochastic sampled-data [5], sensor saturations [6,7], sensor failures [8][9][10] and stochastic non-linearities [4,11].…”
Section: Introductionmentioning
confidence: 99%
“…In real networked systems however, one may not obtain a good estimation performance by using the deterministic sampling scheme due to the random network congestion [13]. In this scenario, one may resort to the stochastic sampling scheme, which can help to improve the estimation performance.…”
Section: Introductionmentioning
confidence: 99%