An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

James N. Eagle and James R. Yee
Additional contact information
James N. Eagle: Naval Postgraduate School, Monterey, California
James R. Yee: University of Southern California, Los Angeles, California

Operations Research, 1990, vol. 38, issue 1, 110-114

Abstract: A searcher and target move among a finite set of cells C = 1, 2, …, N in discrete time. At the beginning of each time period, one cell is searched. If the target is in the selected cell j , it is detected with probability q j . If the target is not in the cell searched, it cannot be detected during the current time period. After each search, a target in cell j moves to cell k with probability p jk . The target transition matrix, P = [ p jk ] is known to the searcher. The searcher's path is constrained in that if the searcher is currently in cell j , the next search cell must be selected from a set of neighboring cells C j . The object of the search is to minimize the probability of not detecting the target in T searches.

Keywords: military; search/surveillance: moving target and constrained search path; programming; integer algorithms; branch-and-bound: computing optimal search path (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.1.110 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:38:y:1990:i:1:p:110-114

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().