离散单调能力需求空间探索生成算法

Exploring Algorithm for Producing Discrete Monotonic-Capability-Metric Requirement Space

在实际的作战问题分析中,往往需要通过仿真实验的方式,获得一个能够达到某一目标的需求空间。为此需要将实验中的每个能力指标都离散化为有限个水平值,在一定需求约束的条件下,探索出所有符合需求的策略组合。这种方法需穷举所有组合,从而引起组合爆炸而难以计算。为解决此问题,基于能力指标的单调性,提出了一种高效探索离散能力需求空间的算法;以高炮武器系统为例,建立了高炮武器系统抗击空中目标的仿真模型,并运用该算法实现了对高炮武器系统离散能力需求空间的高效探索;通过对计算结果的分析,验证了算法的正确性和高效性。

In the analysis of some practical operational problems, it is necessary to do some simulation experiments to obtain a capability requirements space meeting some requirements. Generally, every capability indices in experiments should be divided into several segments and combined with each other. Therefore it is very difficult to finish the experiment calculation because of combining explosion. In order to solve this question, an algorithm, based on the monotony of capability indices, was put forward to improve the efficiency of exploring the discrete capability requirement space. An example of artillery weapon system, the simulation model of artillery weapon system attacking aerial target was constructed, and by using this algorithm, the high-efficiency exploring of the discrete requirement space of artillery weapon system was realized. The analyzing results show the validity and the high-efficiency of this algorithm.