The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Gossip and Distributed Kalman Filtering: Weak Consensus Under Weak Detectability
Open accessAbstract
The paper presents the gossip interactive Kalman filter (GIKF) for distributed Kalman filtering for networked systems and sensor networks, where intersensor communication and observations occur at the same time-scale. The communication among sensors is random; each sensor occasionally exchanges its filtering state information with a neighbor depending on the availability of the appropriate network link. We show that under a weak distributed detectability condition: 1) the GIKF error process remains stochastically bounded, irrespective of the instability of the random process dynamics; and 2) the network achieves weak consensus, i.e., the conditional estimation error covariance at a (uniformly) randomly selected sensor converges in distribution to a unique invariant measure on the space of positive semidefinite matrices (independent of the initial state). To prove these results, we interpret the filtering states (estimates and error covariances) at each node in the GIKF as stochastic particles with local interactions. We analyze the asymptotic properties of the error process by studying as a random dynamical system the associated switched (random) Riccati equation, the switching being dictated by a nonstationary Markov chain on the network graph.
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
Learning by doing and learning from others: Human capital and technical change in agriculture
Foster, A. D., & Rosenzweig, M. R. (1995) · Journal of Political Economy · doi:10.1086/601447 · Cited by 2,038
Cited by
Kar, S., Moura, J. M. F., & Ramanan, K. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2191450 · Cited by 476
Self-citationDistributed 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
Metadata
- Authors
- Kar, S., & Moura, J. M. F.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2011-04
- Volume
- 59
- Issue
- 4
- Pages
- 1766-1784
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2158064355
- Cited by
- 167
- References
- 1
- FWCI
- 10.88
- 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: Gossip and Distributed Kalman Filtering: Weak Consensus Under Weak Detectability. https://app.cochat.ai/papers/10.1109/tsp.2010.2100385
- The paper
- Kar, S., & Moura, J. M. F. (2011). Gossip and Distributed Kalman Filtering: Weak Consensus Under Weak Detectability. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2010.2100385
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.