Optimization based battle management

Sequare Daniel-Berhe; Mustapha Ait-Rami; Jeff S. Shamma; Jason L. Speyer

doi:10.1109/ACC.2001.945726

Optimization based battle management

Sequare Daniel-Berhe, Mustapha Ait-Rami, Jeff S. Shamma, Jason L. Speyer

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

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.

Original language	English (US)
Pages (from-to)	4711-4715
Number of pages	5
Journal	Proceedings of the American Control Conference
Volume	6
DOIs	https://doi.org/10.1109/ACC.2001.945726
State	Published - 2001
Externally published	Yes

Keywords

Battle planning
Battlefield model
Linear programming
Optimization
Receding horizon control

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/ACC.2001.945726

Cite this

@article{07105e5592d94b869a1bf610030eb732,

title = "Optimization based battle management",

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 = "Battle planning, Battlefield model, Linear programming, Optimization, Receding horizon control",

author = "Sequare Daniel-Berhe and Mustapha Ait-Rami and Shamma, {Jeff S.} and Speyer, {Jason L.}",

year = "2001",

doi = "10.1109/ACC.2001.945726",

language = "English (US)",

volume = "6",

pages = "4711--4715",

journal = "Proceedings of the American Control Conference",

issn = "0743-1619",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Optimization based battle management

AU - Daniel-Berhe, Sequare

AU - Ait-Rami, Mustapha

AU - Shamma, Jeff S.

AU - Speyer, Jason L.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - Battle planning

KW - Battlefield model

KW - Linear programming

KW - Optimization

KW - Receding horizon control

UR - http://www.scopus.com/inward/record.url?scp=0034853941&partnerID=8YFLogxK

U2 - 10.1109/ACC.2001.945726

DO - 10.1109/ACC.2001.945726

M3 - Article

AN - SCOPUS:0034853941

SN - 0743-1619

VL - 6

SP - 4711

EP - 4715

JO - Proceedings of the American Control Conference

JF - Proceedings of the American Control Conference

ER -

Optimization based battle management

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this