2016 IEEE 55th Conference on Decision and Control (CDC) 2016
DOI: 10.1109/cdc.2016.7798968
|View full text |Cite
|
Sign up to set email alerts
|

Machine learning meets Kalman Filtering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 32 publications
(24 citation statements)
references
References 11 publications
0
24
0
Order By: Relevance
“…The Kalman filter (KF) was proposed as a novel approach for the state estimation of dynamic linear state system in [ 21 ], and it has been widely implemented in various applications [ 22 29 ].…”
Section: Methodsmentioning
confidence: 99%
“…The Kalman filter (KF) was proposed as a novel approach for the state estimation of dynamic linear state system in [ 21 ], and it has been widely implemented in various applications [ 22 29 ].…”
Section: Methodsmentioning
confidence: 99%
“…GPs have been widely used in the literature for modelling spatial and spatiotemporal processes, as well as for learning models of dynamical systems. A periodic sampling approach on a discretized grid over the environment is proposed in [8], in which the authors explore links between GPs and Kalman filters. Instead of sampling on a fixed grid, [9] proposes a sequential sampling approach for an agent navigating in the environment.…”
Section: Related Workmentioning
confidence: 99%
“…In this section, we briefly review the procedure for converting stationary GPs to state-space models. For a more detailed treatment, the reader is referred to [6][7][8].…”
Section: Conversion Of Gaussian Processesmentioning
confidence: 99%
“…However, it has recently been shown that stationary, temporal and spatiotemporal GPs can be transformed into equivalent (infinite dimensional) linear state-space systems by decomposing the GP's spectral density. This can subsequently be used together with Kalman filtering and Rauch-Tung-Striebel smoothing [6][7][8], which greatly alleviates the computational burden.…”
Section: Introductionmentioning
confidence: 99%