OPTIMAL SEARCH DENSITY FOR A STATIONARY TARGET AMONG STATIONARY FALSE TARGETS
成果类型：
Article
署名作者：
KALBAUGH, DV
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.41.2.310
发表日期：
1993
页码：
310-318
关键词：
摘要：
This paper considers rational methods for the design of search densities when the intended target is stationary among stationary, Poisson-distributed false contacts. Attention is restricted to situations in which the searcher must immediately decide, based on sensed information, whether a contact is the intended target and, if the answer is yes, end the search and commit to the contact. Discrimination of false contact from target is modeled as reliable only with given probabilities. We seek to allocate search effort to maximize the probability of finding the intended target in a fixed time. Modeling space and time as discrete, we apply the Kuhn-Tucker theorem to obtain a set of necessary conditions for an optimum. For the particular case of a discrete space and time approximation of search for a normally distributed target in R2 and a uniform density of false contacts, we develop a computer algorithm that converges to a solution of the necessary conditions. Numerical results are presented.