This article examines the distributed filtering problem for a general class of filtering systems consisting of distributed time-delayed plant and filtering networks with semi-Markov-type topology switching (SMTTS). The SMTTS implies… Click to show full abstract
This article examines the distributed filtering problem for a general class of filtering systems consisting of distributed time-delayed plant and filtering networks with semi-Markov-type topology switching (SMTTS). The SMTTS implies the topology sojourn time can be a hybrid function of different types of probabilistic distributions, typically, binomial distribution used to model unreliable communication links between the filtering nodes and Weibull distribution employed to depict the cumulative abrasion failure. First, by properly constructing a sojourn-time-dependent Lyapunov–Krasovski function (STDLKF), both time-varying topology-dependent filter and topology-dependent filter are designed. Second, a novel nonmonotonic approach with less design conservatism is developed by relaxing the monotonic requirement of STDLKF within each topology sojourn time. Moreover, an algorithm with less computational effort is proposed to generate a semi-Markov chain from a given Markov renewal chain. Simulation examples, including a microgrid islanded system, are presented to testify the generality and elucidate the practical potential of the nonmonotonic approach.
               
Click one of the above tabs to view related content.