North Carolina State University Team (NCSU): Joint Forces Air Component Command (JFACC) Experiment
Abstract
The Command and Control (C2) problem for Military Air Operations is addressed. The problem is viewed as a stochastic game. Due to the large size of the problem, several techniques are used to decompose the problem into manageable pieces. At the outermost level, hierarchical techniques are used to solve progressively larger problems where the distributions of outcomes at one level become the dynamics of the problem at the next higher level. At the lowest level, the problem may consist of a few aircraft (or possibly packages), less than say a half-dozen, enemy SAMs, a few enemy assets (viewed as targets from our standpoint), and some enemy decoys (assumed to mimic SAM radar signatures). At this low level, some minimal cost (to our aircraft) routes to the eventual targets are mapped out, and these are used to determine SAM sites (possibly decoys) that are unavoidable. One then employs a discrete stochastic game problem formulation to determine which of these SAMs should optimally be engaged, and by what series of aircraft operations. Since this in a game model, the optimal opponent strategy is also determined. The problem of imperfect information is addressed. The technique also allows the evaluation of various approaches in terms of expected cost and the variance of cost. One may plot these as functions of various parameters to determine when the situation is at a point where the optimal strategies may jump out suddenly.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 2002
- Accession Number
- ADA408264
Entities
People
- Ben Fitzpatrick
- Istvan Lauko
- Kazufumi Ito
- Quing Zhang
- William M. McEneaney
Organizations
- North Carolina State University