Search

In this paper, a distributed filter is designed for time-varying systems corrupted by dynamic bias and packet disorders over sensor networks, where the plant under consideration includes stochastic bias which is governed by a dynamical equation. Moreover, the transmission delays are present in all sensor-to-filter communication channels, and such delays are described by using random variables that have known probability distributions. We focus on constructing a distributed yet recursive filter under the corruption of dynamic bias plus packet disorders. By means of the inductive method, upper bounds (on attained error covariances of the distributed filter) are first given and later minimized by properly parameterizing filter gains. Subsequently, a sufficient condition is presented to rigorously ensure the mean-square boundedness with respect to attained filtering errors. Finally, an example is given for effectiveness validation. This work was supported by National Natural Science Foundation of China under Grants 61933007, 62103359, 62173292 and 12071409, the Natural Science Foundation of Universities in Jiangsu Province of China under Grant 21KJB120011, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany.

This paper investigates the recursive state estimation problem for a class of discrete-time stochastic complex networks with packet disorders under Round-Robin (RR) communication protocols. The phenomenon of packet disorders results from the random transmission delays during the signal propagation process due to the unpredictable fluctuations of the network load, and such random delays are modeled by a set of random variables satisfying certain known probability distributions. For the sake of lessening the communication burden and abating the data collisions, the RR protocol is introduced to govern the order of the nodes for data transmission. Under the scheduling of the RR protocol, only one node is allowed to gain the access to the network at each time instant. Then, a recursive estimator is devised to guarantee an upper bound for the estimation error covariance, and then the obtained upper bound is locally minimized by adequately choosing the estimator parameters. Furthermore, the boundedness of estimation error is analyzed in the sense of mean square with the help of stochastic analysis techniques. At last, a simulation example is presented to show the applicability of the proposed estimator design scheme. 10.13039/501100004054-King Abdulaziz University (Grant Number: RG-19-611-42); 10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61773017, 61873148, 61873230 and 61933007); Royal Society of the U.K.; Alexander Von Humboldt Foundation of Germany

In this paper, the recursive filtering problem is put forward for stochastic parameter systems subject to quantization effects and packet disorders. Before entering communication networks, measurement outputs are quantized by logarithmic quantizers. The packet disorders result from transmission delays which are provoked by communication constraints and occur randomly in the sensor-to-filter channel. In case of measurement quantizations and packet disorders, the objective of this paper is to devise a novel recursive filter approach that is capable of 1) guaranteeing desired upper bounds on the resultant filtering error covariances; and 2) minimizing such upper bounds by acquiring appropriate filter gains. Furthermore, sufficient conditions are established to ensure the mean-square boundedness of filtering errors by means of stochastic analysis techniques. At last, simulations are given to validate the applicability of our designed approach.