zbMATH — the first resource for mathematics

Three problems in searching for a moving target between two sites. (English) Zbl 1340.60119
Summary: Suppose that a moving target moves randomly between two sites and its movement is modeled by a homogeneous Markov chain. We consider three classical problems: (1) What kinds of strategies are valid? (2) What strategy is the optimal? (3) What is the infimum of expected numbers of looks needed to detect the target? Problem (3) is thoroughly solved, and some partial solutions to Problems (1) and (2) are achieved.
60J20 Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
90B40 Search theory
Full Text: DOI