Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication

被引:348
作者
Kar, Soummya [1 ]
Moura, Jose M. F. [1 ]
Ramanan, Kavita [2 ]
机构
[1] Carnegie Mellon Univ, Dept Elect & Comp Engn, Pittsburgh, PA 15213 USA
[2] Brown Univ, Div Appl Math, Providence, RI 02912 USA
基金
美国国家科学基金会;
关键词
Asymptotic normality; consensus; consensus plus innovations; consistency; distributed parameter estimation; Laplacian; separable; estimable; spectral graph theory; stochastic approximation; unbiasedness; CONSENSUS ALGORITHMS; KALMAN-FILTER; QUANTIZATION; OPTIMIZATION; CONVERGENCE; TOPOLOGY; DITHER; AGENTS; LINKS;
D O I
10.1109/TIT.2012.2191450
中图分类号
TP [自动化技术、计算机技术];
学科分类号
080201 [机械制造及其自动化];
摘要
The paper studies distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and noisy intersensor communication. It introduces separably estimable observation models that generalize the observability condition in linear centralized estimation to nonlinear distributed estimation. It studies two distributed estimation algorithms in separably estimable models, the NU (with its linear counterpart LU) and the NLU. Their update rule combines a consensus step (where each sensor updates the state by weight averaging it with its neighbors' states) and an innovation step (where each sensor processes its local current observation). This makes the three algorithms of the consensus + innovations type, very different from traditional consensus. This paper proves consistency (all sensors reach consensus almost surely and converge to the true parameter value), efficiency, and asymptotic unbiasedness. For LU and NU, it proves asymptotic normality and provides convergence rate guarantees. The three algorithms are characterized by appropriately chosen decaying weight sequences. Algorithms LU and NU are analyzed in the framework of stochastic approximation theory; algorithm NLU exhibits mixed time-scale behavior and biased perturbations, and its analysis requires a different approach that is developed in this paper.
引用
收藏
页码:3575 / 3605
页数:31
相关论文
共 59 条
[1]
[Anonymous], 1999, SYSTEM IDENTIFICATIO
[2]
[Anonymous], 2000, Dynamics and Control of Large Electric Power Systems
[3]
[Anonymous], 2013, Modern graph theory
[4]
Distributed average consensus using probabilistic quantization [J].
Aysal, Tuncer C. ;
Coates, Mark ;
Rabbat, Michael .
2007 IEEE/SP 14TH WORKSHOP ON STATISTICAL SIGNAL PROCESSING, VOLS 1 AND 2, 2007, :640-644
[5]
Distributed Detection via Gaussian Running Consensus: Large Deviations Asymptotic Analysis [J].
Bajovic, Dragana ;
Jakovetic, Dusan ;
Xavier, Joao ;
Sinopoli, Bruno ;
Moura, Jose M. F. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2011, 59 (09) :4381-4396
[6]
Bertsekas D., 1984, CONVERGENCE THEORIES
[7]
Borkar VS., 2009, Stochastic Approximation: A Dynamical Systems Viewpoint
[8]
Randomized gossip algorithms [J].
Boyd, Stephen ;
Ghosh, Arpita ;
Prabhakar, Balaji ;
Shah, Devavrat .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2508-2530
[9]
Distributed Kalman filtering based on consensus strategies [J].
Carli, Ruggero ;
Chiuso, Alessandro ;
Schenato, Luca ;
Zampieri, Sandro .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2008, 26 (04) :622-633
[10]
Chen H. F., 1991, Identification and stochastic adaptive control