Search for a Moving Target: The FAB Algorithm
Abstract
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.

