摘要
为解决智能体分队的目标攻击选择问题,文中对作战模型中的多武器目标分配(WTA)问题进行了研究,介绍了WTA问题的基本概念、基本模型、数学性质以及WTA问题研究的基本内容。在模型研究方面,对动态武器目标分配问题建立了迭代规划模型,该模型的优点在于克服了静态WTA模型中部分武器因为时间因素的限制,在作战中不能参与分配的缺点。在算法研究方面,以匈牙利算法对指派问题求解为基础,对动态迭代规划模型进行了求解。最后,通过案例的分析,验证了模型和算法在求解WTA问题的有效性。
To solve the problem of weapon target assignment （WTA） in the combat agent unit, the model of iterative programming was studied. However,there have been no effective algorithms to solve the optimal policies of such large - scale problems by now. The model of iterative programming compared with static WTA model , this model overomes the disadvantage that some weapons couldn＇ t he assigned as time changing. Dynamic iterative programming,which based on the Hungarian- Algorithm,was used to solve the model. Finally, an example was used to illustrate and validate the efficiency of the model and algorithms.
出处
《计算机技术与发展》
2009年第12期150-153,共4页
Computer Technology and Development
基金
军队预研计划项目(编号:略)
关键词
多智能体
攻击行为模型
作战仿真
0—1规划
multi-agent
attacking behavior model
combat simulation
0-1 programming
