.png){kind=icon}
返回
Optimal linear state estimation over a packet-dropping network using linear temporal coding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2013.01.043.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of linear minimum mean square error estimation for a discrete-time system over a packet-dropping network. In order to improve the estimation performance, different from the standard approach of sending the current measurement data, we choose sending a linear combination of the current measurement and the measurement collected at the previous time, a method called linear temporal coding. We assume the packet arrival sequence is unknown and the noise contained in the packet may come from sensor or communication channel. In an effort to cope with colored noise caused by measurement combination, after comparing with the classic state augmentation approach and measurement differencing approach, we derive a recursive estimation algorithm by means of orthogonal projection principle and innovation sequence approach. Our algorithm consists of two parts: smooth and estimate. For large measurement noise case, numerical example shows the benefit of using linear temporal coding strategy, compared with directly sending the current data. On the contrary, when communication noise plays the dominating role, for scalar system we prove there is no benefit to choose this scheme. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Kalman filter
Correlated noise
Packet-dropping network
Linear temporal coding
Innovation sequence approach
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
分享收藏Scaling of Brain Metabolism with a Fixed Energy Budget per Neuron: Implications for Neuronal Activity, Plasticity and Evolution.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
分享收藏分享收藏
查看更多内容