A Simple Model of Search for a Moving Target

DOI Web Site 6 Citations

Description

<jats:p> 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. </jats:p>

Journal

  • Operations Research

    Operations Research 18 (5), 883-903, 1970-10

    Institute for Operations Research and the Management Sciences (INFORMS)

Citations (6)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top