By Topic

Optimal search strategies in dynamic hypothesis testing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
D. A. Castanon ; Dept. of Electr. Comput. & Syst. Eng., Boston Univ., MA, USA

The author formulates and solves a class of dynamic search problems for obtaining the closed-loop sequence of measurements which, under a symmetry condition on the probability distribution of the measurements, optimally selects among many candidate hypotheses. Under this condition, the optimal strategy is characterized by a simple index rule which depends only on the ordering of the conditional probabilities of the hypotheses given the past measurements. The author proves that this index rule is optimal independent of the number of measurements to be taken. The author illustrates with numerical examples that, when the symmetry conditions are relaxed, the index policies are suboptimal, but achieve performance which is close to optimal. The results can be applied to solve complex problems in fault diagnosis and search with unreliable tests

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:25 ,  Issue: 7 )