Kill web is an important combat means to achieve accurate, efficient, agile and reliable damage to enemy targets through networking and coordination of weapons. Aiming at the current situation that the research of kill web is limited to top-level design, a set of methods for the modeling and deployment of kill web is proposed. Under the premise that the nodes of the command & control (C2) layer undertake the decision and planning of the other layers, the reconnaissance area coverage problem is decomposed into the sensor deployment problem (SDP) and the travelling salesman problem (TSP). After using genetic algorithm to optimize them, the deployment of reconnaissance nodes is completed. Then the minimum spanning tree (MST) of the communication network is generated by the improved Prim method to avoid the waste of resources and redundant paths. Finally, A-star algorithm is used to plan the path to the target discovered by the reconnaissance node. The feasibility of this deployment method is verified by simulation.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Method for Modeling and Deploying Kill Web

  • Pei Chi,
  • Chen Liu,
  • Jiang Zhao,
  • Kun Wu,
  • Yingxun Wang

摘要

Kill web is an important combat means to achieve accurate, efficient, agile and reliable damage to enemy targets through networking and coordination of weapons. Aiming at the current situation that the research of kill web is limited to top-level design, a set of methods for the modeling and deployment of kill web is proposed. Under the premise that the nodes of the command & control (C2) layer undertake the decision and planning of the other layers, the reconnaissance area coverage problem is decomposed into the sensor deployment problem (SDP) and the travelling salesman problem (TSP). After using genetic algorithm to optimize them, the deployment of reconnaissance nodes is completed. Then the minimum spanning tree (MST) of the communication network is generated by the improved Prim method to avoid the waste of resources and redundant paths. Finally, A-star algorithm is used to plan the path to the target discovered by the reconnaissance node. The feasibility of this deployment method is verified by simulation.