返回
A computationally efficient distributed Bayesian filter with random finite set observations
DOI:10.1016/j.sigpro.2022.108454.png)
摘要
En 中文
This paper presents a distributed Bayesian filter for tracking a target in the presence of random missed detections and false alarms using a sensor network, in which the Bayesian recursion as well as our pro-posed multi-sensor posterior fusion is carried out via Gaussian mixture (GM). For better communica-tion and computation efficiencies, only properly selected Gaussian components in the GMs are dissem-inated and fused between neighbor sensors in which the components are selected following the prin-ciple of principal component analysis. Linear/arithmetic average fusion is realized for which thresholds used in GM merging and pruning operations are theoretically derived by the Occam's window method. Furthermore, an improved distributed flooding protocol is devised for GM communication over the net-work which enables parallelization of internode communication and fusion operations and reduces the node-memory cost. It is demonstrated that under reasonable assumptions, it yields the same result as the original flooding algorithm while having lower node-memory requirements. Our proposed approach is compared with the state-of-the-art approach in both simulation and experiment scenarios for target tracking.(c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Distributed tracking
Random finite set
Average fusion
Principal component analysis
Distributed flooding
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
Effects of the model PAH phenanthrene on immune function and oxidative stress in the haemolymph of the temperate scallop Pecten maximus
Chemosphere
IF0
A distributed particle-PHD filter using arithmetic-average fusion of Gaussian mixture parameters
INFORMATION FUSION
IF15.5
Economic benefit evaluation method for the micro-grid renewable energy system operation微网可再生能源系统运行经济效益评价方法

