Publication:
An optimal branch-and-bound procedure for the constrained path, moving target search problem

Loading...
Thumbnail Image
Authors
Eagle, James N.
Yee, James R.
Subjects
search, moving target, constrained path
Advisors
Date of Issue
1987-12
Date
1987-12
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher must choose one cell in which to search in each time period. The set of cells available for search depends upon the cell chosen in the last time period. The problem is to find a search path, i.e., a sequence of search cells that maximizes the probability of detecting the target in a fixed number of time periods. Closely following earlier work by Theodor Stewart, a branch-and-bound procedure is developed which finds optimal search paths. This procedure is tested and appears to be more efficient than existing dynamic programming solution methods. Keywords: Moving targets; Target detection; Searching
Type
Technical Report
Description
Series/Report No
Department
Operations Research
Identifiers
NPS Report Number
NPS55-87-015
Sponsors
supported in part with funds provided from the Chief of Naval Operations
Funder
N41756D7WP78122
Format
Citation
Distribution Statement
Rights
Collections