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

223 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination (2012, methodology): “Recently, Kalman filtering over a packetdropping network was designed through a probabilistic appr oach [47].”
Jamming Attacks on Remote State Estimation in Cyber-Physical Systems: A Game-Theoretic Approach (2015, methodology): “The estimate x̂k is calculated following a procedure similar to that adopted in [17]: once the sensor’s local estimate packet arrives, the estimator synchronizes its own estimate with the sensor’s; otherwise, the estimator just predicts xk based on its previous optimal estimate”
SINR-Based DoS Attack on Remote State Estimation: A Game-Theoretic Approach (2017, methodology): “They can be calculated based on the results in [16] and [19] via the following procedure: once the sensor’s local estimate arrives, the estimator synchronizes ˆ x k with that of the sensor, that is, with ˆ x sk ; otherwise, the remote estimator just predicts ˆ x k based on its previous estimate…”