论文部分内容阅读
在实际的作战问题分析中,往往需要通过仿真实验的方式,获得一个能够达到某一目标的需求空间。为此需要将实验中的每个能力指标都离散化为有限个水平值,在一定需求约束的条件下,探索出所有符合需求的策略组合。这种方法需穷举所有组合,从而引起组合爆炸而难以计算。为解决此问题,基于能力指标的单调性,提出了一种高效探索离散能力需求空间的算法;以高炮武器系统为例,建立了高炮武器系统抗击空中目标的仿真模型,并运用该算法实现了对高炮武器系统离散能力需求空间的高效探索;通过对计算结果的分析,验证了算法的正确性和高效性。
In the actual analysis of operational problems, it is often necessary to obtain a demand-side space for achieving a certain goal through simulation experiments. For this purpose, each capability index in the experiment needs to be discretized into a finite number of levels, and under the condition of certain demand constraints, all the strategy combinations that meet the requirements are explored. This method requires exhaustive combination of all, resulting in a combination of explosions and difficult to calculate. In order to solve this problem, based on the monotonicity of capability index, an efficient algorithm for exploring the demand space of discrete capability was proposed. Taking the high-gun weapon system as an example, a simulation model of the antiaircraft artillery weapon system against airborne targets was established. And realized the efficient exploration of space requirements for the artillery weapon system’s discrete capability. The correctness and high efficiency of the algorithm were verified through the analysis of the calculated results.