WTA问题的截止期定义及Anytime算法分析

Analysis of Deadlines and Anytime Algorithms for Weapon-target Allocation Problem

由于动态武器目标分配(WTA)过程中的不确定性和不可预测性,在分配过程中可能需要根据发生的随机事件随时产生分配决策,动态WTA算法应具备Anytime特性。文中将WTA过程作为实时问题,定义了几类不同级别的截止期,分析了目前一些WTA算法的Anytime特性,并提出控制算法行止的元级控制的基本策略。

Owing to the uncertainty and unpredictability in the process of the dynamic weapon-target allocation（WTA）,the decision of allocation should be made at anytime when required,which requires the anytime property of the algorithms for WTA problem.In the paper,the WTA problem is investigated as a real time process and three kinds of deadlines with different priorities are defined.The anytime characteristic of the existing algorithms for WTA problem is examined.The meta-level control strategy for the anytime algorithm that control the running of the algorithm is discussed.