摘要
坦克分队作战中,攻防双方多辆坦克的火力对抗涉及到火力分配,这时每辆坦克往往向威胁自身最大的目标开火,但这种目标选择的整体效果并不是最优的。由于最优火力分配是整数规划问题,当坦克分队中坦克数量较大时,求解最优的火力分配存在时间长和计算复杂等问题。因此在作战仿真或者指挥自动化系统中,对于这一问题多采用次优算法处理。该文提出一种最近邻目标选择优化算法,使得最大限度地减轻了对方对己方(坦克分队)的威胁,从而提高了坦克作战效能。
In the tank warfare, attacking and defending groups may meet with each other. Each tank will fire at the tank which greatly threatens itself, but the result may not be optimal as a whole. Because the optimal firepower assignment is a typical integral programming problem, when the number of tank is larger, the optimal assignment resolution will take time and computing complexity. So, in combat simulation and C3I, this problem often uses sub -optimal algorithm. A nearest neighbor optimal algorithm for the target selection in the tank warfare is proposed to minimize the enemy' s whole threat. The result of the model may improve the combat effectiveness of the tank.
出处
《计算机仿真》
CSCD
2005年第6期65-67,共3页
Computer Simulation
关键词
模型
优化
坦克作战
目标选择
Model
Optimize
Tank war
Target selection
