Search for a Moving Target: The FAB Algorithm

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

We propose and study an iterative Forward And Backward (FAB) algorithm applicable to the problem of computing optimal search plans when the target's motion is modeled by a discrete space and time Markov chain. This paper generalizes the class of objective functions to which the method applies.

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.