动态**目标分配(DWTA)是现代指控系统亟待解决的重要理论问题, 由于时间因素和随机事件的影响, 使得解决该问题的复杂程度进一步增加。在介绍DWTA问题研究基本内容的基础上, 重点归纳和分析了目前解决DWTA问题的一系列方法, 包括分阶段求解法、马尔可夫决策过程及anytime算法等, 提出了现阶段对于DWTA问题研究的不足和未来尚需解决的问题, 并指出在充分考虑时空约束的基础上, 寻求一种具有任意时间特性且能灵活处理随机事件的智能算法是解决DWTA问题的有效途径。

Dynamic Weapon Target Assignment (DWTA) is a vital problem for modern C2 system. The influences of time and stochastic events increase the complexity of DWTA. Some basic concepts of DWTA are introduced, and then a series of methods for solving the problem of DWTA are summarized and analyzed, such as two-stage solution, Markov decision processes, and “anytime” algorithms etc. The current research deficiencies are proposed, and some unsolved issues are indicated. It is put forward that to solve DWTA problem, the restriction of time and space should be fully considered, and an intelligent algorithm with the characteristic of anytime should be selected to deal with stochastic events flexibly.