A Partial-Node-Based Approach to State Estimation for Complex Networks With Sensor Saturations Under Random Access Protocol
Nan Hou, Hongli Dong, Zidong Wang, Hongjian Liu
Abstract
In this article, the robust finite-horizon state estimation problem is investigated for a class of time-varying complex networks (CNs) under the random access protocol (RAP) through available measurements from only a part of network nodes. The underlying CNs are subject to randomly occurring uncertainties, randomly occurring multiple delays, as well as sensor saturations. Several sequences of random variables are employed to characterize the random occurrences of parameter uncertainties and multiple delays. The RAP is adopted to orchestrate the data transmission at each time step based on a Markov chain. The aim of the addressed problem is to design a series of robust state estimators that make use of the available measurements from partial network nodes to estimate the network states, under the RAP and over a finite horizon, such that the estimation error dynamics achieves the prescribed <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$H_{\infty }$ </tex-math></inline-formula> performance requirement. Sufficient conditions are provided for the existence of such time-varying partial-node-based <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$H_{\infty }$ </tex-math></inline-formula> state estimators via stochastic analysis and matrix operations. The desired estimators are parameterized by solving certain recursive linear matrix inequalities. The effectiveness of the proposed state estimation algorithm is demonstrated via a simulation example.