Abstract-We analyze the performance of an approximate distributed Kalman filter proposed in recent work on distributed coordination. This approach to distributed estimation is novel in that it admits a systematic analysis of its performance as various network quantities such as connection density, topology, and bandwidth are varied. Our main contribution is a frequency-domain characterization of the distributed estimator's steady-state performance; this is quantified in terms of a special matrix associated with the connection topology called the graph Laplacian, and also the rate of message exchange between immediate neighbors in the communication network.
Spanos et al. introduced a systematic analysis of DKF's performance as various network quantities such as connection density, topology, and bandwidth are varied REF .
Approximate distributed Kalman filtering in sensor networks with quantifiable performance
IPSN '05
Computer Science