Cooperative maneuver decision making for multi-UAV air combat based on incomplete information dynamic game

Cooperative autonomous air combat of multiple unmanned aerial vehicles(UAVs)is one of the main combat modes in future air warfare,which becomes even more complicated with highly changeable situation and uncertain information of the opponents.As such,this paper presents a cooperative decision-making method based on incomplete information dynamic game to generate maneuver strategies for multiple UAVs in air combat.Firstly,a cooperative situation assessment model is presented to measure the overall combat situation.Secondly,an incomplete information dynamic game model is proposed to model the dynamic process of air combat,and a dynamic Bayesian network is designed to infer the tactical intention of the opponent.Then a reinforcement learning framework based on multiagent deep deterministic policy gradient is established to obtain the perfect Bayes-Nash equilibrium solution of the air combat game model.Finally,a series of simulations are conducted to verify the effectiveness of the proposed method,and the simulation results show effective synergies and cooperative tactics.

UAV cooperative air combat maneuver decision based on multi-agent reinforcement learning

In order to improve the autonomous ability of unmanned aerial vehicles(UAV)to implement air combat mission,many artificial intelligence-based autonomous air combat maneuver decision-making studies have been carried out,but these studies are often aimed at individual decision-making in 1 v1 scenarios which rarely happen in actual air combat.Based on the research of the 1 v1 autonomous air combat maneuver decision,this paper builds a multi-UAV cooperative air combat maneuver decision model based on multi-agent reinforcement learning.Firstly,a bidirectional recurrent neural network(BRNN)is used to achieve communication between UAV individuals,and the multi-UAV cooperative air combat maneuver decision model under the actor-critic architecture is established.Secondly,through combining with target allocation and air combat situation assessment,the tactical goal of the formation is merged with the reinforcement learning goal of every UAV,and a cooperative tactical maneuver policy is generated.The simulation results prove that the multi-UAV cooperative air combat maneuver decision model established in this paper can obtain the cooperative maneuver policy through reinforcement learning,the cooperative maneuver policy can guide UAVs to obtain the overall situational advantage and defeat the opponents under tactical cooperation.

Extracting Decision Rules for Cooperative Team Air Combat Based on Rough Set Theory

In order to reduce redundant features in air combat information and to meet the requirements of real-time decision in combat, rough set theory is introduced to the tactical decision analysis in cooperative team air combat. An algorithm of attribute reduction for extracting key combat information and generating tactical rules from given air combat databases is presented. Then, considering the practical requirements of team combat, a method for reduction of attribute-values under single decision attribute is extended to the reduction under multi-decision attributes. Finally, the algorithm is verified with an example for tactical choices in team air combat. The results show that, the redundant attributes in air combat information can be reduced, and that the main combat attributes, i.e., the information about radar command and medium-range guided missile, can be obtained with the algorithm mentioned above, moreover, the minimal reduced strategy for tactical decision can be generated without losing the result of key information classification. The decision rules extracted agree with the real situation of team air combat.

A Multi-UCAV cooperative occupation method based on weapon engagement zones for beyond-visual-range air combat

Recent advances in on-board radar and missile capabilities,combined with individual payload limitations,have led to increased interest in the use of unmanned combat aerial vehicles(UCAVs)for cooperative occupation during beyond-visual-range(BVR)air combat.However,prior research on occupational decision-making in BVR air combat has mostly been limited to one-on-one scenarios.As such,this study presents a practical cooperative occupation decision-making methodology for use with multiple UCAVs.The weapon engagement zone(WEZ)and combat geometry were first used to develop an advantage function for situational assessment of one-on-one engagement.An encircling advantage function was then designed to represent the cooperation of UCAVs,thereby establishing a cooperative occupation model.The corresponding objective function was derived from the one-on-one engagement advantage function and the encircling advantage function.The resulting model exhibited similarities to a mixed-integer nonlinear programming(MINLP)problem.As such,an improved discrete particle swarm optimization(DPSO)algorithm was used to identify a solution.The occupation process was then converted into a formation switching task as part of the cooperative occupation model.A series of simulations were conducted to verify occupational solutions in varying situations,including two-on-two engagement.Simulated results showed these solutions varied with initial conditions and weighting coefficients.This occupation process,based on formation switching,effectively demonstrates the viability of the proposed technique.These cooperative occupation results could provide a theoretical framework for subsequent research in cooperative BVR air combat.

Task assignment under constraint of timing sequential for cooperative air combat

According to the previous achievement, the task assignment under the constraint of timing continuity for a cooperative air combat is studied. An extensive task assignment scenario with the background of the cooperative air combat is proposed. The utility and time of executing a task as well as the continuous combat ability are defined. The concept of the matching method of weapon and target is modified based on the analysis of the air combat scenario. The constraint framework is also redefined according to a new objective function. The constraints of timing and continuity are formulated with a new method, at the same time, the task assignment and integer programming models of the cooperative combat are established. Finally, the assignment problem is solved using the integrated linear programming software and the simulation shows that it is feasible to apply this modified model in the cooperative air combat for tasks cooperation and it is also efficient to optimize the resource assignment.

Target distribution in cooperative combat based on Bayesian optimization algorithm

Target distribution in cooperative combat is a difficult and emphases. We build up the optimization model according to the rule of fire distribution. We have researched on the optimization model with BOA. The BOA can estimate the joint probability distribution of the variables with Bayesian network, and the new candidate solutions also can be generated by the joint distribution. The simulation example verified that the method could be used to solve the complex question, the operation was quickly and the solution was best.

HEURISTIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR AIR COMBAT DECISION-MAKING ON CMTA

Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.

Cooperative Path Dynamic Planning Model of UCAV Team Based on Global Optimization Method

Cooperative path dynamic planning of a UCAV （unmanned combat air vehicle） team not only considers the capability of task requirement of single UCAV, but also considers the cooperative dynamic connection among members of the UCAV team. A cooperative path dynamic planning model of the UCAV team by applying a global optimization method is discussed in this paper and the corresponding model is built and analyzed. By the example simulation, the reasonable result acquired indicates that the model could meet dynamic planning demand under the circumstance of membership functions. The model is easy to be realized and has good practicability.

HEURISTIC QUANTUM GENETIC ALGORITHM FOR AIR COMBAT DECISION MAKING ON COOPERATIVE MULTIPLE TARGET ATTACK

In order to achieve the optimal attack outcome in the air combat under the beyond visual range(BVR)condition,the decision-making(DM)problem which is to set a proper assignment for the friendly fighters on the hostile fighters is the most crucial task for cooperative multiple target attack(CMTA).In this paper,a heuristic quantum genetic algorithm(HQGA)is proposed to solve the DM problem.The originality of our work can be supported in the following aspects:(1)the HQGA assigns all hostile fighters to every missile rather than fighters so that the HQGA can encode chromosomes with quantum bits(Q-bits);(2)the relative successful sequence probability(RSSP)is defined,based on which the priority attack vector is constructed;(3)the HQGA can heuristically modify quantum chromosomes according to modification technique proposed in this paper;(4)last but not the least,in some special conditions,the HQGA gets rid of the constraint described by other algorithms that to obtain a better result.In the end of this paper,two examples are illustrated to show that the HQGA has its own advantage over other algorithms when dealing with the DM problem in the context of CMTA.

有人/无人机协同空战研究进展综述

有人/无人机协同空战是未来空战的重要发展方向,有人机和无人机协同运用、优势互补,形成灵活高效的作战体系,将对未来空战效能的提升发挥巨大作用。首先,阐述了近年来美军作战概念的发展演进,分析了美军有人/无人机协同作战的相关项目发展,提炼总结了有人/无人机协同空战的特点;其次,以穿透性制空作战为场景,分析了有人/无人机协同空战的具体运用和作战流程;最后,从航迹规划、空战决策、编队控制3个方面对有人/无人机协同空战的关键技术和研究现状进行梳理和分析,并对未来有人/无人机协同空战的研究发展方向进行了总结和展望。

有人/无人机协同空战任务规划技术

随着“分布式作战”“马赛克战”等新型作战概念的提出,无人机作为新型空战力量,依靠其灵活性、机动性、互操作性和低廉的成本,有效地弥补了有人机在空战中的作战“盲区”,将其纳入现代空战的任务规划体系,与有人机协同配合执行空战任务,会对空战结果产生巨大的影响。研究了基于数据的空战离线任务规划技术和基于任务的空战在线任务规划技术,并基于OODA环对有人/无人机协同空战任务规划技术进行了综述,结合该技术在测试进程和实际作战应用中存在的不足,展望了该技术未来的发展趋势,对下一步开展有人/无人机协同空战任务规划研究提供借鉴参考。

Cooperative Threat Assessment of Multi-aircrafts Based on Synthetic Fuzzy Cognitive Map

Threat assessment is one of the most important parts of the tactical decisions,and it has a very important influence on task allocation.An application of fuzzy cognitive map(FCM) for target threat assessment in the air combat is introduced.Considering the fact that the aircrafts participated in the cooperation may not have the same threat assessment mechanism,two different FCM models are established.Using the method of combination,the model of cooperative threat assessment in air combat of multi-aircrafts is established.Simulation results show preliminarily that the method is reasonable and effective.Using FCM for threat assessment is feasible.

基于启发式蚁群算法的协同多目标攻击空战决策研究

协同多目标攻击空战决策是现代战机在超视距条件下进行协同空战的关键技术之一。它是寻求一个优化分配方案,将目标分配给各友机,力求使攻击效果最优。本文在对协同多目标攻击战术进行深入分析的基础上,提出了一种用于空战决策的启发式蚁群算法,该算法通过求解友机导弹对目标的最优分配来确定空战决策方案。仿真实验表明所提出的启发式蚁群算法对最优解的搜索效率明显优于基本蚁群算法,是一种求解协同多目标攻击空战决策问题的有效算法。

基于SAGA的协同多目标攻击决策

以超视距协同空战为背景,在对每个目标分配一枚导弹攻击的模式下,研究了协同多目标攻击空战决策问题.首先,基于对空战威胁态势的分析,将协同多目标攻击决策问题转化为导弹目标攻击分配的优化问题并建立其攻击效能评估模型.然后,提出将模拟退火遗传算法(SAGA)用于该问题的寻优,算法中个体采用整数编码,并采用非常规的交叉与变异操作产生新的个体.在进化结束后,通过最佳导弹目标分配个体求得最终协同攻击决策方案.仿真结果表明所提出的算法对最优分配方案的搜索效率明显优于单纯的遗传算法.

论协同空战及其关键技术

协同空战是随着现代战斗机、机载武器和航空Ｃ＾３Ｉ系统的发展而出现的，它交震惊各作战的基本样式。本文从战场实践和学术争鸣两个角度总结了协同空战的发展及国内外的研究情况，阐述了协同空战的几项关键技术，并介绍了在协同空战方面的一些研究工作和设想。

无人机协同多目标攻击空战决策研究

针对超视距空战中多架无人机对空中的多个敌对目标进行协同攻击的决策问题进行了研究。首先,对空战威胁态势进行了分析,基于对各攻击目标至少分配一枚导弹的原则,将协同多目标攻击决策问题转化为导弹目标攻击配对的优化问题并建立其攻击效能评估模型。然后,提出了一种模拟退火遗传算法用于该决策问题的寻优。最后,通过所得最佳导弹目标分配个体求得最终协同攻击决策方案。仿真结果表明所提出的算法能有效地求解协同多目标攻击决策问题,其对最优解的搜索效率明显优于单一的遗传算法。

群机协同空战中的多目标攻击决策模型研究

分析了群机协同空战中,多编队、多机分步协同作战的特点,提出分层递阶的协同多目标攻击决策模型,将问题分解为战役层兵力指派和战术层多目标分配决策,并分别设计了战役层和战术层的决策模型。建立了通用空战态势评估和能力评估模型,通过对战役层和战术层作战单元的抽象和评估模型参数的设置,可将该模型应用于两个不同层次。最后给出了仿真算例,验证了该模型的可用性和有效性。

多机空战仿真协同战术决策方法

首先介绍了多机空战协同战术决策的主要内容,然后提出了一种用以进行空战态势评估和威胁评估的方法——威胁指数法;在此基础上给出了目标分配的具体步骤以及火力分配模型;最后给出了具体仿真算例,计算结果表明,文中介绍的方法可以全面、有效地完成多机空战中的战术决策任务。

双机协作发射与制导中程空空导弹技术研究

针对信息化条件下双机协同空战的问题,研究了双机协作发射与制导主动雷达型中程空空导弹技术。提出了双机协作攻击的方式,通过数据链系统构建其作战体系。接着分析了其涉及的关键技术,包括高精度时空对准、统一制导坐标系建立、制导指令生成、延时信息补偿等,给出其初步解决方法。最后通过分析影响导引头雷达截获目标概率的主要因素,特别是角度截获概率,指出了提高协作发射与制导精度的主要途径。仿真试验表明了所提方案的有效性。

基于整数规划的多UCAV任务分配问题研究

在深入分析多UCAV任务分配问题的特点的基础上,提出了求解多UCAV协同任务分配的整数规划方法.通过设计决策变量和灵活地对各种约束条件形式化,建立了多UCAV任务分配问题的形式化模型.并以典型的UCAV任务SEAD为想定,进行了仿真验证与分析.仿真结果表明该模型可以较好地解决多UCAV协同作战的任务分配问题.*