<i>l</i>₂–<i>l</i>∞ State Estimation for Persistent Dwell-Time Switched Coupled Networks Subject to Round-Robin Protocol
Hao Shen, Mengping Xing, Zheng‐Guang Wu, Jinde Cao, Tingwen Huang
Abstract
This article is concerned with the issue of l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> - l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> state estimation for nonlinear coupled networks, where the variation of coupling mode is governed by a set of switching signals satisfying a persistent dwell-time property. To solve the problem of data collisions in a constrained communication network, the round-robin protocol, as an important scheduling strategy for orchestrating the transmission order of sensor nodes, is introduced. Redundant channels with signal quantization are used to improve the reliability of data transmission. The main purpose is to determine an estimator that can guarantee the exponential stability in mean square sense and an l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> - l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> performance level of the estimation error system. Based on the Lyapunov method, sufficient conditions for the addressed problem are established. The desired estimator gains can be obtained by addressing a convex optimization case. The correctness and availability of the developed approach are finally explained via two illustrative examples.