Show simple item record

dc.contributor.authorEagle, James N.
dc.date1984-05
dc.date.accessioned2013-03-07T21:51:51Z
dc.date.available2013-03-07T21:51:51Z
dc.date.issued1984-05
dc.identifier.urihttp://hdl.handle.net/10945/29725
dc.description.abstractA simple moving target problem is approximately solved for that search path minimizing the probability of non-detection subject to specified constraints on the search path. The solution procedure uses moving horizon policies. An 'almost asymptotically geometric' structure is observed in the solution. (Author)en_US
dc.description.sponsorshipPrepared for: Strategic Systems Project Office, Arlington, VA.en_US
dc.description.urihttp://archive.org/details/approximatesolut00eagl
dc.language.isoen_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.lcshSearch theoryen_US
dc.titleThe approximate solution of a simple constrained search path moving target problem using moving horizon policiesen_US
dc.typeTechnical Reporten_US
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.subject.authorsearchen_US
dc.subject.authormoving targeten_US
dc.description.funderN0003083WR32406en_US
dc.description.recognitionNAen_US
dc.identifier.oclcNA
dc.identifier.npsreportNPS-55-84-009


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record