1970/04/01 by R. Mehra, R.К. Mehra · 1,389 citations
Computer Science · Decision Sciences · Mathematics · #Algorithm #Artificial intelligence #Computer science #Distributed Sensor Networks and Detection Algorithms #Kalman filter #Mathematics #Scientific Measurement and Uncertainty Evaluation #Target Tracking and Data Fusion in Sensor Networks
paper · doi:10.1109/tac.1970.1099422
published in IEEE Transactions on Automatic Control 15(2), 175-184 (Institute of Electrical and Electronics Engineers)
openalex publication_date 1970/04/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04
A Kalman filter requires an exact knowledge of the process noise covariance matrixQand the measurement noise covariance matrixR. Here we consider the case in which the true values ofQandRare unknown. The system is assumed to be constant, and the random inputs are stationary. First, a correlation test is given which checks whether a particular Kalman filter is working optimally or not. If the filter is suboptimal, a technique is given to obtain asymptotically normal, unbiased, and consistent estimates ofQandR. This technique works only for the case in which the form ofQis known and the number of unknown elements inQis less thann × rwherenis the dimension of the state vector andris the dimension of the measurement vector. For other cases, the optimal steady-state gain Kopis obtained directly by an iterative procedure without identifyingQ. As a corollary, it is shown that the steady-state optimal Kalman filter gain Kopdepends only onn × rlinear functionals ofQ. The results are first derived for discrete systems. They are then extended to continuous systems. A numerical example is given to show the usefulness of the approach.