Technical Note—Threshold Probabilities when Searching for a Moving Target

Abstract

Pollock has examined a model of search for a target whose transitions between two regions are described by a two-state stationary Markov chain. The minimum-search policy is characterized by a threshold probability π* that determines which region to search next. This note presents a simple recursive procedure for calculating π*.