2011
DOI: 10.1016/j.automatica.2011.09.015
|View full text |Cite
|
Sign up to set email alerts
|

Mean square stability for Kalman filtering with Markovian packet losses

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
169
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 211 publications
(171 citation statements)
references
References 23 publications
2
169
0
Order By: Relevance
“…It can be seen from [1,24] that among the topics on optimal estimation and control for the system with packet loss, there are some closely related fundamental issues: the stability of the estimator [25,26], the distribution and convergence of the estimation error covariance [27,28], the estimation performance evaluation [29,30], and the stability of the closed-loop system [14,31]. These four issues have been fully investigated for TCP-like systems, but they are seldom studied for SS-UDP systems.…”
Section: A Background and Motivationsmentioning
confidence: 99%
See 3 more Smart Citations
“…It can be seen from [1,24] that among the topics on optimal estimation and control for the system with packet loss, there are some closely related fundamental issues: the stability of the estimator [25,26], the distribution and convergence of the estimation error covariance [27,28], the estimation performance evaluation [29,30], and the stability of the closed-loop system [14,31]. These four issues have been fully investigated for TCP-like systems, but they are seldom studied for SS-UDP systems.…”
Section: A Background and Motivationsmentioning
confidence: 99%
“…Its stability was studied in the pioneering work [25] where it is pointed out that there exists a critical value which determines the boundedness of the expected estimation error covariance (EEC), i.e., E[P k ]. Following [25], various aspects have been further researched, including the bound for the critical value [32], the distribution for EEC [27,28], the Markov packet losses case [26,[33][34][35]. In [29,30], the authors pointed out that P({P k ≤ M }) is a better evaluation for the estimation performance than the quantity E[P k ], and then obtained the lower and upper bounds for P({P k ≤ M }).…”
Section: B Related Work and Contributionsmentioning
confidence: 99%
See 2 more Smart Citations
“…Stability analysis of Kalman filter for networked systems with random packet losses has been provided in, to name just a few, [77][78][79][80][81]. It is shown in [77] that there exists a critical value of observation arrival probability under which the expected error covariance is likely to grow unbounded.…”
Section: Treatments Of Network-induced Phenomenamentioning
confidence: 99%