Show simple item record

dc.contributor.authorGlazebrook, Kevin D.
dc.date.accessioned2012-11-01T22:59:15Z
dc.date.available2012-11-01T22:59:15Z
dc.date.issued2001-09-01
dc.identifier.urihttp://hdl.handle.net/10945/15377
dc.description.abstractA Blue airborne force attacks a region defended by a single Red surface-to-air missile system (SAM). Red is uncertain about the Blues he faces, but is able to learn about them during the engagement. Red's objective is to develop a policy for shooting at the Blues to maximize the value of Blues shot down before he himself is destroyed. We show that index policies are optimal for Red in a range of scenarios and yield effective heuristics more generally. The quality of such index heuristics is confirmed in a computational study.en_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.titleMilitary stochastic scheduling treated as a "multi-armed bandit" problemen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentOperations Research
dc.subject.authorMarine mammals.en_US
dc.subject.authorHarp.en_US
dc.subject.authorBaleen whales.en_US
dc.subject.authorToothed whales.en_US
dc.description.funderContract number: N00244-10-10031.en_US
dc.identifier.oclcocn299768972
dc.identifier.npsreportNPS-OR-01-010


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record