Event-triggered distributed H<inf>∞</inf> filtering for networked systems with switching topologies

This paper deals with the event-triggered distributed H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> filtering for a class of networked systems with sensor networks. The topology of the sensor network is supposed to be time-varying. Whether or not a sampled data packet of a sensor node should be transmitted to its neighbors is determined by a predefined event-triggering condition, which closely depends on the variation of the sensor network topology. By modelling the filtering error system as a switched linear system with time-varying delays, a bounded real lemma (BRL) is derived using Lyapunov-Krasovskii functional approach. Based on the BRL, a sufficient condition on the existence of desired H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> filters is obtained in terms of linear matrix inequalities. An algorithm to the design of both filter parameters and event-triggering parameters is given. It is shown through a numerical example that the proposed method can not only save significantly precious communication resources, and maintain some certain system performance as well.