Optimal Detection Search

Abstract : This paper considers and unifies two search problems which have been extensively discussed. A class of sequential problems is proposed that includes both. A theorem is proved, under arbitrary partial ordering constraints, characterizing a strategy to minimize the expected cost of a successful search. The main tool is a set of functional equations in strategy space.