Rollout Strategies for Sequential Fault Diagnosis

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

Volumn 33, Issue 1, 2003, Pages 86-99

  Tu, Fang ^a   Pattipati, Krishna R ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

AND OR graph search; AO*; Entropy; Huffman coding; Information heuristic; Rollout algorithm; Sequential fault diagnosis; Test sequencing problem

Indexed keywords

ALGORITHMS; ENTROPY; GRAPH THEORY; PROBLEM SOLVING;

SEQUENTIAL FAULT DIAGNOSIS;

DYNAMIC PROGRAMMING;

EID: 0142196590     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2003.809206     Document Type: Article

References (27)

1. D. P. Bertsekas, J. N. Tsitsiklis, and C. Wu, "Rollout algorithms for combinatorial optimization," J. Heuristics, vol. 3, no. 3, pp. 245-262, Nov. 1997.
2. D. P. Bertsekas and D. A. Castanon, "Rollout algorithms for stochastic scheduling problems," J. Heuristics, vol. 5, pp. 89-108, Apr. 1999.
3. D. P. Bertsekas and J. N. Tsitsiklis, Neuro-Dynamic Programming. Belmont, MA: Athena, 1996.
4. K. R. Pattipati and M. G. Alexandridis, "Application of heuristic search and information theory to sequential fault diagnosis," IEEE Trans. Syst., Man, Cybern., vol. SMC-20, pp. 872-887, July/Aug. 1990.
5. M. R. Garey, "Optimal binary identification procedures," SIAM J. Appl. Math., vol. 23, no. 2, pp. 173-186, Sept. 1972.
6. R. A. Johnson, "An information theory approach to diagnosis," in Proc. 6th Symp. Reliability Quality Control, 1960, pp. 102-109.
7. P. K. Varshney, C. R. P. Hartmann, and J. M. DeFaria Jr., "Application of information theory to sequential fault diagnosis," IEEE Tran. Comput., vol. C-31, pp. 164-170, 1982.
8. M. R. Garey and R. L. Graham, "Performance bounds on the splitting algorithm for binary testing," Acta Inform., vol. 3, no. 4, pp. 347-355, 1974.
9. D. P. Bertsekas, "Differential training of rollout policies," in Proc. 35th Allerton Conf, Communication, Control, Computing, Allerton Park, IL., Oct. 1997.
10. F. Novak, A. Biasizzo, and M. Žele, "Sequential fault diagnosis in system maintenance," in Proc. COMPEURO'93, Paris, France, 1993, pp. 119-124.
11. I. Bhandari, H. A. Simon, and D. P. Siewiorek, "Models of test selection," IEEE Trans. Syst., Man, Cybern., vol. 25, pp. 1349-1364, Oct. 1995.
12. _, "Optimal probe selection in diagnostic search," IEEE Trans. Syst., Man, Cybern., vol. 20, pp. 990-999, Sept./Oct. 1990.
13. V. Raghavan, M. Shakeri, and K. Pattipati, "Test sequencing algorithms with unreliable tests," IEEE Trans. Syst., Man, Cybern. A, vol. 29, pp. 347-357, July 1999.
14. V. Raghavan, K. Pattipati, and M. Shaken, "Optimal and near-optimal test sequencing algorithms with realistic test models," IEEE Trans. Syst., Man, Cybern. A, vol. 29, pp. 11-26, Jan. 1999.
15. A. Martelli and U. Montanari, "Additive AND/OR graphs," in Proc. 3rd Int. Conf. Artificial Intelligence, Stanford, CA, Aug. 1973, pp. 1-11.
16. _, "Optimizing decision trees through heuristically guided search," Commun. ACM, vol. 21, no. 12, pp. 1025-1039, 1978.
17. A. Mahanti and A. Bagchi, "AND/OR graph heuristic search methods," J. ACM, vol. 32, no. 1, pp. 28-51, 1985.
18. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
19. J. M. Christensen and J. M. Howard, "Field experience in maintenance," in Human Detection and Diagnosis of System Failures, J. Rasmussen and W. B. Rouse, Eds. New York: Plenum, 1981.
20. D. P. Bertsekas, Dynamic Programming and Optimal Control, 2nd ed. Belmont, MA: Athena, 2000, vol. 1.
21. G. Tesauro and G. R. Galperin, "On-line policy improvement using monte-carlo search," in Advances in Neural Information Processing: Proceedings of the Ninth Conference. Cambridge, MA: MIT Press, 1996.
22. T. J. Perkins and A. G. Barto, "Heuristic search in infinite state spaces guided by lyapunov analysis," in Proc. 7th Int. Joint Conf. Artificial Intelligence. San Mateo, CA: Morgan Kaufmann, 2001, pp. 242-247.
23. A. McGovern and E. Moss, "Scheduling straight-line code using reinforcement learning and rollouts," in Proc. 11th Neural Information Processing Systems Conf., 1998.
24. D. P. Bertsekas, "Rollout algorithms: an overview," in Proc. 38th Conf. Decision Control, Phoenix, AZ, Dec. 1999.
25. P. P. Chakrabarti, S. Ghose, A. Acharya, and S. C. Desarkar, "Heuristic search in restricted memory," Artif. Intell., vol. 41, pp. 197-221, Dec. 1989.
26. P. P. Chakrabarti, S. Ghose, and S. C. Desarkar, "Admissibility of AO* when heuristics overestimate," Artif. Intell., vol. 34, pp. 97-113, Dec. 1988.
27. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.