Abstract

Knowledge of the noise distribution is typically crucial for the state estimation of general state-space models. However, properties of the noise process are often unknown in the majority of practical applications. The distribution of the noise may also be non-stationary or state dependent and that prevents the use of off-line tuning methods. For linear Gaussian models, Adaptive Kalman filters (AKF) estimate unknown parameters in the noise distributions jointly with the state. For nonlinear models, we provide a Bayesian solution for the estimation of the noise distributions in the exponential family, leading to a marginalized adaptive particle filter (MAPF) where the noise parameters are updated using finite dimensional sufficient statistics for each particle. The time evolution model for the noise parameters is defined implicitly as a Kullback–Leibler norm constraint on the time variability, leading to an exponential forgetting mechanism operating on the sufficient statistics. Many existing methods are based on the standard approach of augmenting the state with the unknown variables and attempting to solve the resulting filtering problem. The MAPF is significantly more computationally efficient than a comparable particle filter that runs on the full augmented state. Further, the MAPF can handle sensor and actuator offsets as unknown means in the noise distributions, avoiding the standard approach of augmenting the state with such offsets. We illustrate the MAPF on first a standard example, and then on a tire radius estimation problem on real data.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.