Using Multiple Searchers in Constrained-Path, Moving-Target Search Problems
Dell, Robert F.
Eagle, James N.
Martins, Gustavo Henrique Alves
Santos, Almir Garnier
MetadataShow full item record
The search theory open literature has paid little, if any, attention to the multiple-searcher, moving-target search problem. We develop an optimal branch-and-bound procedure and six heuristics for solving constrained-path problems with multiple searchers. Our optimal procedure outperforms existing approaches when used with only a single searcher. For more than one searcher, the time needed to guarantee an optimal solution is prohibitive...
Naval Research Logistics, 43, 1996, pp. 463-480.
Showing items related by title, author, creator and subject.
Atkinson, Michael P.; Lange, Rutger-Jan (2016);We analyze a variant of the whereabouts search problem, in which a searcher looks for a target hiding in one of n possible locations. Unlike in the classic version, our searcher does not pursue the target by actively moving ...
Martins, Gustavo H. A. (Monterey, California. Naval Postgraduate School, 1993-03);We consider the problem of a searcher trying to detect a target that moves among a finite set of cells, C= 1,...,N, in discrete time, according to a specified Markov process. In each time period the searcher chooses one ...
Lidbetter, Thomas; Lin, Kyle Y. (2017-10-15);Many practical search problems concern the search for multiple hidden objects or agents, such as earthquake survivors. In such problems, knowing only the list of possible locations, the Searcher needs to find all the ...