Dynamic multiple fault diagnosis with imperfect tests

Fault diagnosis is the process of identifying the failure sources of a malfunctioning system by observing their effects at various test points. It has a number of applications in engineering and medicine. In this paper, we present a near-optimal algorithm for dynamic multiple fault diagnosis in complex systems. This problem involves on-board diagnosis of the most likely set of faults and their time-evolution based on blocks of unreliable test outcomes over time. The dynamic multiple fault diagnosis (dMFD) problem is an intractable NP-hard combinatorial optimization problem. Consequently, we decompose the dMFD problem into a series of decoupled sub-problems, and develop a successive Lagrangian relaxation algorithm (SLRA) with backtracking to obtain a near-optimal solution for the problem. SLRA solves the sub-problems at each sample point by a Lagrangian relaxation method, and shares Lagrange multipliers at successive time points to speed up convergence. In addition, we apply a backtracking technique to further maximize the likelihood of obtaining the most likely evolution of failure sources and to minimize the effects of imperfect tests.

[1]  Krishna R. Pattipati,et al.  Multiple disease (fault) diagnosis with applications to the QMR-DT problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[2]  Krishna R. Pattipati,et al.  A hidden Markov model-based algorithm for fault diagnosis with partial and imperfect tests , 2000, IEEE Trans. Syst. Man Cybern. Part C.

[3]  Michael I. Jordan,et al.  Factorial Hidden Markov Models , 1995, Machine Learning.

[4]  J. Brandon,et al.  A genetic algorithm for diagnosis problem solving , 1993, Proceedings of IEEE Systems Man and Cybernetics Conference - SMC.

[5]  Zoubin Ghahramani,et al.  Learning Dynamic Bayesian Networks , 1997, Summer School on Neural Networks.

[6]  Krishna R. Pattipati,et al.  Test sequencing algorithms with unreliable tests , 1999, IEEE Trans. Syst. Man Cybern. Part A.

[7]  Thiagalingam Kirubarajan,et al.  Real-time system diagnosis with sensors of uncertain quality , 2003, SPIE Defense + Commercial Sensing.

[8]  Shigeo Abe DrEng.  Pattern Classification , 2001, Springer London.

[9]  G. Nemhauser,et al.  Integer Programming , 2020 .

[10]  Krishna R. Pattipati,et al.  Rollout strategies for sequential fault diagnosis , 2002, Proceedings, IEEE AUTOTESTCON.

[11]  David G. Stork,et al.  Pattern Classification , 1973 .

[12]  Krishna R. Pattipati,et al.  Application of heuristic search and information theory to sequential fault diagnosis , 1990, IEEE Trans. Syst. Man Cybern..

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

[14]  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.

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

[16]  Nevin Lianwen Zhang,et al.  Exploiting Causal Independence in Bayesian Network Inference , 1996, J. Artif. Intell. Res..

[17]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[18]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[19]  Krishna R. Pattipati,et al.  On a multimode test sequencing problem , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[20]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[21]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

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

[23]  Krishna R. Pattipati,et al.  Computationally efficient algorithms for multiple fault diagnosis in large graph-based systems , 2003, IEEE Trans. Syst. Man Cybern. Part A.