.png){kind=icon}
返回
Graph-Based Compression for Distributed Particle Filters
.png){kind=icon}
PRE
AI
DOI：10.1109/TSIPN.2018.2890231.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A key challenge in designing distributed particle filters is to minimize the communication overhead without compromising tracking performance. In this paper, we present two distributed particle filters that achieve robust performance with low communication overhead. The two filters construct a graph of the particles and exploit the graph Laplacian matrix in different manners to encode the particle log-likelihoods using a minimum number of coefficients. We validate their performance via simulations with very low communication overhead and provide a theoretical error bound for the presented filters.
Keyword:
Distributed target tracking
particle filters
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
734
被引数:
1.9K
机构
引用论文
分享收藏分享收藏分享收藏Carbon nanotube induced double percolation in polymer blends: Morphology, rheology and broadband dielectric properties.png)
Polymer
PolymerIF0
PREAI
分享收藏
Mechanical characterization of neural electrodes based on PDMS-parylene C-PDMS sandwiched system
PREAI
分享收藏
查看更多内容