A Simple Model of Search for a Moving Target
暂无分享,去创建一个
A target moves between two regions in a Markovian fashion, the parameters of which are known to the searcher. Discrete amounts of search effort (“looks”) may be allocated to one region at a time. This paper gives equations that characterize (a) the minimum expected number of looks to detect the target, and (b) the maximum probability of detecting the target within a given number of looks. These are solved completely for special cases, and numerical approximate solutions are described for general cases.
[1] J. Dobbie. Search theory: A sequential approach† , 1963 .
[2] William L. Black,et al. Discrete Sequential Search , 1965, Inf. Control..
[3] J. Kadane. Discrete search and the Neyman-Pearson Lemma , 1968 .
[4] M. Klein. A NOTE ON SEQUENTIAL SEARCH. , 1968 .
[5] Sheldon M. Ross,et al. A Problem in Optimal Search and Stop , 1969, Oper. Res..