Journal article
Surveillance Search for a Moving Target
Operations research, Vol.31(4), pp.720-738
08/1983
DOI: 10.1287/opre.31.4.720
Abstract
The authors formulate the surveillance search problem for applications in which the target moves according to a (not necessarily time-homogeneous) Markov process. A necessary set of conditions are derived for the optimality of a search strategy, and develop algorithms, based on the algorithm of Brown for the detection search problem, to find strategies that satisfy these necessary conditions for problems in which the search effort is infinitely divisible.
Details
- Title: Subtitle
- Surveillance Search for a Moving Target
- Creators
- Luke TierneyJoseph B. Kadane
- Resource Type
- Journal article
- Publication Details
- Operations research, Vol.31(4), pp.720-738
- DOI
- 10.1287/opre.31.4.720
- ISSN
- 0030-364X
- eISSN
- 1526-5463
- Language
- English
- Date published
- 08/1983
- Academic Unit
- Statistics and Actuarial Science
- Record Identifier
- 9984257746702771
Metrics
5 Record Views