Optimal multiplicative Bayesian search for a lost target

This paper deals with the problem of searching for not evading lost target by using Bayesian approach. The target may be stationary or drifting in one of nn-disjoint bounded known regions. We use a team of nn-searchers such that each region has a single searcher. The purpose here is to formulate a search model and obtains two candidate utility functions namely the mean time to detection and the cumulative probability of detection for the control solution. Furthermore, we maximize the chances of detecting the target given a restricted amount of time by maximizing probability of detection over the time horizon. The effectiveness of this method is illustrated by using a real world example with numerical results.