DocumentCode
3414931
Title
Optimization based battle management
Author
Daniel-Berhe, Sequare ; Ait-Rami, Mustapha ; Shamma, Jeff S. ; Speyer, Jason L.
Author_Institution
Dept. of Mech. Aerosp. Eng., California Univ., Los Angeles, CA, USA
Volume
6
fYear
2001
fDate
2001
Firstpage
4711
Abstract
This paper considers an optimization based approach to battle management. The framework consists of two opposing forces of various resources subject to attrition and evolving over an arena of sectors. The resulting model is a large scale linear flow subject to various positivity constraints. It can be shown that when resource mobility constraints and attrition losses are taken into account, the problem of finding optimal tactics is computationally intractable. We will pursue an alternative approach that allows the use of linear programming in conjunction with receding horizon control. The main idea is to derive model simplifications that alleviate the computational burden while providing suitable tactics
Keywords
computational complexity; linear programming; military systems; model reference adaptive control systems; predictive control; LP; attrition; computational burden; computationally intractable problem; large-scale linear flow; linear programming; optimal tactics; optimization based battle management; positivity constraints; receding horizon control; Aerospace engineering; Computational intelligence; Engineering management; Large-scale systems; Linear programming; Mathematical model; Military computing; Nonlinear dynamical systems; Optimal control; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference, 2001. Proceedings of the 2001
Conference_Location
Arlington, VA
ISSN
0743-1619
Print_ISBN
0-7803-6495-3
Type
conf
DOI
10.1109/ACC.2001.945726
Filename
945726
Link To Document