Abstract
This paper addresses the problem of searching for multiple targets using multiple sensors, where targets move randomly between a limited number of states at each time interval. Due to the potential value or danger of the targets, multiple sensors are employed to detect them as quickly as possible within a fixed number of search intervals. Each search interval has an available search effort and an exponential detection function is assumed. The goal is to develop an optimal search strategy that distributes the search effort across cells in each time interval and calculates the probability of not detecting the targets throughout the entire search period. The optimal search strategy that minimizes this probability is determined, the stability of the search is analyzed, and some special cases are considered. Additionally, we introduce the $M$-cells algorithm.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call