基于最小代价流算法的多机空战目标分配  

Target Assignment of Multi-fighter Combat Based on Minimum Cost Flow Algorithm

作　　者：阴小晖[1] 董彦非[1] 彭世冲[1] 

机构地区：[1]南昌航空大学飞行器工程学院,南昌330063

出　　处：《计算机系统应用》2013年第10期119-123,共5页Computer Systems & Applications

基　　金：航空科学基金(2011ZA56001);江西省研究生创新专项基金(YC2011-S096)

摘　　要：目标分配是多机空战协同战术决策的核心内容之一,属于资源分配以及最优指派问题,符合最小代价流算法的求解范畴.在空战态势评估和综合威胁评估模型的基础上,建立了最小代价流空战目标分配模型.该模型根据威胁评估结果,用最小代价流算法进行处理,找出带代价的网络流图中从起点到终点的一条最短路,经反复迭代,直至找到所求的最小代价流,实现对多个空战目标进行合理分配.最后通过算例验证了模型的可行性.The target allocation is one of the core content of the collaborative tactical decision of multiple-plane air combat, belonging to the allocation of resources as well as the optimal assignment problem, in line with the minimum cost flow algorithm for solving field. Based on combat situation assessment and comprehensive threat assessment model, a minimum cost flow target assignment model is established. The model is based on the threat assessment results, with the minimum cost flow algorithm processing, finding out the shortest path from the starting point to the end point of a network flow graph, after repeating iteration, until finding the minimum cost flow, multiple-air-combat target is achieved to reasonable allocation. Finally, an example is presented to verify the feasibility of the model.

关 键 词：态势评估 威胁评估 最小代价流算法 目标分配 

分 类 号：V271.41[航空宇航科学与技术—飞行器设计]