arrow
返回

Generalized Kalman smoothing: Modeling and algorithms

delete2017-12-01
delete85
delete
OA
AI
A
Aleksandr Y. Aravkin *
J
James V. Burke
L
Lennart Ljung
A
Aurélie Lozano
G
Gianluigi Pillonetto
DOI:10.1016/j.automatica.2017.08.011delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
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 obtained using quadratic penalties can fail when outliers are present in the data, and cannot track impulsive inputs and abrupt state changes. Motivated by these shortcomings, generalized Kalman smoothing formulations have been proposed in the last few years, replacing quadratic models with more suitable, often nonsmooth, convex functions. In contrast to classical models, these general estimators require use of iterated algorithms, and these have received increased attention from control, signal processing, machine learning, and optimization communities. In this survey we show that the optimization viewpoint provides the control and signal processing community great freedom in the development of novel modeling and inference frameworks for dynamical systems. We discuss general statistical models for dynamic systems, making full use of nonsmooth convex penalties and constraints, and providing links to important models in signal processing and machine learning. We also survey optimization techniques for these formulations, paying close attention to dynamic problem structure. Modeling concepts and algorithms are illustrated with numerical examples. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
SIMULTANEOUS SPARSE APPROXIMATION
VARIABLE SELECTION
REGRESSION
ROBUST
SUM
REGULARIZATION
IDENTIFICATION
COMPUTATION
RECOVERY
MACHINE
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Automatica 封面图
Automatica
IF:
5.9
论文数:
1.2W
被引数:
5.2W

机构

L
Linkoping University
学者数:
1.6W
论文数: 1.5W
被引数: 184
U
University of Washington
学者数:
8.0W
论文数: 7.0W
被引数: 12.5W
引用论文

引用论文

err分享
err收藏
THE DESIGN OF THE iCub HUMANOID ROBOT
err2013-01-23
err0
PREAI
errALBERTO PARMIGGIANI; MARCO MAGGIALI; LORENZO NATALE; FRANCESCO NORI; ALEXANDER SCHMITZ; NIKOS TSAGARAKIS; JOSÉ SANTOS VICTOR; FRANCESCO BECCHI; GIULIO SANDINI; GIORGIO METTA
err分享
err收藏
High-dimensional graphs and variable selection with the Lasso
err2006-06-01
err2.9K
errOAAI
errMeinshausen, Nicolai; Buehlmann, Peter
err分享
err收藏
err分享
err收藏
Smoothed state estimates under abrupt changes using sum-of-norms regularization
err2012-04-01
err39
errOAAI
errOhlsson, Henrik; Gustafsson, Fredrik; Ljung, Lennart; Boyd, Stephen
err分享
err收藏
Least angle regression
err2004-04-01
err7.5K
errOAAI
errEfron, B; Hastie, T; Johnstone, I; Tibshirani, R
err分享
err收藏
err分享
err收藏
学者 查看更多内容