Answers are grounded in this paper and cite their sources.
The issue of finite-time <tex-math notation="LaTeX">H∞ </tex-math> state estimation is studied for a class of discrete-time nonlinear two-time-scale complex networks (TTSCNs) whose measurement outputs are transmitted to a remote estimator via a bandwidth-limited communication network under the stochastic communication protocol (SCP). To reflect different time scales of state evolutions, a new discrete-time TTSCN model is devised by introducing a singular perturbation parameter (SPP). For the sake of avoiding/alleviating the undesirable data collisions, the SCP is adopted to schedule the data transmissions, where the transition probabilities involved are assumed to be partially unknown. By constructing a new Lyapunov function dependent on the information of the SCP and SPP, a sufficient condition is derived which ensures that the resulting error dynamics is stochastically finite-time bounded and satisfies a prescribed <tex-math notation="LaTeX">H∞ </tex-math> performance index. By resorting to the solutions of several matrix inequalities, the gain matrices of the state estimator are given and the admissible upper bound of the SPP can be evaluated simultaneously. The performance of the designed state estimator is demonstrated by two examples.
No takes yet. Share an insight, caveat, or question.
Wan et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: