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

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

作　　者：吴玲[1] 卢发兴[1] 

机构地区：[1]海军工程大学电子工程学院,武汉430033

出　　处：《武汉理工大学学报》2010年第6期140-143,共4页Journal of Wuhan University of Technology

摘　　要：由于动态武器目标分配(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.

关 键 词：动态武器目标分配 截止期 ANYTIME算法 元级控制 

分 类 号：TP1[自动化与计算机技术—控制理论与控制工程]