State‐saturated resilient filtering for nonlinear complex networks under event‐triggering protocol
This article is concerned with the resilient state‐saturated filtering issue for nonlinear complex networks via the event‐triggering protocol. The nonlinear inner coupling is taken into account, thereby better reflecting the nature of the complex networks. A set of Bernoulli‐distributed sequences ar...
Saved in:
Published in | Asian journal of control Vol. 25; no. 2; pp. 1216 - 1231 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
Hoboken
Wiley Subscription Services, Inc
01.03.2023
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This article is concerned with the resilient state‐saturated filtering issue for nonlinear complex networks via the event‐triggering protocol. The nonlinear inner coupling is taken into account, thereby better reflecting the nature of the complex networks. A set of Bernoulli‐distributed sequences are introduced to model the randomly occurring nonlinearities with a given probability. The signum function is utilized to characterize the state saturation owing to the physical limits on the system. For the purpose of energy saving, an event‐triggering protocol is adopted to govern the regulation of the transmission. The objective of this article is to develop an event‐triggering resilient filtering for nonlinear complex networks subject to state saturations as well as randomly occurring nonlinearities. By using matrix analysis techniques, we first guarantee the upper bound on the filtering error covariance by means of recursions and subsequently minimize such an upper bound by looking for the proper gain matrix relying on the solutions to two difference equations. Moreover, the performance evaluation of the designed filtering scheme is conducted by analyzing the boundedness of the estimation error in the mean square sense. Finally, an experimental example is exploited to validate the usefulness of the state‐saturated resilient filtering algorithm. |
---|---|
Bibliography: | Funding information This work was supported in part by the Key Science and Technology Foundation of Nantong under Grant MS22021034, the Starting Fund for Introduction of High‐level Talents of Nantong University under Grant 135422633005, and the Basic Science Research Program of NanTong City under Grant JC2020142. ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 1561-8625 1934-6093 |
DOI: | 10.1002/asjc.2906 |