Spanos, Demetri P. and Olfati-Saber, Reza and Murray, Richard M. (2005) Approximate distributed Kalman filtering in sensor networks with quantifiable performance. In: Fourth International Symposium on Information Processing in Sensor Networks, 2005 (IPSN 2005). IEEE , Los Alamitos, CA, pp. 133-139. ISBN 0-7803-9201-9 http://resolver.caltech.edu/CaltechAUTHORS:SPAipsn05
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:SPAipsn05
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.
|Item Type:||Book Section|
|Additional Information:||© Copyright 2005 IEEE. Reprinted with permission.|
|Subject Keywords:||approximate distributed Kalman filter; connection topology; distributed coordination; frequency-domain characterization graph Laplacian matrix; message exchange; quantifiable performance; sensor network; steady-state performance|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||03 Oct 2006|
|Last Modified:||18 Mar 2015 23:11|
Repository Staff Only: item control page