D-MAP: Distributed Maximum a Posteriori Probability Estimation of Dynamic Systems

被引:61
作者
Jakubiec, Felicia Y. [1 ]
Ribeiro, Alejandro [1 ]
机构
[1] Univ Penn, Dept Elect & Syst Engn, Philadelphia, PA 19104 USA
基金
美国国家科学基金会;
关键词
Distributed estimation; wireless sensor networks; WIRELESS SENSOR NETWORKS; AVERAGE CONSENSUS; NOISY LINKS; HOC WSNS; PART I; ALGORITHMS; COST;
D O I
10.1109/TSP.2012.2222398
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper develops a framework for the estimation of a time-varying random signal using a distributed sensor network. Given a continuous time model sensors collect noisy observations and produce local estimates according to the discrete time equivalent system defined by the sampling period of observations. Estimation is performed using a maximum a posteriori probability estimator (MAP) within a given window of interest. To mediate the incorporation of information from other sensors we introduce Lagrange multipliers to penalize the disagreement between neighboring estimates. We show that the resulting distributed (D)-MAP algorithm is able to track dynamical signals with a small error. This error is characterized in terms of problem constants and vanishes with the sampling time as long as the log-likelihood function which is assumed to be log-concave satisfies a smoothness condition. We implement the D-MAP algorithm for a linear and a nonlinear system model to show that the performance corroborates with theoretical findings.
引用
收藏
页码:450 / 466
页数:17
相关论文
共 31 条
[1]  
[Anonymous], 2001, EXERCISES PROBABILIT
[2]   Distributed average consensus with dithered quantization [J].
Aysal, Tuncer Can ;
Coates, Mark J. ;
Rabbat, Michael G. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (10) :4905-4918
[3]   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
[4]  
Boyd S., 2004, Convex Programming
[5]   Randomized gossip algorithms [J].
Boyd, Stephen ;
Ghosh, Arpita ;
Prabhakar, Balaji ;
Shah, Devavrat .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2508-2530
[6]   Asymptotic Optimality of Running Consensus in Testing Binary Hypotheses [J].
Braca, Paolo ;
Marano, Stefano ;
Matta, Vincenzo ;
Willett, Peter .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (02) :814-825
[7]   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
[8]   Diffusion Strategies for Distributed Kalman Filtering and Smoothing [J].
Cattivelli, Federico S. ;
Sayed, Ali H. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2010, 55 (09) :2069-2084
[9]   Gossip Algorithms for Distributed Signal Processing [J].
Dimakis, Alexandros G. ;
Kar, Soummya ;
Moura, Jose M. F. ;
Rabbat, Michael G. ;
Scaglione, Anna .
PROCEEDINGS OF THE IEEE, 2010, 98 (11) :1847-1864
[10]   Coordination of groups of mobile autonomous agents using nearest neighbor rules [J].
Jadbabaie, A ;
Lin, J ;
Morse, AS .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2003, 48 (06) :988-1001