返回
Sensor Selection for Decentralized Large-Scale Multi-Target Tracking Network
DOI:10.3390/s18124115.png)
摘要
En 中文
A new optimization algorithm of sensor selection is proposed in this paper for decentralized large-scale multi-target tracking (MTT) network within a labeled random finite set (RFS) framework. The method is performed based on a marginalized delta-generalized labeled multi-Bernoulli RFS. The rule of weighted Kullback-Leibler average (KLA) is used to fuse local multi-target densities. A new metric, named as the label assignment (LA) metric, is proposed to measure the distance for two labeled sets. The lower bound of LA metric based mean square error between the labeled multi-target state set and its estimate is taken as the optimized objective function of sensor selection. The proposed bound is obtained by the information inequality to RFS measurement. Then, we present the sequential Monte Carlo and Gaussian mixture implementations for the bound. Another advantage of the bound is that it provides a basis for setting the weights of KLA. The coordinate descent method is proposed to compromise the computational cost of sensor selection and the accuracy of MTT. Simulations verify the effectiveness of our method under different signal-to-noise ratio scenarios.
Keyword:
sensor selection
multi-target tracking
labeled random finite set
decentralized sensor network
error bound
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
Effects of the model PAH phenanthrene on immune function and oxidative stress in the haemolymph of the temperate scallop Pecten maximus
Chemosphere
IF0
The Cramer-Rao Bounds and Sensor Selection for Nonlinear Systems with Uncertain Observations
SENSORS
IF3.5

