DocumentCode :
1305735
Title :
Optimal probe selection in diagnostic search
Author :
Bhandari, Inderpal S. ; Simon, Herbert A. ; Siewiorek, Daniel P.
Author_Institution :
Carnegie Mellon Univ., Pittsburgh, PA, USA
Volume :
20
Issue :
5
fYear :
1990
Firstpage :
990
Lastpage :
999
Abstract :
Probe selection (PS) in machine diagnosis is viewed as a collection of models that apply under specific conditions. This makes it possible for three polynomial-time optimal algorithms to be developed for simplified PS models that allow different probes to have different costs. The work is compared with previous research, wherein H.A. Simon and J.B. Kadane (1975) review and develop a collection of models for optimal problem-solving search. The relationship between these models and the three newly developed algorithms for PS is explored. Two of the algorithms are unlike the ones discussed by Simon and Kadane. The third cannot be related to the problem-solving models
Keywords :
computational complexity; fault location; heuristic programming; probability; problem solving; reliability theory; search problems; computational complexity; diagnostic search; fault location; machine diagnosis; polynomial-time optimal algorithms; probe selection; problem-solving search; reliability theory; Aerospace electronics; Computer science; Computerized monitoring; Contracts; Cost function; Heuristic algorithms; Laboratories; Polynomials; Probes; Problem-solving;
fLanguage :
English
Journal_Title :
Systems, Man and Cybernetics, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9472
Type :
jour
DOI :
10.1109/21.59964
Filename :
59964
Link To Document :
بازگشت