By Topic

An \ell _{1} -Laplace Robust Kalman Smoother

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Aravkin, A.Y. ; Dept. of Earth & Ocean Sci., Univ. of British Columbia, Vancouver, BC, Canada ; Bell, B.M. ; Burke, J.V. ; Pillonetto, G.

Robustness is a major problem in Kalman filtering and smoothing that can be solved using heavy tailed distributions; e.g., ℓ1-Laplace. This paper describes an algorithm for finding the maximum a posteriori (MAP) estimate of the Kalman smoother for a nonlinear model with Gaussian process noise and ℓ1 -Laplace observation noise. The algorithm uses the convex composite extension of the Gauss-Newton method. This yields convex programming subproblems to which an interior point path-following method is applied. The number of arithmetic operations required by the algorithm grows linearly with the number of time points because the algorithm preserves the underlying block tridiagonal structure of the Kalman smoother problem. Excellent fits are obtained with and without outliers, even though the outliers are simulated from distributions that are not ℓ1 -Laplace. It is also tested on actual data with a nonlinear measurement model for an underwater tracking experiment. The ℓ1-Laplace smoother is able to construct a smoothed fit, without data removal, from data with very large outliers.

Published in:

Automatic Control, IEEE Transactions on  (Volume:56 ,  Issue: 12 )