Distributed \(H_{\infty}\) sampled-data filtering over sensor networks with Markovian switching topologies (Q1718894)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Distributed H_ sampled-data filtering over sensor networks with Markovian switching topologies |
scientific article; zbMATH DE number 7016971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distributed \(H_{\infty}\) sampled-data filtering over sensor networks with Markovian switching topologies |
scientific article; zbMATH DE number 7016971 |
Statements
Distributed \(H_{\infty}\) sampled-data filtering over sensor networks with Markovian switching topologies (English)
0 references
8 February 2019
0 references
Summary: This paper considers a distributed \(H_{\infty}\) sampled-data filtering problem in sensor networks with stochastically switching topologies. It is assumed that the topology switching is triggered by a Markov chain. The output measurement at each sensor is first sampled and then transmitted to the corresponding filters via a communication network. Considering the effect of a transmission delay, a distributed filter structure for each sensor is given based on the sampled data from itself and its neighbor sensor nodes. As a consequence, the distributed \(H_{\infty}\) sampled-data filtering in sensor networks under Markovian switching topologies is transformed into \(H_{\infty}\) mean-square stability problem of a Markovian jump error system with an interval time-varying delay. By using Lyapunov Krasovskii functional and reciprocally convex approach, a new bounded real lemma (BRL) is derived, which guarantees the mean-square stability of the error system with a desired \(H_{\infty}\) performance. Based on this BRL, the topology-dependent \(H_{\infty}\) sampled-data filters are obtained. An illustrative example is given to demonstrate the effectiveness of the proposed method.
0 references
0 references
0 references
0 references
0 references
0 references
0.9116302132606506
0 references
0.8734292387962341
0 references
0.8459653854370117
0 references
0.8433039784431458
0 references