Show simple item record

dc.contributor.advisorRoyset, Johannes O.
dc.contributor.authorForaker, Joseph Carl.
dc.dateSeptember 2011
dc.date.accessioned2012-08-22T15:33:36Z
dc.date.available2012-08-22T15:33:36Z
dc.date.issued2011-09
dc.identifier.urihttp://hdl.handle.net/10945/10789
dc.description.abstractWe show how to formulate many continuous time-and-space search problems as generalized optimal control problems, where multiple searchers look for multiple targets. Speci cally, we formulate problems in which we minimize the probability that all of the searchers fail to detect any of the targets during the planning horizon, and problems in which we maximize the expected number of targets detected. We construct discretization schemes to solve these continuous time-and-space problems, and prove that they are consistent approximations. Consistency ensures that global minimizers, local minimizers, and stationary points of the discretized problems converge to global minimizers, local minimizers, and stationary points, respectively, of the original problems. We also investigate the rate of convergence of algorithms based on discretization schemes as a computing budget tends to in nity. We provide numerical results to show that our discretization schemes are computationally tractable, including examples with three searchers and ten targets. We develop three heuristics for real-time search planning, one based on our discretization schemes, and two based on polynomial tting methods, and compare the three methods to determine which solution technique would be best suited for use onboard unmanned platforms for automatic route generation for search missions.en_US
dc.description.urihttp://archive.org/details/optimalsearchfor1094510789
dc.format.extentxvi, 172 p. : col. ill. ; 28 cm.en_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.en_US
dc.subject.lcshOperations researchen_US
dc.titleOptimal search for moving targets in continuous time and space using consistent approximationsen_US
dc.contributor.departmentOperations Research
dc.subject.authorSearch theoryen_US
dc.subject.authorContinuous time-and-space searchen_US
dc.subject.authorConsistent approximationsen_US
dc.subject.authorGeneralized optimal controlen_US
dc.subject.authorAdaptive discretizationen_US
dc.subject.authorPolynomial fittingen_US
dc.subject.authorRate of convergenceen_US
dc.subject.authorSmall boat defenseen_US
dc.subject.authorForce protectionen_US
dc.description.serviceUS Navy (USN) authoren_US
etd.thesisdegree.namePh.D. in Operations Researchen_US
etd.thesisdegree.levelDoctoralen_US
etd.thesisdegree.disciplineOperations Researchen_US
etd.thesisdegree.grantorNaval Postgraduate School (U.S.)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record