{"id":{"repo_id":"nps","oai_identifier":"oai:calhoun.nps.edu:10945/9524"},"canonical_url":"https://search.dev.ndltd.org/etd/nps/oai:calhoun.nps.edu:10945/9524","repository":{"repo_id":"nps","name":"Naval Postgraduate School","base_url":"https://calhoun.nps.edu/server/oai/request"},"display":{"title":"A game theory analysis of proposed strategies of an aerial search for a mobile surface target.","abstract":"This thesis investigates the problem of aerial search for a mobile surface target. The initial position of the target is known, and a certain amount of time elapses before the search begins. The target has a variety of choices as to speed and direction, and the search aircraft has a choice of search patterns to be flown. The method proposed to solve the problem of maximizing or minimizing the probability of detection is the game theoretic analysis of various strategies available to the searcher and the evader. Four strategies for each are compared and evaluated, with optimal strategies, within the set of strategies investigated, being derived.","abstract_html":"This thesis investigates the problem of aerial search for a mobile surface target. The initial position of the target is known, and a certain amount of time elapses before the search begins. The target has a variety of choices as to speed and direction, and the search aircraft has a choice of search patterns to be flown. The method proposed to solve the problem of maximizing or minimizing the probability of detection is the game theoretic analysis of various strategies available to the searcher and the evader. Four strategies for each are compared and evaluated, with optimal strategies, within the set of strategies investigated, being derived.","abstract_has_math":false,"creators":["Smith, Charles James"],"institution":"Monterey, California. U.S. Naval Postgraduate School","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Parry, Samuel H."],"committee_chairs":[],"committee_members":[],"year":1966,"date_issued":"1966-10","date_published":"1966-10","updated_at":"2026-07-27T20:26:05Z","subjects":[],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10945/9524","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Parry, Samuel H."]},{"key":"dc:creator","label":"Author","values":["Smith, Charles James"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2012-08-09T19:32:05Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2012-08-09T19:32:05Z"]},{"key":"dc:date.issued","label":"Date","values":["1966-10"]},{"key":"dc:publisher","label":"Institution","values":["Monterey, California. U.S. 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"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10945/9524"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis investigates the problem of aerial search for a mobile surface target. The initial position of the target is known, and a certain amount of time elapses before the search begins. The target has a variety of choices as to speed and direction, and the search aircraft has a choice of search patterns to be flown. The method proposed to solve the problem of maximizing or minimizing the probability of detection is the game theoretic analysis of various strategies available to the searcher and the evader. Four strategies for each are compared and evaluated, with optimal strategies, within the set of strategies investigated, being derived."]},{"key":"dc:title","label":"Title","values":["A game theory analysis of proposed strategies of an aerial search for a mobile surface target."]}]}],"canonical_facts":{"dc:contributor.advisor":["Parry, Samuel H."],"dc:creator":["Smith, Charles James"],"dc:date.accessioned":["2012-08-09T19:32:05Z"],"dc:date.available":["2012-08-09T19:32:05Z"],"dc:date.issued":["1966-10"],"dc:description.abstract":["This thesis investigates the problem of aerial search for a mobile surface target. The initial position of the target is known, and a certain amount of time elapses before the search begins. The target has a variety of choices as to speed and direction, and the search aircraft has a choice of search patterns to be flown. The method proposed to solve the problem of maximizing or minimizing the probability of detection is the game theoretic analysis of various strategies available to the searcher and the evader. Four strategies for each are compared and evaluated, with optimal strategies, within the set of strategies investigated, being derived."],"dc:identifier.uri":["https://hdl.handle.net/10945/9524"],"dc:language.iso":["en_US"],"dc:publisher":["Monterey, California. U.S. Naval Postgraduate School"],"dc:title":["A game theory analysis of proposed strategies of an aerial search for a mobile surface target."],"dc:type":["Thesis"]},"updated_at":"2026-07-27T20:26:05Z"}