NCW型模型中火力分配的优化
Optimizing fire allocation in a NCW-type model
摘要:
在本文中,我们引入了一个非线性Lanchester模型的NCW型,并研究了该模型的最优化问题,其中只有红色的力量是由几个供应代理。蓝方部队的最佳火力分配是以时间的分段常数函数的形式寻求的。在战斗的每个阶段开始时,计算红方部队及其每个补给人员的威胁率。这些比率可以用来推导出蓝方部队将火力集中于红方部队本身或其供应代理人之一的最佳决策。最后通过一个蓝方兵力最优化问题推导并证明了该最优火力分配方法。数值实验证明了理论结果。
英文摘要:
In this paper, we introduce a non-linear Lanchester model of NCW-type and investigate an optimization problem for this model, where only the Red force is supplied by several supply agents. Optimal fire allocation of the Blue force is sought in the form of a piece-wise constant function of time. A threatening rate is computed for the Red force and each of its supply agents at the beginning of each stage of the combat. These rates can be used to derive the optimal decision for the Blue force to focus its firepower to the Red force itself or one of its supply agents. This optimal fire allocation is derived and proved by considering an optimization problem of number of Blue force troops. Numerical experiments are included to demonstrate the theoretical results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。