# Generalized Kalman smoothing: Modeling and algorithms

@article{Aravkin2017GeneralizedKS,
title={Generalized Kalman smoothing: Modeling and algorithms},
author={Aleksandr Y. Aravkin and James V. Burke and Lennart Ljung and Aur{\'e}lie C. Lozano and Gianluigi Pillonetto},
journal={Autom.},
year={2017},
volume={86},
pages={63-86}
}
State-space smoothing has found many applications in science and engineering. Under linear and Gaussian assumptions, smoothed estimates can be obtained using efficient recursions, for example Rauch-Tung-Striebel and Mayne-Fraser algorithms. Such schemes are equivalent to linear algebraic techniques that minimize a convex quadratic objective function with structure induced by the dynamic model. These classical formulations fall short in many important circumstances. For instance, smoothers… Expand
57 Citations
Fast robust methods for singular state-space models
• Mathematics, Computer Science
• Autom.
• 2019
This work reformulates all state-space models (singular as well as nonsinguar) as constrained convex optimization problems, and develops an efficient algorithm for this reformulation, which outperforms competing approaches for nonsingular models. Expand
Iterated Extended Kalman Smoother-Based Variable Splitting for $L_1$-Regularized State Estimation
• Computer Science, Mathematics
• IEEE Transactions on Signal Processing
• 2019
This paper first formulate such problems as minimization of the sum of linear or nonlinear quadratic error terms and an extra regularizer, and then present novel algorithms which solve the linear and nonlinear cases. Expand
Autonomous Tracking and State Estimation With Generalized Group Lasso.
• Medicine, Mathematics
• IEEE transactions on cybernetics
• 2021
This work addresses the problem of autonomous tracking and state estimation for marine vessels, autonomous vehicles, and other dynamic signals under a (structured) sparsity assumption and develops a class of smoothing-and-splitting methods to solve it. Expand
FastRobustMethods for Singular State-SpaceModels
State-space models are used in a wide range of time series analysis applications. Kalman filtering and smoothing are work-horse algorithms in these settings. While classic algorithms assume GaussianExpand
Maximum Correntropy Derivative-Free Robust Kalman Filter and Smoother
• Mathematics, Computer Science
• IEEE Access
• 2018
A half-quadratic optimization method is utilized to solve the formulated robust estimation problems, which leads to a new maximum correntropy derivative-free robust Kalman filter and smoother. Expand
Augmented Sigma-Point Lagrangian Splitting Method for Sparse Nonlinear State Estimation
• Computer Science
• 2020 28th European Signal Processing Conference (EUSIPCO)
• 2021
This work forms a sparse nonlinear state estimation problem as a generalized L1 -regularized minimization problem, and develops an augmented sigma-point Lagrangian splitting method, which leads to iterated unscented, cubature, and Gauss-Hermite Kalman smoothers for computation in the primal space. Expand
Smoothing for continuous dynamical state space models with sampled system coefficients based on sparse kernel learning
• Computer Science
• 2020
The proposed method for a continuous dynamical state space model with sampled system coefficients can be viewed as an alternative smoothing method, rather than a replacement for conventional smoothers, due to the difficult model tuning and increased computation load. Expand
A unified framework for M-estimation based robust Kalman smoothing
Numerical experiments show that the proposed robust approach outperforms the traditional Kalman smoother and several robust filtering methods. Expand
Regularized State Estimation And Parameter Learning Via Augmented Lagrangian Kalman Smoother Method
• Computer Science
• 2019 IEEE 29th International Workshop on Machine Learning for Signal Processing (MLSP)
• 2019
A new augmented Lagrangian Kalman smoother method is developed for solving the problem of estimating the state and learning of the parameters in a linear dynamic system with generalized L_{1} -$regularization, where the primal variable update is reformulated asKalman smoother. Expand Robust Singular Smoothers for Tracking Using Low-Fidelity Data • Computer Science, Mathematics • Robotics: Science and Systems • 2019 This work shows how to combine singular covariance models with robust losses and state-space constraints in a unified framework that can handle very low-fidelity data, and suggests that the framework can be extended to real-time tracking using robust windowed estimation. Expand #### References SHOWING 1-10 OF 188 REFERENCES An$\ell _{1}\$-Laplace Robust Kalman Smoother
• Mathematics, Computer Science
• IEEE Transactions on Automatic Control
• 2011
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 using the convex composite extension of the Gauss-Newton method. Expand
Sparse/robust estimation and Kalman smoothing with nonsmooth log-concave densities: modeling, computation, and theory
• Computer Science, Mathematics
• J. Mach. Learn. Res.
• 2013
It is shown that the extended framework allows arbitrary PLQ densities to be used, and that the proposed IP approach solves the generalized Kalman smoothing problem while maintaining the linear complexity in the size of the time series, just as in the Gaussian case. Expand
Lasso-Kalman smoother for tracking sparse signals
• Mathematics
• 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers
• 2009
Fixed-interval smoothing of time-varying vector processes is an estimation approach with well-documented merits for tracking applications. The optimal performance in the linear Gauss-Markov model isExpand
Smoothed state estimates under abrupt changes using sum-of-norms regularization
• Mathematics, Computer Science
• Autom.
• 2012
The state smoothing problem for linear state space models is here formulated as a constrained least-squares problem with sum-of-norms regularization, a generalization of @?"1-regularization", a convex relaxation of the well known generalized likelihood ratio method by Willsky and Jones. Expand
Robust and Trend-Following Student's t Kalman Smoothers
• Mathematics, Computer Science
• SIAM J. Control. Optim.
• 2014
Highly robust smoothers are developed by modeling measurement errors using the Student's t distribution, and outperform the recently proposed L1-Laplace smoother in extreme situations with data containing 20% or more outliers. Expand
An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization
• Mathematics, Computer Science
• Autom.
• 2009
This paper presents an interior point method that maximizes the likelihood with respect to the sequence of state vectors satisfying inequality constraints and obtains the same decomposition that is normally obtained for the unconstrained Kalman-Bucy smoother. Expand
Generalized System Identification with Stable Spline Kernels
• Mathematics, Computer Science
• SIAM J. Sci. Comput.
• 2018
This paper extends linear system identification to a wide class of nonsmooth stable spline estimators, where regularization functionals and data misfits can be selected from a rich set of piecewise linear-quadratic (PLQ) penalties. Expand
Kalman filtering with state constraints: a survey of linear and nonlinear algorithms
The Kalman filter is the minimum-variance state estimator for linear dynamic systems with Gaussian noise. Even if the noise is non-Gaussian, the Kalman filter is the best linear estimator. ForExpand
Doubly Robust Smoothing of Dynamical Processes via Outlier Sparsity Constraints
• Mathematics, Computer Science
• IEEE Transactions on Signal Processing
• 2011
Novel fixed-lag and fixed-interval smoothing algorithms that are robust to outliers simultaneously present in the measurements and in the state dynamics and which rely on coordinate descent and the alternating direction method of multipliers, are developed. Expand
Kalman smoothing and block tridiagonal systems: new connections and numerical stability results
• Mathematics
• 2013
The Rauch-Tung-Striebel (RTS) and the Mayne-Fraser (MF) algorithms are two of the most popular smoothing schemes to reconstruct the state of a dynamic linear system from measurements collected on aExpand