An optimal dynamic threat evaluation and weapon scheduling technique

作者:

Highlights:

摘要

Real time scheduling problems demand high level of flexibility and robustness under complex dynamic scenarios. Threat Evaluation (TE) and Weapon Assignment (WA), together TEWA is one such complex dynamic system that has optimal or near optimal utilization of scarce defensive resources, a supreme priority. Several static solutions of TEWA have been proposed. This paper discusses an optimal dynamic multi-air threat evaluation and weapon allocation algorithm using a variant of Stable Marriage Algorithm (SMA). WA uses a new dynamic weapon scheduling algorithm, allowing multiple engagements using shoot-look-shoot strategy, to compute near-optimal solution. For optimality different types of constraints are identified and defined. Testing part of this paper shows feasibility of this approach for a range of scenarios.

论文关键词:Real time scheduling problems,Job shop scheduling,Defended asset based weapon allocation,Stable marriage algorithm in weapon allocation,Threat evaluation and weapon assignment using stable marriage algorithm

论文评审过程:Available online 24 November 2009.

论文官网地址:https://doi.org/10.1016/j.knosys.2009.11.012