Share Email Print
cover

Proceedings Paper

Near-Nash targeting strategies for heterogeneous teams of autonomous combat vehicles
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Military strategists are currently seeking methodologies to control large numbers of autonomous assets. Automated planners based upon the Nash equilibrium concept in non-zero sum games are one option. Because such planners inherently consider possible adversarial actions, assets are able to adapt to, and to some extent predict, potential enemy actions. However, these planners must function properly both in cases in which a pure Nash strategy does not exist and in scenarios possessing multiple Nash equilibria. Another issue that needs to be overcome is the scalability of the Nash equilibrium. That is, as the dimensionality of the problem increases, the Nash strategies become unfeasible to compute using traditional methodologies. In this paper we introduce the concept of near-Nash strategies as a mechanism to overcome these difficulties. We then illustrate this concept by deriving the near-Nash strategies and using these strategies as the basis for an intelligent battle plan for heterogeneous teams of autonomous combat air vehicles in the Multi-Team Dynamic Weapon Target Assignment model.

Paper Details

Date Published: 22 April 2008
PDF: 10 pages
Proc. SPIE 6962, Unmanned Systems Technology X, 69620X (22 April 2008); doi: 10.1117/12.782108
Show Author Affiliations
David G. Galati, Carnegie Mellon Univ. (United States)
Marwan A. Simaan, Univ. of Pittsburgh (United States)


Published in SPIE Proceedings Vol. 6962:
Unmanned Systems Technology X
Grant R. Gerhart; Douglas W. Gage; Charles M. Shoemaker, Editor(s)

© SPIE. Terms of Use
Back to Top