Distributed CPHD Filtering Under Robust Set-Theoretic Information Flooding Mechanism

This correspondence studies the distributed multi-target tracking (DMTT) problem. A cardinality probability hypothesis density (CPHD) filter under robust set-theoretic information flooding (RSIF) mechanism is proposed to perform targeted communication to reduce the communication burden, and increase the robustness. In particular, the collecting set is locally designed to represent known local estimation of each neighbor node, and when receiving the data packet, each node selects the unknown local estimations for storage and updates its local collecting set. Then, in each iteration, the local node selectively sends its neighboring nodes the local estimations that they do not know. When the node knows the local estimations of all the nodes, the information fusion will be performed and the received information will no longer be processed. Finally, the tracking performance of the proposed algorithm is verified by comparison studies.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Aerospace and Electronic Systems
Published
2025-08-11
DOI
https://doi.org/10.1109/taes.2025.3596578
Citations
1
Primary Topic
Anomaly Detection Techniques and Applications
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed CPHD Filtering Under Robust Set-Theoretic Information Flooding Mechanism

Guchong Li, Huiping Li, Lingchao Bu
1 citations
IEEE Transactions on Aerospace and Electronic Systems
Anomaly Detection Techniques and Applications
2.48
article

Distributed CPHD Filtering Under Robust Set-Theoretic Information Flooding Mechanism

Guchong Li, Huiping Li, Lingchao Bu
article en
1 citations

Abstract

This correspondence studies the distributed multi-target tracking (DMTT) problem. A cardinality probability hypothesis density (CPHD) filter under robust set-theoretic information flooding (RSIF) mechanism is proposed to perform targeted communication to reduce the communication burden, and increase the robustness. In particular, the collecting set is locally designed to represent known local estimation of each neighbor node, and when receiving the data packet, each node selects the unknown local estimations for storage and updates its local collecting set. Then, in each iteration, the local node selectively sends its neighboring nodes the local estimations that they do not know. When the node knows the local estimations of all the nodes, the information fusion will be performed and the received information will no longer be processed. Finally, the tracking performance of the proposed algorithm is verified by comparison studies.

IEEE Transactions on Aerospace and Electronic SystemsVol. 61(6)
Northwestern Polytechnical University (CN)
Climate action
Openalex Percentile: Top 9%
Anomaly Detection Techniques and Applications
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.