A novel test optimizing algorithm for sequential fault diagnosis

Abstract Once all available measurements are determined, the highest testability index of a complex system is determined. To achieve such highest index with the lowest test cost, AND/OR graph search algorithms were developed for years to determine an optimal or near-optimal test sequence. However, in most cases, achieving the highest testability index induces extremely high test cost. The purpose of this paper is to optimize test set and test sequence so as to cut down the test cost while keeping the required, not necessarily the highest, FIR (Fault Isolation Rate) satisfied. Traditionally, this is an NP-Complete problem, which makes the computation of optimal test set impractical for even the moderate-sized model. In this paper, a greedy method is proposed to get the optimized test set. Then, we combine the greedy method with discrete binary particle swarm optimization (DPSO) to construct a test sequential tree. With the specified FIR requirement satisfied, the lowest test cost is achieved. The proposed algorithms are illustrated and tested in a range of real-world systems. The effectiveness and accurateness of the proposed algorithm is verified by computational results.

[1]  Bai Liang,et al.  Sequential diagnostic strategy for the diagnosis of complex systems , 2002, 2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering. TENCOM '02. Proceedings..

[2]  Bülent Çatay,et al.  TestAnt: An ant colony system approach to sequential testing under precedence constraints , 2011, Expert Syst. Appl..

[3]  Bin Long,et al.  Applying Improved AO * Based on DPSO Algorithm in the Optimal Test-Sequencing Problem of Large-scale Complicated Electronic System: Applying Improved AO * Based on DPSO Algorithm in the Optimal Test-Sequencing Problem of Large-scale Complicated Electronic System , 2009 .

[4]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

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

[6]  Daniela De Venuto,et al.  Fault diagnosis and test of DNA sensor arrays by using IFA approach , 2009, Microelectron. J..

[7]  Sy-Yen Kuo,et al.  Design-for-testability techniques for CORDIC design , 2009, Microelectron. J..

[8]  Ruey-Wen Liu.  Testing and Diagnosis of Analog Circuits and Systems , 1991, Springer US.

[9]  Shulin Tian,et al.  Multidimensional Fitness Function DPSO Algorithm for Analog Test Point Selection , 2010, IEEE Transactions on Instrumentation and Measurement.

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

[11]  R. A. Johnson,et al.  An Information Theory Approach to Diagnosis , 1960 .

[12]  Sheng-Chai Chi,et al.  An enhanced inference strategy for machine fault diagnosis system using hill-climbing approach , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[13]  Shulin Tian,et al.  Diagnostics of Filtered Analog Circuits with Tolerance Based on LS-SVM Using Frequency Features , 2012, J. Electron. Test..

[14]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[15]  Li Xing-shan.  Generation of Test Strategy for Sequential Fault Diagnosis Based on Genetic Algorithms , 2004 .

[16]  Michael Pecht,et al.  Prognostics-based health management for free air cooling of data centers , 2010, 2010 Prognostics and System Health Management Conference.

[17]  Tonguç Ünlüyurt,et al.  Sequential testing of complex systems: a review , 2004, Discret. Appl. Math..

[18]  Krishna R. Pattipati,et al.  START: System Testability Analysis and Research Tool , 1990, IEEE Conference on Systems Readiness Technology, 'Advancing Mission Accomplishment'..

[19]  Ronald L. Graham,et al.  Performance bounds on the splitting algorithm for binary testing , 1974, Acta Informatica.

[20]  Krishna R. Pattipati,et al.  Sequential testing algorithms for multiple fault diagnosis , 2000, IEEE Trans. Syst. Man Cybern. Part A.

[21]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[22]  Krishna R. Pattipati,et al.  Optimal Selection of Imperfect Tests for Fault Detection and Isolation , 2013, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[23]  O. Erhun Kundakcioglu,et al.  Bottom-Up Construction of Minimum-Cost and/ or Trees for Sequential Fault Diagnosis , 2007, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[24]  Michael Pecht,et al.  Prognostics-based risk mitigation for telecom equipment under free air cooling conditions , 2012 .

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

[26]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).