2004
DOI: 10.1287/opre.1030.0086
|View full text |Cite
|
Sign up to set email alerts
|

Shoot-Look-Shoot: A Review and Extension

Abstract: We consider the optimal use of information in shooting at a collection of targets, generally with the object of maximizing the average number (or value) of targets killed. The shooting problem is viewed as a Markov decision process, and the modal solution technique is stochastic dynamic programming. Information obtained about target status may or may not be perfect, and there may or may not be constraints on the number of shots. Previous results are reviewed, and some new results are obtained.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 41 publications
(23 citation statements)
references
References 17 publications
0
23
0
Order By: Relevance
“…The framework we consider is common to military weapon target engagements (Aviv & Kress, 1997;Kisi, 1976;Mastran & Thomas, 1973), shooting problems (Glazebrook & Washburn, 2004;Sato, 1997a), cybersecurity (Gao, Zhong, & Mei, 2013;Hu, Xu, Xu, & Zhao, 2017), attacker-defender games (Levitin & Hausken, 2012), and more broadly to stochastic sequential resource allocation (Sato, 1996(Sato, , 1997b. In sequential assignment problems of the kind considered herein, the decision rule usually takes the form, attack the target iff its value is no less than a certain threshold c, where the optimal c is to be determined.…”
Section: Prior Workmentioning
confidence: 99%
“…The framework we consider is common to military weapon target engagements (Aviv & Kress, 1997;Kisi, 1976;Mastran & Thomas, 1973), shooting problems (Glazebrook & Washburn, 2004;Sato, 1997a), cybersecurity (Gao, Zhong, & Mei, 2013;Hu, Xu, Xu, & Zhao, 2017), attacker-defender games (Levitin & Hausken, 2012), and more broadly to stochastic sequential resource allocation (Sato, 1996(Sato, , 1997b. In sequential assignment problems of the kind considered herein, the decision rule usually takes the form, attack the target iff its value is no less than a certain threshold c, where the optimal c is to be determined.…”
Section: Prior Workmentioning
confidence: 99%
“…Thus, SAM systems do not shoot against each ASM until the previous shot has completed. Refer to Glazebrook and Washburn () for a comprehensive review and extension on SLS policy and Karasakal, Özdemirel, et al () Section 5.3 for adaptation of SLS policy to variants such as shoot‐shoot‐look‐shoot‐shoot policy. Figure shows a schematic of the time slots, time horizon, and the starting time of the slots.…”
Section: Description Of the Problem And The Modelmentioning
confidence: 99%
“…Manor and Kress (1997) investigate the optimality of greedy shooting in the presence of incomplete damage information. Glazebrook, Kirkbride, Mitchell, Gaver, and Jacobs (2007) and Glazebrook and Washburn (2004) investigate policies for shooting problems to maximize the expected number of targets killed.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Recently, Glazebrook and Washburn (2004) have discussed the utilisation of the multiarmed bandit framework and the associated index policies to develop optimal shooting policies in a military environment. Here the "key resource" is a single shooter (Red) and the "projects" form a fixed collection of targets (Blue).…”
Section: Introductionmentioning
confidence: 99%