Gain-scheduled state estimation for discrete-time complex networks under bit-rate constraints

• Published in: Neurocomputing (Amsterdam) Vol. 488; pp. 120 - 129
• Main Authors: Wang, Licheng, Zhao, Di, Zhang, Yuhan, Ding, Derui, Yi, Xiaojian
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.06.2022
• Subjects: Bit-rate constraints; Complex networks; Gain-scheduled state estimation; Randomly occurring nonlinearities; Randomly occurring nonlinearities; Gain-scheduled state estimation; Bit-rate constraints; Complex networks
• ISSN: 0925-2312; 1872-8286
• DOI: 10.1016/j.neucom.2022.03.002

In this paper, the gain-scheduled state estimation issue is investigated for a kind of complex networks subject to randomly occurring nonlinearities under bit-rate constraints. An array of random variables is introduced to govern the nonlinearities whose occurring probability is a time-varying but bounded value with known upper and lower bounds. A bit-rate constraint model is established and an encoding–decoding mechanism is proposed, under which an upper bound of the decoding error is acquired. The primary purpose of the issue considered in this paper is to design a gain-scheduled state estimator to obtain an estimate of the network state with an acceptable accuracy according to available output measurements. By means of the stochastic analysis and Lyapunov stability theory, a sufficient condition is provided such that the estimation error dynamics achieve the exponentially mean-square ultimate boundedness. The required estimator gain matrix is parameterized by solving a series of matrix inequalities. A numerical simulation is exploited to show the usefulness of the obtained gain-scheduled state estimator.