The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Likelihood Consensus and Its Application to Distributed Particle Filtering
Open accessAbstract
We consider distributed state estimation in a wireless sensor network without a fusion center. Each sensor performs a global estimation task-based on the past and current measurements of all sensors-using only local processing and local communications with its neighbors. In this estimation task, the joint (all-sensors) likelihood function (JLF) plays a central role as it epitomizes the measurements of all sensors. We propose a distributed method for computing, at each sensor, an approximation of the JLF by means of consensus algorithms. This “likelihood consensus” method is applicable if the local likelihood functions of the various sensors (viewed as conditional probability density functions of the local measurements) belong to the exponential family of distributions. We then use the likelihood consensus method to implement a distributed particle filter and a distributed Gaussian particle filter. Each sensor runs a local particle filter, or a local Gaussian particle filter, that computes a global state estimate. The weight update in each local (Gaussian) particle filter employs the JLF, which is obtained through the likelihood consensus scheme. For the distributed Gaussian particle filter, the number of particles can be significantly reduced by means of an additional consensus scheme. Simulation results are presented to assess the performance of the proposed distributed particle filters for a multiple target tracking problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 1×
“A powerful approach to diffusing local information through a wireless sensor network is given by iterative consensus algorithms, which require only communications with neighboring sensors and are robust to failing communication links and changing network topologies [11].”
BackgroundEstimation with Applications to Tracking and Navigation: Theory, Algorithms and Software
Bar‐Shalom, Y., Li, X. ‐., & Kirubarajan, T. (2002) · doi:10.1002/0471221279 · Cited by 6,782
Cited by
Sayed, A. H. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2306253 · Cited by 587
Adaptation, Learning, and Optimization over Networks
Sayed, A. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781601988515 · Cited by 415
Distributed Online Optimization in Dynamic Environments Using Mirror Descent
Shahrampour, S., & Jadbabaie, A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2743462 · Cited by 331
Distributed particle filtering in agent networks: A survey, classification, and comparison
Hlinka, O., Hlawatsch, F., & Djuric, P. M. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2219652 · Cited by 259
Self-citation
Metadata
- Authors
- Hlinka, O., Sluciak, O., Hlawatsch, F., Djuric, P. M., & Rupp, M.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2012-08
- Volume
- 60
- Issue
- 8
- Pages
- 4334-4349
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2127821072
- Cited by
- 218
- References
- 2
- FWCI
- 20.26
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Likelihood Consensus and Its Application to Distributed Particle Filtering. https://app.cochat.ai/papers/10.1109/tsp.2012.2196697
- The paper
- Hlinka, O., Sluciak, O., Hlawatsch, F., Djuric, P. M., & Rupp, M. (2012). Likelihood Consensus and Its Application to Distributed Particle Filtering. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2012.2196697
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.