A scheme for robust distributed sensor fusion based on average consensus
- Creators
- Xiao, Lin
- Boyd, Stephen
- Lall, Sanjay
Abstract
We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a simple distributed iterative scheme, based on distributed average consensus in the network, to compute the maximum-likelihood estimate of the parameters. This scheme doesn't involve explicit point-to-point message passing or routing; instead, it diffuses information across the network by updating each node's data with a weighted average of its neighbors' data (they maintain the same data structure). At each step, every node can compute a local weighted least-squares estimate, which converges to the global maximum-likelihood solution. This scheme is robust to unreliable communication links. We show that it works in a network with dynamically changing topology, provided that the infinitely occurring communication graphs are jointly connected.
Additional Information
© 2005 IEEE. This work was partially supported by the Stanford URI Architectures for Secure and Robust Distributed Infrastructures, AFOSR DoD award number 49620-01-1-0365.Attached Files
Published - 01440896.pdf
Files
Name | Size | Download all |
---|---|---|
md5:9b5094ad8e9af7002b5dd27818780083
|
280.3 kB | Preview Download |
Additional details
- Eprint ID
- 73350
- Resolver ID
- CaltechAUTHORS:20170109-151930206
- 49620-01-1-0365
- Air Force Office of Scientific Research (AFOSR)
- Created
-
2017-01-10Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field