Modeling and analysis of air campaign resource allocation: a spatio-temporal decomposition approach

In this paper, we address the modeling and analysis issues associated with a generic theater level campaign where two adversaries pit their military resources against each other over a sequence of multiple engagements. In particular, we consider the scenario of an air raid campaign where one adversary uses suppression of enemy air defense (SEAD) aircraft and bombers (BMBs) against the other adversary's invading ground troops (GTs) that are defended by their mobile air defense (AD) units. The original problem is decomposed into a temporal and a spatial resource allocation problem. The temporal resource allocation problem is formulated and solved in a game-theoretical framework as a multiple resource interaction problem with linear attrition functions. The spatial resource allocation problem is posed as a risk minimization problem in which the optimal corridor of ingress and optimal movement of the GTs and AD units are decided by the adversaries. These two solutions are integrated using an aggregation/deaggregation approach to evaluate resource strengths and distribute losses. Several simulation experiments were carried out to demonstrate the main ideas.

[1]  Robert M. MacGregor,et al.  Building and (re)using an ontology of air campaign planning , 1999, IEEE Intell. Syst..

[2]  Jerome Bracken,et al.  Defense Applications of Mathematical Programs with Optimization Problems in the Constraints , 1974, Oper. Res..

[3]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[4]  F. T. Case,et al.  Analysis of air operations during DESERT SHIELD and DESERT STORM , 1995 .

[5]  David Blackwell,et al.  On multi-component attrition games , 1954 .

[6]  D. Blackwell.  An analog of the minimax theorem for vector payoffs. , 1956 .

[7]  Steven Vajda,et al.  Games and Decisions. By R. Duncan Luce and Howard Raiffa. Pp. xi, 509. 70s. 1957. (J Wiley & Sons) , 1959, The Mathematical Gazette.

[8]  Richard Hillestad,et al.  Modeling for campaign analysis , 1996 .

[9]  Debasish Ghose,et al.  Game theoretic campaign modeling and analysis , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[11]  Paul K. Davis,et al.  Experiments In Multiresolution Modeling (MRM) , 1998 .

[12]  Gil Tidhar,et al.  Flying Together: Modelling Air Mission Teams , 1998, Applied Intelligence.

[13]  Gregory S. Parnell,et al.  An Air Mission Planning Algorithm Using Decision Analysis and Mixed Integer Programming , 1997, Oper. Res..

[14]  David A. Shlapak,et al.  Perspectives on Theater Air Campaign Planning , 1995 .

[15]  Melvin Dresher,et al.  A Game Theory Analysis of Tactical Air War , 1959 .

[16]  David R. Vaughan,et al.  Capturing the Essential Factors in Reconnaissance and Surveillance Force Sizing and Mix , 1998 .

[17]  Debasish Ghose,et al.  A Game Theoretical Multiple Resource Interaction Approach to Resource Allocation in an Air Campaign , 2002, Ann. Oper. Res..

[18]  Nicos Christofides,et al.  An efficient implementation of an algorithm for finding K shortest simple paths , 1999, Networks.

[19]  Louis R. Moore,et al.  The Theater-Level Campaign Model: A Research Prototype for a New Generation of Combat Analysis Model , 1997 .

[20]  K Fan,et al.  Minimax Theorems. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[21]  Debasish Ghose,et al.  Missile battery placement for air defense: A dynamic programming approach , 1993 .

[22]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[23]  Melvin Dresher,et al.  Allocation of Two Types of Aircraft in Tactical Air War , 1959 .

[24]  Debasish Ghose,et al.  Theater level campaign resource allocation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[25]  Ming Li,et al.  Game-theoretic modeling and control of a military air operation , 2001 .

[26]  D. R. Fulkerson,et al.  A Tactical Air Game , 1957 .