Online Bayesian Estimation of Transition Probabilities for Markovian Jump Systems
- 18 May 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 52 (6) , 1620-1630
- https://doi.org/10.1109/tsp.2004.827145
Abstract
Markovian jump systems (MJSs) evolve in a jump-wise manner by switching among simpler models, according to a finite Markov chain, whose parameters are commonly assumed known. This paper addresses the problem of state estimation of MJS with unknown transition probability matrix (TPM) of the embedded Markov chain governing the jumps. Under the assumption of a time-invariant but random TPM, an approximate recursion for the TPMs posterior probability density function (PDF) within the Bayesian framework is obtained. Based on this recursion, four algorithms for online minimum mean-square error (MMSE) estimation of the TPM are derived. The first algorithm (for the case of a two-state Markov chain) computes the MMSE estimate exactly, if the likelihood of the TPM is linear in the transition probabilities. Its computational load is, however, increasing with the data length. To limit the computational cost, three alternative algorithms are further developed based on different approximation techniques-truncation of high order moments, quasi-Bayesian approximation, and numerical integration, respectively. The proposed TPM estimation is naturally incorporable into a typical online Bayesian estimation scheme for MJS [e.g., generalized pseudo-Bayesian (GPB) or interacting multiple model (IMM)]. Thus, adaptive versions of MJS state estimators with unknown TPM are provided. Simulation results of TPM-adaptive IMM algorithms for a system with failures and maneuvering target tracking are presented.Keywords
This publication has 29 references indexed in Scilit:
- On adaptive decision rules and decision parameter adaptation for automatic speech recognitionProceedings of the IEEE, 2000
- A dynamic Bayesian network approach to figure tracking using learned dynamic modelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- On-line adaptive learning of the continuous density hidden Markov model based on approximate recursive Bayes estimateIEEE Transactions on Speech and Audio Processing, 1997
- Bayesian adaptive learning of the parameters of hidden Markov model for speech recognitionIEEE Transactions on Speech and Audio Processing, 1995
- Maximum a posteriori estimation for multivariate Gaussian mixture observations of Markov chainsIEEE Transactions on Speech and Audio Processing, 1994
- Estimation of mixing probabilities in multiclass finite mixturesIEEE Transactions on Systems, Man, and Cybernetics, 1990
- Optimal simultaneous detection and estimation of filtered discrete semi-Markov chainsIEEE Transactions on Information Theory, 1988
- Adaptive estimation and identification for discrete systems with Markov jump parametersIEEE Transactions on Automatic Control, 1982
- Adaptive estimation in linear systems with unknown Markovian noise statisticsIEEE Transactions on Information Theory, 1980
- State estimation under uncertain observations with unknown statisticsIEEE Transactions on Automatic Control, 1979