2000 character limit reached
Convergence analysis of a family of robust Kalman filters based on the contraction principle
Published 15 May 2017 in math.OC | (1705.05286v1)
Abstract: In this paper we analyze the convergence of a family of robust Kalman filters. For each filter of this family the model uncertainty is tuned according to the so called tolerance parameter. Assuming that the corresponding state-space model is reachable and observable, we show that the corresponding Riccati-like mapping is strictly contractive provided that the tolerance is sufficiently small, accordingly the filter converges.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.