Adaptive unscented Gaussian likelihood approximation filter
Access Status
Fulltext not available
Authors
Garcia Fernandez, Angel
Morelande, M.
Grajal, J.
Svensson, L.
Date
2015Type
Journal Article
Metadata
Show full item recordCitation
Garcia Fernandez, A. and Morelande, M. and Grajal, J. and Svensson, L. 2015. Adaptive unscented Gaussian likelihood approximation filter. Automatica. 54: pp. 166-175.
Source Title
Automatica
ISSN
School
Department of Electrical and Computer Engineering
Collection
Abstract
This paper focuses on the update step of Bayesian nonlinear filtering. We first derive the unscented Gaussian likelihood approximation filter (UGLAF), which provides a Gaussian approximation to the likelihood by applying the unscented transformation to the inverse of the measurement function. The UGLAF approximation is accurate in the cases where the unscented Kalman filter (UKF) is not and the other way round. As a result, we propose the adaptive UGLAF (AUGLAF), which selects the best approximation to the posterior (UKF or UGLAF) based on the Kullback-Leibler divergence. This enables AUGLAF to outperform both the UKF and UGLAF.
Related items
Showing items related by title, author, creator and subject.
-
Yoon, J.; Kim, Du Yong; Yoon, K. (2013)The unscented sequential Monte Carlo probability hypothesis density (USMC-PHD) filter has been proposed to improve the accuracy performance of the bootstrap SMC-PHD filter in cluttered environments. However, the USMC-PHD ...
-
Mullane, J.; Vo, Ba-Ngu; Adams, M.; Vo, B. (2011)The previous chapter provided the motivation to adopt an RFS representation for the map in both FBRM and SLAM problems. The main advantage of the RFS formulation is that the dimensions of the measurement likelihood and ...
-
Garcia Fernandez, Angel; Morelande, M.; Grajal, J. (2012)We devise a filtering algorithm to approximate the first two moments of the posterior probability density function (PDF). The novelties of the algorithm are in the update step. If the likelihood has a bounded support, we ...