Scalable Distributed Filtering for a Class of Discrete-Time Complex Networks Over Time-Varying Topology

Optimized Distributed Filtering for Saturated Systems With Amplify-and-Forward Relays Over Sensor Networks: A Dynamic Event-Triggered Approach

In this article, the optimized distributed filtering problem is studied for a class of saturated systems with amplify-and-forward (AF) relays via a dynamic event-triggered mechanism (DETM). The AF relays are located in the channels between sensors and filters to prolong the transmission distance of signals, where the transmission powers of sensors and relays can be described by a sequence of random variables with a known probability distribution. With the purpose of alleviating the communication burden and preventing data collision, the DETM is used to schedule the transmission cases of nodes by dynamically adjusting the triggered threshold according to the practical requirements. An upper bound matrix (UBM) of the filtering error (FE) covariance is first provided under the sense of variance constraint and the proper filter gain is further constructed via minimizing the proposed UBM. In addition, the boundedness evaluation regarding the trace of the UBM is provided. Finally, simulation experiments are used to illustrate the usefulness of the developed distributed recursive filtering scheme.

A refined adaptive event-based resilient filtering for complex networks over switching topology

The problem of the resilient filtering for a class of discrete-time complex networks over switching topology is investigated. Taking into account the limitation of channel bandwidth, a refined adaptive event-triggered scheme is derived, whose threshold is determined by the change rate of measurement. The large change rate of measurement results in a smaller threshold, which means that more data packets will be transmitted to guarantee the performance of filtering, and the smaller one leads to a bigger threshold to save the network energy. Under the adaptive event-triggered scheme, considering the switching topology and uncertain inner coupling, a resilient filtering with a variable filtering gain is proposed. Additionally, the minimal upper bound of the covariance of estimation error is developed and the sufficient conditions are also given to obtain the exponentially bounded in mean square of the estimation error system. Finally, a simulation is presented to certify the effectiveness of the derived resilient filtering.

Distributed Extended State Estimation for Complex Networks With Nonlinear Uncertainty

This article studies the distributed state estimation issue for complex networks with nonlinear uncertainty. The extended state approach is used to deal with the nonlinear uncertainty. The distributed state predictor is designed based on the extended state system model, and the distributed state estimator is designed by using the measurement of the corresponding node. The prediction error and the estimation error are derived. The prediction error covariance (PEC) is obtained in terms of the recursive Riccati equation, and the upper bound of the PEC is minimized by designing an optimal estimator gain. With the vectorization approach, a sufficient condition concerning stability of the upper bound is developed. Finally, a numerical example is presented to illustrate the effectiveness of the designed extended state estimator.

Quantized recursive filtering for networked systems with stochastic transmission delays

This paper investigates the recursive filtering problem for a class of networked systems subject to the uniform quantization effects and stochastic transmission delays. The system output is quantized according to a uniform quantization mechanism, and then sent to the remote filter via a communication network undergoing stochastic transmission delays (which are modeled by a sequence of independent and identically distributed variables). To deal with the stochastic transmission delays, an indicator function is delicately designed to ensure that the filtering process is implemented based on the quantized measurement with the newest timestamp available for the filter. With the aid of the indicator function, a free-delay system is obtained by using the augmented system method. The aim of this paper is to design a Kalman-type filter for the augmented system such that an upper bound of the filtering error covariance is guaranteed and minimized. With the aid of the stochastic analysis method, the desired upper bound of the filtering error covariance is derived by recursively solving two Riccati-like difference equations. Then, the upper bound is minimized by properly selecting the filter parameters. Finally, a numerical example is provided to illustrate the validity of the developed filtering scheme.

An Event-Triggering Approach to Recursive Filtering for Complex Networks With State Saturations and Random Coupling Strengths

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.