Abstract
This paper investigates the l2-l∞ filtering problem for a class of discrete-time system subject to network-induced delays. The objective is to design a reduced-order filter, such that the estimation errors converge to zero, while an l2-l∞ performance is satisfied. A Markov chain with partly unknown transition probabilities is used to describe the network-induced delay. Then, a delay-dependent linear filter is considered, whose parameters are described by the network-induced delay. By using Finslers lemma, sufficient conditions in terms of linear matrix inequalities (LMIs) for the existence of the desired filter are derived, which guarantee that estimation errors converge to zero with an l2-l∞ performance γ. By solving those LMIs, filter gain matrices can be calculated. Finally, numerical simulations are given to illustrate that the designed filter is successful even in the existence of network-induced delays.
| Original language | English |
|---|---|
| Pages (from-to) | 110-118 |
| Number of pages | 9 |
| Journal | Signal Processing |
| Volume | 109 |
| DOIs | |
| State | Published - Apr 2015 |
| Externally published | Yes |
Keywords
- l-l filtering Reduced-order filter Network-based systems Markov chain Linear matrix inequalities (LMIs)
Fingerprint
Dive into the research topics of 'Robust reduced-order l2-l∞ filtering for network-based discrete-time linear systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver