TY - JOUR
T1 - Kalman Filtering over Gilbert-Elliott Channels
T2 - Stability Conditions and Critical Curve
AU - Wu, Junfeng
AU - Shi, Guodong
AU - Anderson, Brian D.O.
AU - Johansson, Karl Henrik
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2018/4
Y1 - 2018/4
N2 - This paper investigates the stability of Kalman filtering over Gilbert-Elliott channels where random packet drops follow a time-homogeneous two-state Markov chain whose state transition is determined by a pair of failure and recovery rates. First of all, we establish a relaxed condition guaranteeing peak-covariance stability described by an inequality in terms of the spectral radius of the system matrix and transition probabilities of the Markov chain. We further show that the condition can be interpreted using a linear matrix inequality feasibility problem. Next, we prove that the peak-covariance stability implies mean-square stability, if the system matrix has no defective eigenvalues on the unit circle. This connection between the two stability notions holds for any random packet drop process. We prove that there exists a critical curve in the failure-recovery rate plane, below which the Kalman filter is mean-square stable and no longer mean-square stable above. Finally, a lower bound for this critical failure rate is obtained making use of the relationship we establish between the two stability criteria, based on an approximate relaxation of the system matrix.
AB - This paper investigates the stability of Kalman filtering over Gilbert-Elliott channels where random packet drops follow a time-homogeneous two-state Markov chain whose state transition is determined by a pair of failure and recovery rates. First of all, we establish a relaxed condition guaranteeing peak-covariance stability described by an inequality in terms of the spectral radius of the system matrix and transition probabilities of the Markov chain. We further show that the condition can be interpreted using a linear matrix inequality feasibility problem. Next, we prove that the peak-covariance stability implies mean-square stability, if the system matrix has no defective eigenvalues on the unit circle. This connection between the two stability notions holds for any random packet drop process. We prove that there exists a critical curve in the failure-recovery rate plane, below which the Kalman filter is mean-square stable and no longer mean-square stable above. Finally, a lower bound for this critical failure rate is obtained making use of the relationship we establish between the two stability criteria, based on an approximate relaxation of the system matrix.
KW - Estimation
KW - Kalman filtering
KW - Markov processes
KW - stability
KW - stochastic systems
UR - http://www.scopus.com/inward/record.url?scp=85028979818&partnerID=8YFLogxK
U2 - 10.1109/TAC.2017.2732821
DO - 10.1109/TAC.2017.2732821
M3 - Article
SN - 0018-9286
VL - 63
SP - 1003
EP - 1017
JO - IEEE Transactions on Automatic Control
JF - IEEE Transactions on Automatic Control
IS - 4
ER -