TY - GEN
T1 - Distributed Cross-Entropy δ-GLMB Filter for Multi-Sensor Multi-Target Tracking
AU - Saucan, Augustin Alexandru
AU - Varshney, Pramod K.
N1 - Publisher Copyright:
© 2018 ISIF
PY - 2018/9/5
Y1 - 2018/9/5
N2 - The multi-dimensional assignment problem, and by extension the problem of finding the T-best (i.e., the T most likely) multi-sensor assignments, represent the main challenges of centralized and especially distributed multi-sensor tracking. In this paper, we propose a distributed multi-target tracking filter based on the δ-Generalized Labeled Multi-Bernoulli (6-GLMB) family of labeled random finite set densities. Consensus is reached for high-scoring multi-sensor assignments jointly across the network by employing the cross-entropy method in conjunction with average consensus. This ensures that multi-sensor information is jointly used to select high-scoring multi-assignments without exchanging the measurements across the network and without exploring all possible single-target multi-assignments. In contrast, tracking algorithms that rely on posterior fusion, i.e., merging local posteriors of neighboring nodes until convergence, are suboptimal due to the use of only local information to select the T-best local assignments in the construction of local posteriors. Numerical simulations showcase this performance improvement of the proposed method with respect to a posterior-fusion δ- GLMB filter.
AB - The multi-dimensional assignment problem, and by extension the problem of finding the T-best (i.e., the T most likely) multi-sensor assignments, represent the main challenges of centralized and especially distributed multi-sensor tracking. In this paper, we propose a distributed multi-target tracking filter based on the δ-Generalized Labeled Multi-Bernoulli (6-GLMB) family of labeled random finite set densities. Consensus is reached for high-scoring multi-sensor assignments jointly across the network by employing the cross-entropy method in conjunction with average consensus. This ensures that multi-sensor information is jointly used to select high-scoring multi-assignments without exchanging the measurements across the network and without exploring all possible single-target multi-assignments. In contrast, tracking algorithms that rely on posterior fusion, i.e., merging local posteriors of neighboring nodes until convergence, are suboptimal due to the use of only local information to select the T-best local assignments in the construction of local posteriors. Numerical simulations showcase this performance improvement of the proposed method with respect to a posterior-fusion δ- GLMB filter.
KW - GLMB filter
KW - average consensus
KW - cross entropy
KW - distributed tracking
KW - random finite sets
UR - http://www.scopus.com/inward/record.url?scp=85054058168&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85054058168&partnerID=8YFLogxK
U2 - 10.23919/ICIF.2018.8455604
DO - 10.23919/ICIF.2018.8455604
M3 - Conference contribution
AN - SCOPUS:85054058168
SN - 9780996452762
T3 - 2018 21st International Conference on Information Fusion, FUSION 2018
SP - 1559
EP - 1566
BT - 2018 21st International Conference on Information Fusion, FUSION 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 21st International Conference on Information Fusion, FUSION 2018
Y2 - 10 July 2018 through 13 July 2018
ER -