Posterior Linearization Filter: Principles and Implementation Using Sigma Points
MetadataShow full item record
Funding and Sponsorship
This paper is concerned with Gaussian approximations to the posterior probability density function (PDF) in the update step of Bayesian filtering with nonlinear measurements. In this setting, sigma-point approximations to the Kalman filter (KF) recursion are widely used due to their ease of implementation and relatively good performance. In the update step, these sigma-point KFs are equivalent to linearizing the nonlinear measurement function by statistical linear regression (SLR) with respect to the prior PDF. In this paper, we argue that the measurement function should be linearized using SLR with respect to the posterior rather than the prior to take into account the information provided by the measurement. The resulting filter is referred to as the posterior linearization filter (PLF). In practice, the exact PLF update is intractable but can be approximated by the iterated PLF (IPLF), which carries out iterated SLRs with respect to the best available approximation to the posterior. The IPLF can be seen as an approximate recursive Kullback-Leibler divergence minimization procedure. We demonstrate the high performance of the IPLF in relation to other Gaussian filters in two numerical examples.
Showing items related by title, author, creator and subject.
Garcia Fernandez, Angel; Svensson, L.; Morelande, M. (2014)© 2014 International Society of Information Fusion.This paper deals with Gaussian approximations to the posterior probability density function (PDF) in Bayesian nonlinear filtering. In this setting, using sigma-point based ...
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 ...