Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Adaptive Kalman Filtering Developed from Recursive Least Squares Forgetting Algorithms (2404.10914v1)

Published 16 Apr 2024 in eess.SY, cs.SY, and eess.SP

Abstract: Recursive least squares (RLS) is derived as the recursive minimizer of the least-squares cost function. Moreover, it is well known that RLS is a special case of the Kalman filter. This work presents the Kalman filter least squares (KFLS) cost function, whose recursive minimizer gives the Kalman filter. KFLS is an extension of generalized forgetting recursive least squares (GF-RLS), a general framework which contains various extensions of RLS from the literature as special cases. This then implies that extensions of RLS are also special cases of the Kalman filter. Motivated by this connection, we propose an algorithm that combines extensions of RLS with the Kalman filter, resulting in a new class of adaptive Kalman filters. A numerical example shows that one such adaptive Kalman filter provides improved state estimation for a mass-spring-damper with intermittent, unmodeled collisions. This example suggests that such adaptive Kalman filtering may provide potential benefits for systems with non-classical disturbances.

PDF HTML Abstract
Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Bookmark Chat Bubble Oval Streamline Icon: https://streamlinehq.com Chat (Pro)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (18)
  1. H. W. Sorenson, “Least-squares estimation: from gauss to kalman,” IEEE Spectrum, vol. 7, no. 7, pp. 63–68, 1970.
  2. S. Islam and D. Bernstein, “Recursive least squares for real-time implementation,” IEEE Ctrl. Sys. Mag., vol. 39, no. 3, p. 82, 2019.
  3. A. L. Bruce, A. Goel, and D. S. Bernstein, “Convergence and consistency of recursive least squares with variable-rate forgetting,” Automatica, vol. 119, p. 109052, 2020.
  4. L. Cao and H. Schwartz, “A directional forgetting algorithm based on the decomposition of the information matrix,” Automatica, vol. 36, no. 11, pp. 1725–1731, 2000.
  5. R. Kulhavỳ and M. Kárnỳ, “Tracking of slowly varying parameters by directional forgetting,” IFAC Proceedings Volumes, vol. 17, no. 2, pp. 687–692, 1984.
  6. S. Bittanti, P. Bolzern, and M. Campi, “Convergence and exponential convergence of identification algorithms with directional forgetting factor,” Automatica, vol. 26, no. 5, pp. 929–932, 1990.
  7. M. E. Salgado, G. C. Goodwin, and R. H. Middleton, “Modified least squares algorithm incorporating exponential resetting and forgetting,” International Journal of Control, vol. 47, no. 2, pp. 477–491, 1988.
  8. B. Lai and D. S. Bernstein, “Exponential resetting and cyclic resetting recursive least squares,” IEEE Ctrl. Sys. Lets., vol. 7, pp. 985–990, 2023.
  9. A. Vahidi et al., “Recursive least squares with forgetting for online estimation of vehicle mass and road grade: theory and experiments,” Vehicle Sys. Dynms., vol. 43, no. 1, pp. 31–55, 2005.
  10. C. Paleologu, J. Benesty, and S. Ciochina, “A robust variable forgetting factor recursive least-squares algorithm for system identification,” IEEE Signal Processing Letters, vol. 15, pp. 597–600, 2008.
  11. R. M. Johnstone, C. R. Johnson Jr, R. R. Bitmead, and B. D. Anderson, “Exponential convergence of recursive least squares with exponential forgetting factor,” Sys. & Ctrl. Letters, vol. 2, no. 2, pp. 77–82, 1982.
  12. S. Dasgupta and Y.-F. Huang, “Asymptotically convergent modified recursive least-squares with data-dependent updating and forgetting factor for systems with bounded noise,” IEEE Transactions on Information Theory, vol. 33, no. 3, pp. 383–392, 1987.
  13. J. Humpherys and J. West, “Kalman filtering with newton’s method,” IEEE Control Systems Magazine, vol. 30, no. 6, pp. 101–106, 2010.
  14. J. Humpherys, P. Redd, and J. West, “A fresh look at the kalman filter,” SIAM review, vol. 54, no. 4, pp. 801–823, 2012.
  15. B. Lai and D. S. Bernstein, “Generalized forgetting recursive least squares: Stability and robustness guarantees,” 2023.
  16. R. E. Kalman, “A new approach to linear filtering and prediction problems,” Transactions of the ASME–Journal of Basic Engineering, vol. 82, no. Series D, pp. 35–45, 1960.
  17. A. Goel, A. L. Bruce, and D. S. Bernstein, “Recursive least squares with variable-direction forgetting: Compensating for the loss of persistency,” IEEE Ctrl. Sys. Mag., vol. 40, no. 4, pp. 80–102, 2020.
  18. G. Goodwin, E. Teoh, and H. Elliott, “Deterministic convergence of a self-tuning regulator with covariance resetting,” in IEE Proceedings D-Control Theory and Applications, vol. 1, no. 130, 1983, pp. 6–8.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Brian Lai (11 papers)
  2. Dennis S. Bernstein (37 papers)
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets