Loading…

Filtering for discrete-time hidden Markov jump systems

In this paper, we consider the filtering problem for a discrete-time Markov jump linear systemin which the Markov parameter is not available. In the spirit of active fault-tolerant control systems, it is supposed that there is a discrete-time hidden Markov model in which the observable part represen...

Full description

Saved in:
Bibliographic Details
Published in:International journal of control 2017-03, Vol.90 (3), p.599-615
Main Authors: de Oliveira, A. M., Costa, O. L. V.
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we consider the filtering problem for a discrete-time Markov jump linear systemin which the Markov parameter is not available. In the spirit of active fault-tolerant control systems, it is supposed that there is a discrete-time hidden Markov model in which the observable part represents the information coming from a detector and available to the filter while the hidden part θ(k) of the process represents the dynamics of the real system. Several models found in the literature are encompassed by this framework, like the complete observation case, the clustering information case, the mode-independent case, and Markov models in fault-tolerant control. We start by analysing an auxiliary filtering problem in which it is assumed that both are available to the filter, so that necessary and sufficient conditions in terms of LMI (linear matrix inequalities) for the existence of the optimal filter can be obtained. In the sequel, we consider the realistic case in which only is available for the design of the filter. A sufficient condition based on an LMI optimisation problem to design a guaranteed cost filter that depends only on is presented. The results are strengthened for two particular cases, named the cluster case and the Bernoulli case. The paper is concluded with some numerical examples to illustrate the obtained results.
ISSN:0020-7179
1366-5820
DOI:10.1080/00207179.2016.1186844