The "follow the target" problem — many possible locations, far fewer sensors, only intermittent observation — can be solved as a multi-armed bandit over a discrete-time Markov chain: at each time step, allocate the sensor to the state with the highest probability of containing the target.

— In our words · Source: A multi-armed bandit approach to following a Markov Chain (Ezra W. Akin)