On Bayesian fixed-interval smoothing algorithms

Boujemaa Ait El Fquih*, François Desbouvries

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

In this note, we revisit fixed-interval Kalman like smoothing algorithms. We have two results. We first unify the family of existing algorithms by deriving them in a common Bayesian framework; as we shall see, all these algorithms stem from forward and/or backward Markovian properties of the state process, involve one (or two) out of four canonical probability density functions, and can be derived from the systematic use of some generic properties of Gaussian variables which we develop in a specific toolbox. On the other hand the methodology we use enables us to complete the set of existing algorithms by five new Kalman like smoothing algorithms, which is our second result.

Original languageEnglish (US)
Pages (from-to)2437-2442
Number of pages6
JournalIEEE Transactions on Automatic Control
Volume53
Issue number10
DOIs
StatePublished - Nov 27 2008

Keywords

  • Fixed-interval Kalman smoothing algorithms
  • Hidden Markov chains (HMC)

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'On Bayesian fixed-interval smoothing algorithms'. Together they form a unique fingerprint.

Cite this