Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Riemannian Trust-Region based Adaptive Kalman filter with unknown noise Covariance matrices (2104.12035v1)

Published 24 Apr 2021 in eess.SY, cs.SY, and math.DS

Abstract: The problem of adaptive Kalman filtering for a discrete observable linear time-varying system with unknown noise covariance matrices is addressed in this paper. The measurement difference autocovariance method is used to formulate a linear least squares cost function containing the measurements and the process and measurement noise covariance matrices. Subsequently, a Riemannian trust-region optimization approach is designed to minimize the least squares cost function and ensure symmetry and positive definiteness for the estimates of the noise covariance matrices. The noise covariance matrix estimates, under sufficient excitation of the system, are shown to converge to their unknown true values. Saliently, the exponential stability and convergence guarantees for the proposed adaptive Kalman filter to the optimal Kalman filter with known noise covariance matrices is shown to be achieved under the relatively mild assumptions of uniform observability and uniform controllability. Numerical simulations on a linear time-varying system demonstrate the effectiveness of the proposed adaptive filtering algorithm.

Citations (2)

Summary

We haven't generated a summary for this paper yet.