Stability of Kalman filtering with Markovian packet losses
By Minyi Huang, Subhrakanti Dey. at - Automatisierungstechnik, 2007
441 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Control and Systems Engineering
View Paper: https://www.semanticscholar.org/paper/162174dc206fd90b711d8f0f698e2e982bf04844
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Control and Systems Engineering
Citations in the corpus
- Kalman Filtering Over a Packet-Dropping Network: A Probabilistic Perspective (2010, background): “Huang and Dey [14] considered Kalman filtering over a packet-dropping network where data packet drops are described by a two-state Markov chain.”
- Optimal Denial-of-Service Attack Scheduling With Energy Constraint Over Packet-Dropping Networks (2018, methodology): “) Bernoulli process [22]–[24] or a time-homogeneous binary Markov process [25], [26].”
- A survey on Markovian jump systems: Modeling and design (2015, methodology): “One framework for the analysis and design of NCSs with packet losses is the offline framework, where the controller is designed despite any situation of real packet losses[109-111].”
- Stochastic consensus over noisy networks with Markovian and arbitrary switches (2010, unknown): “(3) Similar loss models have been studied in distributed filtering problems; see, e.g., Huang and Dey (2007), Sinopoli et al. (2004) and Smith and Seiler (2003).”