On a multimode test sequencing problem

Test sequencing is a binary identification problem wherein one needs to develop a minimal expected cost test procedure to determine which one of a finite number of possible failure states, if any, is present. In this paper, we consider a multimode test sequencing (MMTS) problem, in which tests are distributed among multiple modes and additional transition costs will be incurred if a test sequence involves mode changes. The multimode test sequencing problem can be solved optimally via dynamic programming or AND/OR graph search methods. However, for large systems, the associated computation with dynamic programming or AND/OR graph search methods is substantial due to the rapidly increasing number of OR nodes (denoting ambiguity states and current modes) and AND nodes (denoting next modes and tests) in the search graph. In order to overcome the computational explosion, we propose to apply three heuristic algorithms based on information gain: information gain heuristic (IG), mode capability evaluation (MC), and mode capability evaluation with limited exploration of depth and degree of mode Isolation (MCLEI). We also propose to apply rollout strategies, which are guaranteed to improve the performance of heuristics, as long as the heuristics are sequentially improving. We show computational results, which suggest that the information-heuristic based rollout policies are significantly better than traditional information gain heuristic. We also show that among the three information heuristics proposed, MCLEI achieves the best tradeoff between optimality and computational complexity.

[1]  M. Garey.  Optimal Binary Identification Procedures , 1972 .

[2]  Pramod K. Varshney,et al.  Application of Information Theory to Sequential Fault Diagnosis , 1982, IEEE Transactions on Computers.

[3]  A. Bagchi,et al.  AND/OR graph heuristic search methods , 1985, JACM.

[4]  K. Pattipati,et al.  Application of heuristic search and information theory to sequential fault diagnosis , 1988, Proceedings IEEE International Symposium on Intelligent Control 1988.

[5]  Krishna R. Pattipati,et al.  Rollout strategies for sequential fault diagnosis , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[6]  Alberto Martelli,et al.  Optimizing decision trees through heuristically guided search , 1978, CACM.

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

[8]  John W. Sheppard,et al.  A mathematical model for integrated diagnostics , 1991, IEEE Design & Test of Computers.

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

[10]  John N. Tsitsiklis,et al.  Rollout Algorithms for Combinatorial Optimization , 1997, J. Heuristics.

[11]  Dimitri P. Bertsekas.  Rollout algorithms: an overview , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

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

[13]  Krishna R. Pattipati,et al.  Optimal and near-optimal test sequencing algorithms with realistic test models , 1999, IEEE Trans. Syst. Man Cybern. Part A.

[14]  P. P. Chakrabarti,et al.  Heuristic Search in Restricted Memory , 1989, Artif. Intell..

[15]  D.A. Castanon,et al.  Rollout Algorithms for Stochastic Scheduling Problems , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[16]  Alberto Martelli,et al.  Additive AND/OR Graphs , 1973, IJCAI.

[17]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[18]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[19]  G. Biswas,et al.  Model-based fault-adaptive control of complex dynamic systems , 2003, Proceedings of the 20th IEEE Instrumentation Technology Conference (Cat. No.03CH37412).