Suppression of enemy air defenses (SEAD) as an information duel

Barkdoll, Timothy C.; Gaver, Donald P.; Glazebrook, K. D.; Jacobs, Patricia A.; Posadas, Sergio

doi:10.1002/nav.10046

Cited by 16 publications

(12 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, Glazebrook et al (2001) consider a two-sided problem where each bandit is an attacker of unknown type, and where the defending marksman's problem is to decide which bandit to shoot at next, given that the bandit will return fire if not killed. Barkdoll et al (2002) consider a related problem in suppression of enemy air defenses (SEAD) where the decision maker is the enemy air defense supposedly being suppressed. The marksman must not only decide which bandit (i.e., attacker) to shoot at next, but also how his engagement radar should operate in support of the shot, whether in continuous or intermittent mode.…”

Section: Applicability Of Bandit Processesmentioning

confidence: 99%

“…This additional feature formally takes the decision process out of the class for which index strategies are known to be optimal. Even so, Barkdoll et al (2002) propose an index-based heuristic for their shooting problem that performs well in numerical experiments. See Glazebrook and Fay (1990) for a theoretical discussion of such developments in bandit problems.…”

Section: Applicability Of Bandit Processesmentioning

confidence: 99%

See 1 more Smart Citation

Shoot-Look-Shoot: A Review and Extension

Glazebrook

Washburn

2004

Operations Research

View full text Add to dashboard Cite

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.

show abstract

Section: Applicability Of Bandit Processesmentioning

confidence: 99%

Section: Applicability Of Bandit Processesmentioning

confidence: 99%

Shoot-Look-Shoot: A Review and Extension

Glazebrook

Washburn

2004

Operations Research

View full text Add to dashboard Cite

show abstract

“…Consider a military scenario discussed by Barkdoll et al (2002) which is asymmetric between enemy forces. Blue has established air superiority in some region and Red is a surface-to-air missile system (SAM) seeking to disrupt Blue's air campaign.…”

Section: Introductionmentioning

confidence: 99%

“…A U.S. Marine Corps Warfighting Publication (2001) gives a background summary of SEAD operations. In Barkdoll et al (2002) every Red shot exposes her to danger from a stand-off Blue shooter. Red attaches a value to every Blue she faces which could, for example, reflect the damage which would be caused should that Blue penetrate her defences.…”

Section: Introductionmentioning

confidence: 99%

Index Policies for Shooting Problems

Glazebrook¹,

Kirkbride²,

Mitchell³

et al. 2006

View full text Add to dashboard Cite

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, ABSTRACT (maximum 200 words)We consider a scenario in which a single Red wishes to shoot at a collection of Blue targets, one at a time, to maximise some measure of return obtained from Blues killed before Red's own (possible) demise. Such a situation arises in various military contexts such as the conduct of air defence by Red in the face of Blue SEAD (suppression of enemy air defences). A class of decision processes called multi-armed bandits has been previously deployed to develop optimal policies for Red in which she attaches a calibrating (Gittins) index to each Blue target and optimally shoots next at the Blue with largest index value. The current paper seeks to elucidate how a range of developments of index theory are able to accommodate features of such problems which are of practical military import. Such features include levels of risk to Red which are policy dependent, Red having imperfect information about the Blues she faces, an evolving population of Blue targets and the possibility of Red disengagement. The paper concludes with a numerical study which both compares the performance of (optimal) index policies to a range of competitors and also demonstrates the value to Red of (optimal) disengagement. NUMBER OF PAGES 2714. SUBJECT TERMS multi-armed bandits, Gitten Indices, suppression of enemy air defense PRICE CODE SECURITY CLASSIFICATION OF REPORT Unclassified SECURITY CLASSIFICATION OF THIS PAGE Unclassified SECURITY CLASSIFICATION OF ABSTRACT Unclassified LIMITATION OF ABSTRACT UL iiIndex policies for shooting problems AbstractWe consider a scenario in which a single Red wishes to shoot at a collection of Blue targets, one at a time, to maximise some measure of return obtained from Blues killed before Red's own (possible) demise. Such a situation arises in various military contexts such as the conduct of air defence by Red in the face of Blue SEAD (suppression of enemy air defences). A class of decision processes called multi-armed bandits has been previously deployed to develop optimal policies for Red in which she attaches a calibrating (Gittins) index to each Blue target and optimally shoots next at the Blue with largest index value. The current paper seeks to elucidate how a range of developments of index theory are able to accommodate features of such problems which are of practical military import. Such features include levels of risk to Red which are policy dependent, Red having imperfect information about the Blues she faces, an evolving population of Blue targets and the possibility of Red disengagement. The paper concludes with a numerical study which both c...

show abstract

“…In even semiautomated mode, operators' input is used in computerized decision support system (Roux and Vuuren, 2007). Most of the time, there are critical instances where rapid decisions are required for effective neutralization of threats and protection of vulnerable areas or vulnerable points (VA/VPs) (Barkdoll et al, 2002), which makes the task of operators extremely important primarily because efficient weapon selection highly depends upon observer's input (Allouche, 2005). In these decisive situations, inevitably momentous pressure develops on the mind of observer that may disturb the TE process.…”

Section: Introductionmentioning

confidence: 99%

A real-time man-in-loop threat evaluation and resource assignment in defense

Naseem

Khan

Malik

2017

Journal of the Operational Research Society

View full text Add to dashboard Cite

Efficient weapon threat assignment reflects military proficiency and requires prompt decision while managing the available resources. An important problem which commanders/decision makers face is to optimally utilize the resources in complex and time constraints situations. Several solutions have been proposed in the literature. In this paper, an innovative approach is proposed for threat evaluation and weapon assignment (TEWA) by following 3-dimensional stable marriage algorithm (3-D SMA). This proposed model incorporates new parameters and constraints i.e. supply chain, inventory of resources and multiple threats-weapons assignments that outperforms the previous techniques. This suggested model is based on threat perception followed by an integration of parametric based automatic threat evaluation technique for further weapon scheduling and assignment problem keeping in view that the threat with greater threat index has higher priority to be intercepted and weapons' kill probability. The experimental section shows that our proposed approach has greatly improved in comparison with other approaches. The results showed that the threat neutralization is improved up to 25% reducing the usage of ammunition till 31.1%. The damage of assets abridged to 28.5% in comparison with existing approaches. The proposed approach elucidates that TEWA is an efficient real-time threat perception and optimal multi-threat scheduling problem at weapons' resolution. It is a three-stage process, where the first stage perceives the threat, the second stage works on threat evaluation and the final stage focuses on weapon scheduling and assignment problem. The addition of new parameters and constraints in the new proposed model makes it a unique approach in which more accurate results, in neutralizing the threats, are obtained with less use of ammunition and damage of assets that makes TEWA more effective and efficient tool for optimum decision making in time critical situations.

show abstract

Suppression of enemy air defenses (SEAD) as an information duel

Cited by 16 publications

References 7 publications

Shoot-Look-Shoot: A Review and Extension

Shoot-Look-Shoot: A Review and Extension

Index Policies for Shooting Problems

A real-time man-in-loop threat evaluation and resource assignment in defense

Contact Info

Product

Resources

About