A hidden Markov model-based algorithm for fault diagnosis with partial and imperfect tests

We present a hidden Markov model (HMM) based algorithm for fault diagnosis in systems with partial and imperfect tests. The HMM-based algorithm finds the most likely state evolution, given a sequence of uncertain test outcomes over time. We also present a method to estimate online the HMM parameters, namely, the state transition probabilities, the instantaneous probabilities of test outcomes given the system state and the initial state distribution, that are fundamental to HMM-based adaptive fault diagnosis. The efficacy of the parameter estimation method is demonstrated by comparing the diagnostic accuracies of an algorithm with complete knowledge of HMM parameters with those of an adaptive one. In addition, the advantages of using the HMM approach over a Hamming-distance based fault diagnosis technique are quantified. Tradeoffs in computational complexity versus performance of the diagnostic algorithm are also discussed.

[1]  Josef Kittler,et al.  Pattern recognition : a statistical approach , 1982 .

[2]  Paul M. Frank,et al.  Fault diagnosis in dynamic systems using analytical and knowledge-based redundancy: A survey and some new results , 1990, Autom..

[3]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[4]  Rolf Isermann,et al.  Process fault detection based on modeling and estimation methods - A survey , 1984, Autom..

[5]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[6]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[7]  Sholom M. Weiss,et al.  An Empirical Comparison of Pattern Recognition, Neural Nets, and Machine Learning Classification Methods , 1989, IJCAI.

[8]  Krishna R. Pattipati,et al.  Multi-signal flow graphs: a novel approach for system testability analysis and fault diagnosis , 1994 .

[9]  Robert S. Swarz,et al.  The theory and practice of reliable system design , 1982 .

[10]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[11]  J. Beasley,et al.  Enhancing an algorithm for set covering problems , 1992 .

[12]  W. J. Langford Statistical Methods , 1959, Nature.

[13]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[14]  J. Omura,et al.  On the Viterbi decoding algorithm , 1969, IEEE Trans. Inf. Theory.

[15]  Lain L. MacDonald,et al.  Hidden Markov and Other Models for Discrete- valued Time Series , 1997 .

[16]  Richard P. Lippmann,et al.  A Comparative Study of the Practical Characteristics of Neural Network and Conventional Pattern Classifiers , 1990, NIPS 1990.

[17]  Padhraic Smyth,et al.  Markov monitoring with unknown states , 1994, IEEE J. Sel. Areas Commun..

[18]  Sheldon M. Ross Introduction to Probability Models. , 1995 .

[19]  George C. Clark Implementation of Maximum Likelihood Decoders for Convolutional Codes , 1971 .

[20]  L. Baum,et al.  A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains , 1970 .

[21]  Sheldon M. Ross Chapter 9 – Reliability Theory , 1993 .

[22]  Simon Haykin,et al.  Neural Networks: A Comprehensive Foundation , 1998 .

[23]  L. R. Rabiner,et al.  An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition , 1983, The Bell System Technical Journal.

[24]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[25]  Mojdeh Shakeri Advances in system fault modeling and diagnosis , 1996 .

[26]  L. Baum,et al.  An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process , 1972 .

[27]  Kurt Hornik,et al.  Multilayer feedforward networks are universal approximators , 1989, Neural Networks.

[28]  Frank Harary,et al.  Finite Graphs and Networks, An Introduction with Applications. , 1967 .

[29]  Krishna R. Pattipati,et al.  Optimal and near-optimal algorithms for multiple fault diagnosis with unreliable tests , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[30]  J. Beasley A lagrangian heuristic for set‐covering problems , 1990 .