Show simple item record

dc.contributor.authorEagle, James N.
dc.date.accessioned2017-08-10T16:52:38Z
dc.date.available2017-08-10T16:52:38Z
dc.date.issued1987
dc.identifier.citationJ.N. Eagle, "Towards the efficient solution of an ASW search problem," Naval Research Reviews, v. 39, no.1, (1987), pp. 36-40.en_US
dc.identifier.urihttp://hdl.handle.net/10945/55468
dc.description.abstractThe problem addressed here was motivated by search problems encountered by antisubmarine warfare (ASW) forces. In particular, we postulate that a target submarine has been detected by a long-range sensor. After the detection, the target's location is not known precisely but is given as a probability distribution over some, possibly large, area of ocean. A mobile ASW platform with a specified max­imum speed is then required to close the submarine for attack or surveillance. The searcher is provided with the initial target distribution and statistical information on historical target tracks. The searcher's problem is to select a track which will maximize the probability of detecting the target by some specified future time.en_US
dc.format.extent5 p.en_US
dc.publisherOffice of Naval Researchen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleTowards the efficient solution of an ASW search problemen_US
dc.typeArticleen_US
dc.contributor.corporateNaval Postgraduate School (U.S.)en_US
dc.contributor.departmentOperations Researchen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record