Test sequencing algorithms with unreliable tests

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 29, Issue 4, 1999, Pages 347-357

  Raghavan, Vijaya ^a,b   Shakeri, Mojdeh ^a,b   Pattipati, Krishna ^a,c  

^a IEEE   (United States)

^b MATHWORKS INC   (United States)

^c UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CERTAINTY EQUIVALENCE; GRAPH SEARCH ALGORITHMS; INDEX RULES; INFORMATION GAIN; MULTISTEP DYNAMIC PROGRAMMING; PARTIALLY OBSERVED MARKOV DECISION PROBLEM; TEST SEQUENCING;

DECISION THEORY; DYNAMIC PROGRAMMING; EQUIVALENCE CLASSES; GRAPH THEORY; HEURISTIC METHODS; MARKOV PROCESSES; RECURSIVE FUNCTIONS;

ALGORITHMS;

EID: 0032648910     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/3468.769753     Document Type: Article

References (18)

1. B. Gluss, "An optimum policy for determining a fault in a complex system," Oper. Res., vol. 8, pp. 512-523, 1960.
2. J. A. Nachlas, S. R. Loney, and B. A. Binney, "Diagnostic strategy selection for series systems," IEEE Trans. Rel., vol. 39, Aug. 1990.
3. R. E. Bellman, Dynamic Programming. Princeton, NJ: Princeton Univ. Press, 1957.
4. D. P. Bertsekas, Dynamic Programming: Deterministic and Stochastic Models. Englewood Cliffs, NJ: Prentice-Hall, 1987.
5. T. Ibaraki and N. Katoh, Resource Allocation Problems: Algorithmic Approaches. Cambridge, MA: MIT Press, 1988.
6. D. W. Loveland, "Performance bounds for binary testing with arbitrary weights," Acta Inform., no. 22, pp. 101-114, 1985.
7. V. Raghavan, K. R. Pattipati, and M. Shakeri, "Optimal and near-optimal test sequencing algorithms with realistic test models," IEEE Trans. Syst., Man, Cybern., vol. 29, pp. 13-25, Jan. 1999.
8. G. Monahan, "A survey of partially observable Markov decision processes," Manage. Sci., vol. 28, pp. 1-16, 1982.
9. R. D. Smallwood and E. J. Sondik, "Optimal control of partially observable processes over the finite horizon," Oper. Res., vol. 21, pp. 1071-1088, 1973.
10. S. J. Benkoski, M. G. Monticino, and J. R. Weisinger, "A survey of search theory literature," Nov. Res. Logist., vol. 38, no. 4, pp. 469-494, 1991.
11. J. B. Kadane, "Optimal whereabouts search," Oper. Res., vol. 19, pp. 894-904, 1971.
12. K. P. Tognetti, "An optimal strategy for whereabouts search," Oper. Res., vol. 16, pp. 209-211, 1968.
13. V. Raghavan, P. Willett, K. Pattipati, and D. Kleinman, "Optimal measurement sequencing in M-ary hypothesis testing problems," in Proc. 1992 Amer. Contr. Conf., Chicago, IL, June 1992.
14. T. B. Sheridan, "On how often a supervisor should sample," IEEE Trans. Syst., Man, Cybern., vol. SMC-13, pp. 37-46, Jan./Feb. 1965.
15. J. M. Dobbie, "Some search problems with false contacts," Oper. Res., vol. 21, pp. 907-925, 1973.
16. L. D. Stone and J. A. Stanshine, "Optimal search using uninterrupted contact investigation," SIAM J. Appl. Math., vol. 20, pp. 241-263, 1971.
17. _, "Optimal search in the presence of Poisson-distributed false targets," SIAM J. Appl. Math., vol. 23, pp. 6-27, 1972.
18. A. Wald, Sequential Analysis. New York: Wiley, 1947.