Abstract
dc:description.abstractDifferent strategies can be used to search for a moving object. If the searcher's action at each time unit maximizes his chances of immediate detection, his strategy is said to be myopic. If, however, the searcher seeks to allocate search effort to maximize the probability of detecting the target within a preset amount of time, his strategy is called optimal. This thesis documents interactive computer programs that are useful for testing search strategies against the myopic strategy, and shows examples where the myopic strategy is not optimal.
Degree
thesis:*- Department dc:contributor.department
- Department of Operations Research
- Grantor dc:publisher
- Naval Postgraduate School
- Year dc:date.issued
- 1978
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- de Paula Neto, Antonio Francisco
- Advisor dc:contributor.advisor
-
- Washburn, A.R.
Rights
dc:rights- Statement dc:rights
-
- Copyright is reserved by the copyright owner
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/10945/18501
- OAI identifier oai:identifier
- oai:calhoun.nps.edu:10945/18501