Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 220

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Kalman Filtering Over a Packet-Dropping Network: A Probabilistic Perspective

Shi, Ling, Epstein, Michael, Murray, Richard M. · 2010 · IEEE Transactions on Automatic Control

Abstract

We consider the problem of state estimation of a discrete time process over a packet-dropping network. Previous work on Kalman filtering with intermittent observations is concerned with the asymptotic behavior of E[Pk], i.e., the expected value of the error covariance, for a given packet arrival rate. We consider a different performance metric,Pr[Pk¿M], i.e., the probability thatPkis bounded by a givenM. We consider two scenarios in the paper. In the first scenario, when the sensor sends its measurement data to the remote estimator via a packet-dropping network, we derive lower and upper bounds onPr[Pk¿M]. In the second scenario, when the sensor preprocesses the measurement data and sends its local state estimate to the estimator, we show that the previously derived lower and upper bounds are equal to each other, hence we are able to provide a closed form expression forPr[Pk¿M]. We also recover the results in the literature when usingPr[Pk¿M] as a metric for scalar systems. Examples are provided to illustrate the theory developed in the paper.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tac.2009.2039236

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

See all 220

Metadata

Authors
Shi, L., Epstein, M., & Murray, R. M.
Venue
IEEE Transactions on Automatic Control
Published
2010-03
Volume
55
Issue
3
Pages
594-604
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W2146554256
Cited by
220
References
2
FWCI
28.15
Type
journal article
Language
en
Open access
closed

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: Kalman Filtering Over a Packet-Dropping Network: A Probabilistic Perspective. https://app.cochat.ai/papers/10.1109/tac.2009.2039236
The paper
Shi, L., Epstein, M., & Murray, R. M. (2010). Kalman Filtering Over a Packet-Dropping Network: A Probabilistic Perspective. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2009.2039236

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.