In this paper we consider the distributed consensus-based filtering problem for linear time-invariant systems over sensor networks subject to random link failures when the failure sequence is not known at the receiving side. We assume that the information exchanged, traveling along the channel, is corrupted by a noise and hence, it is no more possible to discriminate with certainty if a link failure has occurred. Therefore, in order to process the only significant information, we endow each sensor with detectors which decide on the presence of link failures. At each sensor the proposed approach consists of three steps: failure detection, local data aggregation and Kalman consensus filtering. Numerical examples show the effectiveness of this method.
The paper concerns the Linear Quadratic non-Gaussian (LQnG) sub-optimal control problem when the input signal travels through an unreliable network, namely a Gilbert-Elliot channel. In particular, the control input packet losses are modeled by a two-state Markov chain with known transition probability matrix, and we assume that the moments of the non-Gaussian noise sequences up to the fourth order are known. By mean of a suitable rewriting of the system through an output injection term, and by considering an augmented system with the second-order Kronecker power of the measurements, a simple solution is provided by substituting the Kalman predictor of the LQG control law with a quadratic optimal predictor. Numerical simulations show the effective ness of the proposed method.
17 March 2023 in IEEE Transactions on Control of Network Systems
In this paper we study the leader following consensus problem for linear multi-agent systems and a class of nonlinear ones with bounded disturbances and non-uniform and arbitrarily large communication delays on both directed and undirected graphs. In the linear case we solve for the first time the leader-following consensus problems in presence of arbitrarily large, non-uniform and time-varying communications delay on generic connected graphs. The approach is fully distributed and it is based on a suitable weighting modification of the network links and on an output feedback chain of predictors.