Robust Kalman Filtering: Asymptotic Analysis of the Least Favorable Model
classification
🧮 math.OC
keywords
modelfavorableleastrobustballfilteringrecursiontolerance
read the original abstract
We consider a robust filtering problem where the robust filter is designed according to the least favorable model belonging to a ball about the nominal model. In this approach, the ball radius specifies the modeling error tolerance and the least favorable model is computed by performing a Riccati-like backward recursion. We show that this recursion converges provided that the tolerance is sufficiently small.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.