An Event-Triggering Approach to Recursive Filtering for Complex Networks With State Saturations and Random Coupling
Abstract:
In this article, the recursive filtering problem is investigated for a class of time-varying complex networks with state saturations and random coupling strengths under an event-triggering transmission mechanism. The coupled strengths among nodes are characterized by a set of random variables obeying the uniform distribution. The event-triggering scheme is employed to mitigate the network data transmission burden. The purpose of the problem addressed is to design a recursive filter such that in the presence of the state saturations, event-triggering communication mechanism, and random coupling strengths, certain locally optimized upper bound is guaranteed on the filtering error covariance. By using the stochastic analysis technique, an upper bound on the filtering error covariance is first derived via the solution to a set of matrix difference equations. Next, the obtained upper bound is minimized by properly parameterizing the filter parameters. Subsequently, the boundedness issue of the filtering error covariance is studied. Finally, two numerical simulation examples are provided to illustrate the effectiveness of the proposed algorithm.
Related Concept Videos
State Space Representation
Consider an RLC circuit, a...
State Space to Transfer Function
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:
Transfer Function to State Space
In an RLC...
Censoring Survival Data
Network Function of a Circuit
Parallel RLC Circuits
A simplified parallel RLC circuit model with a DC input source generating a step response is employed in this context. When the switch is turned on, Kirchhoff's current law is applied, leading to a second-order differential equation.

