Optimal Whereabouts Search for a Moving Target

Published Online:https://doi.org/10.1287/opre.29.6.1154

This paper shows that solving the optimal whereabouts search problem for a moving target is equivalent to solving a finite number of optimal detection problems for moving targets. This generalizes the result of Kadane (Kadane, J. B. 1971. Optimal whereabouts search. Opns. Res.19 894–904.) for stationary targets.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.