Target Assignment of Multi-fighter Combat Based on Minimum Cost Flow Algorithm
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation

阴小晖,董彦非,彭世冲.基于最小代价流算法的多机空战目标分配.计算机系统应用,2013,22(10):119-123

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 22,2013
  • Revised:April 11,2013
  • Adopted:
  • Online: October 18,2013
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063