Distributed state estimation under state inequality constraints with random communication over multi-agent networks

Abstract

In this paper, we investigate distributed state estimation for multi-agent networks with random communication, where the state is constrained by an inequality. In order to deal with the problem of environmental/communication uncertainties and to save energy, we introduce two random schemes, including a random sleep scheme and an event-triggered scheme. With the help of Kalman-consensus filter and projection on the constrained set, we propose two random distributed estimation algorithm. The estimation of each agent is achieved by projecting the consensus estimate, which is obtained by virtue of random exchange information with its neighbors. The estimation error is shown to be bounded with probability one when the agents randomly take the measurement or communicate with their neighbors. We show the stability of proposed algorithm based on Lyapunov method and projection and demonstrate their effectiveness via numerical simulations.