Author(s)

Hongyun Wang^1*, Hong Zhou²

¹Department of Applied Mathematics and Statistics, Baskin School of Engineering, University of California, Santa Cruz, USA.
²Department of Applied Mathematics, Naval Postgraduate School, Monterey, USA.

We consider the problem of searching for a target that moves between a hiding area and an operating area over multiple fixed routes. The search is carried out with one or more cookie-cutter sensors, which can detect the target instantly once the target comes within the detection radius of the sensor. In the hiding area, the target is shielded from being detected. The residence times of the target, respectively, in the hiding area and in the operating area, are exponentially distributed. These dwell times are mathematically described by Markov transition rates. The decision of which route the target will take on each travel to and back from the operating area is governed by a probability distribution. We study the mathematical formulation of this search problem and analytically solve for the mean time to detection. Based on the mean time to capture, we evaluate the performance of placing the searcher(s) to monitor various travel route(s) or to scan the operating area. The optimal search design is the one that minimizes the mean time to detection. We find that in many situations the optimal search design is not the one suggested by the straightforward intuition. Our analytical results can provide operational guidances to homeland security, military, and law enforcement applications.

Optimal Search Design, Moving Target with Constrained Pathways, Single or Multiple Searchers, Escape Probability, Mean Time to Detection

Wang, H. and Zhou, H. (2015) Searching for a Target Traveling between a Hiding Area and an Operating Area over Multiple Routes. American Journal of Operations Research, 5, 258-273. doi: 10.4236/ajor.2015.54020.