Using Multiple Searchers in Constrained-Path, Moving-Target Search Problems
| dc.contributor.author | Dell, Robert F. | |
| dc.contributor.author | Eagle, James N. | |
| dc.contributor.author | Martins, Gustavo Henrique Alves | |
| dc.contributor.author | Santos, Almir Garnier | |
| dc.date | 1996 | |
| dc.date.accessioned | 2014-01-09T22:23:09Z | |
| dc.date.available | 2014-01-09T22:23:09Z | |
| dc.date.issued | 1996 | |
| dc.identifier.citation | Dell, R.F., Eagle, J.N., Martins, G.H.A., and Santos, A.G., â Using Multiple Searchers in Constrained-Path, Moving-Target Search Problems,â Naval Research Logistics, 43, 1996, pp. 463-480. | |
| dc.identifier.uri | http://hdl.handle.net/10945/38187 | |
| dc.description | Naval Research Logistics, 43, 1996, pp. 463-480. | en_US |
| dc.description.abstract | 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... | en_US |
| dc.rights | defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States. | en_US |
| dc.title | Using Multiple Searchers in Constrained-Path, Moving-Target Search Problems | en_US |
| dc.type | Article | en_US |
| dc.contributor.department | Operations Research (OR) |
Files in this item
This item appears in the following Collection(s)
Related items
Showing items related by title, author, creator and subject.
-
A search game on a hypergraph with booby traps
(Elsevier, 2020-03);A set of n boxes, located on the vertices of a hypergraph G, contain known but different rewards. A Searcher opens all the boxes in some hyperedge of G with the objective of collecting the maximum possible total reward. ... -
When is Information Sufficient for Action? Search with Unreliable Yet Informative Intelligence
(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 ... -
A new branch-and-bound procedure for computing optimal search paths
(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 ...
