{"id":{"repo_id":"nps","oai_identifier":"oai:calhoun.nps.edu:10945/18501"},"canonical_url":"https://search.dev.ndltd.org/etd/nps/oai:calhoun.nps.edu:10945/18501","repository":{"repo_id":"nps","name":"Naval Postgraduate School","base_url":"https://calhoun.nps.edu/server/oai/request"},"display":{"title":"Myopic search plans","abstract":"Different 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.","abstract_html":"Different 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.","abstract_has_math":false,"creators":["de Paula Neto, Antonio Francisco"],"institution":"Naval Postgraduate School","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Department of Operations Research","school":null,"contributors":[],"advisors":["Washburn, A.R."],"committee_chairs":[],"committee_members":[],"year":1978,"date_issued":"1978","date_published":"1978","updated_at":"2026-07-27T20:26:16Z","subjects":[],"languages":["en_US"],"rights":["Copyright is reserved by the copyright owner"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10945/18501","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Washburn, A.R."]},{"key":"dc:contributor.department","label":"Department","values":["Department of Operations Research"]},{"key":"dc:creator","label":"Author","values":["de Paula Neto, Antonio Francisco"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["September 1978"]},{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2012-11-16T19:22:25Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2012-11-16T19:22:25Z"]},{"key":"dc:date.issued","label":"Date","values":["1978"]},{"key":"dc:publisher","label":"Institution","values":["Naval Postgraduate School"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright is reserved by the copyright owner"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10945/18501"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Different 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."]},{"key":"dc:title","label":"Title","values":["Myopic search plans"]}]}],"canonical_facts":{"dc:contributor.advisor":["Washburn, A.R."],"dc:contributor.department":["Department of Operations Research"],"dc:creator":["de Paula Neto, Antonio Francisco"],"dc:date":["September 1978"],"dc:date.accessioned":["2012-11-16T19:22:25Z"],"dc:date.available":["2012-11-16T19:22:25Z"],"dc:date.issued":["1978"],"dc:description.abstract":["Different 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."],"dc:identifier.uri":["https://hdl.handle.net/10945/18501"],"dc:language.iso":["en_US"],"dc:publisher":["Naval Postgraduate School"],"dc:rights":["Copyright is reserved by the copyright owner"],"dc:title":["Myopic search plans"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T20:26:16Z"}