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 opt...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.展开更多
Game theory can be applied to the air combat decision-making problem of multiple unmanned combat air vehicles(UCAVs).However,it is difficult to have satisfactory decision-making results completely relying on air comba...Game theory can be applied to the air combat decision-making problem of multiple unmanned combat air vehicles(UCAVs).However,it is difficult to have satisfactory decision-making results completely relying on air combat situation information,because there is a lot of time-sensitive information in a complex air combat environment.In this paper,a constraint strategy game approach is developed to generate intelligent decision-making for multiple UCAVs in complex air combat environment with air combat situation information and time-sensitive information.Initially,a constraint strategy game is employed to model attack-defense decision-making problem in complex air combat environment.Then,an algorithm is proposed for solving the constraint strategy game based on linear programming and linear inequality(CSG-LL).Finally,an example is given to illustrate the effectiveness of the proposed approach.展开更多
Reinforcement learning has been applied to air combat problems in recent years,and the idea of curriculum learning is often used for reinforcement learning,but traditional curriculum learning suffers from the problem ...Reinforcement learning has been applied to air combat problems in recent years,and the idea of curriculum learning is often used for reinforcement learning,but traditional curriculum learning suffers from the problem of plasticity loss in neural networks.Plasticity loss is the difficulty of learning new knowledge after the network has converged.To this end,we propose a motivational curriculum learning distributed proximal policy optimization(MCLDPPO)algorithm,through which trained agents can significantly outperform the predictive game tree and mainstream reinforcement learning methods.The motivational curriculum learning is designed to help the agent gradually improve its combat ability by observing the agent's unsatisfactory performance and providing appropriate rewards as a guide.Furthermore,a complete tactical maneuver is encapsulated based on the existing air combat knowledge,and through the flexible use of these maneuvers,some tactics beyond human knowledge can be realized.In addition,we designed an interruption mechanism for the agent to increase the frequency of decisionmaking when the agent faces an emergency.When the number of threats received by the agent changes,the current action is interrupted in order to reacquire observations and make decisions again.Using the interruption mechanism can significantly improve the performance of the agent.To simulate actual air combat better,we use digital twin technology to simulate real air battles and propose a parallel battlefield mechanism that can run multiple simulation environments simultaneously,effectively improving data throughput.The experimental results demonstrate that the agent can fully utilize the situational information to make reasonable decisions and provide tactical adaptation in the air combat,verifying the effectiveness of the algorithmic framework proposed in this paper.展开更多
A decision-making problem of missile-target assignment with a novel particle swarm optimization algorithm is proposed when it comes to a multiple target collaborative combat situation.The threat function is establishe...A decision-making problem of missile-target assignment with a novel particle swarm optimization algorithm is proposed when it comes to a multiple target collaborative combat situation.The threat function is established to describe air combat situation.Optimization function is used to find an optimal missile-target assignment.An improved particle swarm optimization algorithm is utilized to figure out the optimization function with less parameters,which is based on the adaptive random learning approach.According to the coordinated attack tactics,there are some adjustments to the assignment.Simulation example results show that it is an effective algorithm to handle with the decision-making problem of the missile-target assignment(MTA)in air combat.展开更多
In the air combat process,confrontation position is the critical factor to determine the confrontation situation,attack effect and escape probability of UAVs.Therefore,selecting the optimal confrontation position beco...In the air combat process,confrontation position is the critical factor to determine the confrontation situation,attack effect and escape probability of UAVs.Therefore,selecting the optimal confrontation position becomes the primary goal of maneuver decision-making.By taking the position as the UAV’s maneuver strategy,this paper constructs the optimal confrontation position selecting games(OCPSGs)model.In the OCPSGs model,the payoff function of each UAV is defined by the difference between the comprehensive advantages of both sides,and the strategy space of each UAV at every step is defined by its accessible space determined by the maneuverability.Then we design the limit approximation of mixed strategy Nash equilibrium(LAMSNQ)algorithm,which provides a method to determine the optimal probability distribution of positions in the strategy space.In the simulation phase,we assume the motions on three directions are independent and the strategy space is a cuboid to simplify the model.Several simulations are performed to verify the feasibility,effectiveness and stability of the algorithm.展开更多
Based on effectiveness analysis , a novel method is presented for combat aircraft top-hierarchy concept evaluation and decision-making. Applying multi-criterion decision-making ( MCDM ) and analytic hierarchy process ...Based on effectiveness analysis , a novel method is presented for combat aircraft top-hierarchy concept evaluation and decision-making. Applying multi-criterion decision-making ( MCDM ) and analytic hierarchy process , the new method can help to overcome the limitations of existing evaluation systems and decision-make methods.The proposed method includes the following process :( 1 ) Establish a multi-criterion and multi-hierarchy evaluation attribute system by introducing combat effectiveness ;( 2 ) Assign weight to the attributes and normalize them ;( 3 ) Evaluate and decision-make top-hierarchy aircraft concept based on effectiveness to reach a satisfactory design by comprehensively applying four multi-criterion decision-making methodologies , i.e.grey correlation projection method , weighted summation method , weighted quadrature method and ideal solution decision-making method , while considering the attribute hierarchy system and the logical relations among the attributes.Finally , an example is given to indicate the validity and feasibility of the proposed method.展开更多
At evaluating the combat effectiveness of the defense system, target′s probability to penetrate the defended area is a primary care taking index. In this paper, stochastic model to compete the probability that targe...At evaluating the combat effectiveness of the defense system, target′s probability to penetrate the defended area is a primary care taking index. In this paper, stochastic model to compete the probability that target penetrates the defended area along any flight path is established by the state analysis and statistical equilibrium analysis of stochastic service system theory. The simulated annealing algorithm is an enlightening random search method based on Monte Carlo recursion, and it can find global optimal solution by simulating annealing process. Combining stochastic model to compete the probability and simulated annealing algorithm, this paper establishes the method to solve problem quantitatively about combat configuration optimization of weapon systems. The calculated result shows that the perfect configuration for fire cells of the weapon is fast found by using this method, and this quantificational method for combat configuration is faster and more scientific than previous one based on principle via map fire field.展开更多
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 dur...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.展开更多
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 info...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.展开更多
Online accurate recognition of target tactical intention in beyond-visual-range (BVR) air combat is an important basis for deep situational awareness and autonomous air combat decision-making, which can create pre-emp...Online accurate recognition of target tactical intention in beyond-visual-range (BVR) air combat is an important basis for deep situational awareness and autonomous air combat decision-making, which can create pre-emptive tactical opportunities for the fighter to gain air superiority. The existing methods to solve this problem have some defects such as dependence on empirical knowledge, difficulty in interpreting the recognition results, and inability to meet the requirements of actual air combat. So an online hierarchical recognition method for target tactical intention in BVR air combat based on cascaded support vector machine (CSVM) is proposed in this study. Through the mechanism analysis of BVR air combat, the instantaneous and cumulative feature information of target trajectory and relative situation information are introduced successively using online automatic decomposition of target trajectory and hierarchical progression. Then the hierarchical recognition model from target maneuver element, tactical maneuver to tactical intention is constructed. The CSVM algorithm is designed for solving this model, and the computational complexity is decomposed by the cascaded structure to overcome the problems of convergence and timeliness when the dimensions and number of training samples are large. Meanwhile, the recognition result of each layer can be used to support the composition analysis and interpretation of target tactical intention. The simulation results show that the proposed method can effectively realize multi-dimensional online accurate recognition of target tactical intention in BVR air combat.展开更多
Service-oriented air combat simulation architecture is proposed.The core design goal is high agility which represents the ability to accommodate the simulation requirements change.Its main idea is to design model unit...Service-oriented air combat simulation architecture is proposed.The core design goal is high agility which represents the ability to accommodate the simulation requirements change.Its main idea is to design model units as services that can communicate and interoperate with any other services at runtime.A service is autonomous and is fully defined by a description contract which contains some combination of syntactic,semantic,and behavioral information.Based on the architecture,air combat simulation system can be described as an abstract composition of description contracts.It becomes concrete at run time as services that implement the constituent description contracts are discovered and bind.The whole process is a continuous run-time activity that responds to simulation needs and the availability of services.This provides benefits of implementation transparency and minimal dependency between models.Thus,simulation system can minimize the impact of change on it and increase the overall efficiency to respond to requirements change.展开更多
文摘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.
基金supported by Major Projects for Science and Technology Innovation 2030(Grant No.2018AA0100800)Equipment Pre-research Foundation of Laboratory(Grant No.61425040104)in part by Jiangsu Province“333”project under Grant BRA2019051.
文摘Game theory can be applied to the air combat decision-making problem of multiple unmanned combat air vehicles(UCAVs).However,it is difficult to have satisfactory decision-making results completely relying on air combat situation information,because there is a lot of time-sensitive information in a complex air combat environment.In this paper,a constraint strategy game approach is developed to generate intelligent decision-making for multiple UCAVs in complex air combat environment with air combat situation information and time-sensitive information.Initially,a constraint strategy game is employed to model attack-defense decision-making problem in complex air combat environment.Then,an algorithm is proposed for solving the constraint strategy game based on linear programming and linear inequality(CSG-LL).Finally,an example is given to illustrate the effectiveness of the proposed approach.
文摘Reinforcement learning has been applied to air combat problems in recent years,and the idea of curriculum learning is often used for reinforcement learning,but traditional curriculum learning suffers from the problem of plasticity loss in neural networks.Plasticity loss is the difficulty of learning new knowledge after the network has converged.To this end,we propose a motivational curriculum learning distributed proximal policy optimization(MCLDPPO)algorithm,through which trained agents can significantly outperform the predictive game tree and mainstream reinforcement learning methods.The motivational curriculum learning is designed to help the agent gradually improve its combat ability by observing the agent's unsatisfactory performance and providing appropriate rewards as a guide.Furthermore,a complete tactical maneuver is encapsulated based on the existing air combat knowledge,and through the flexible use of these maneuvers,some tactics beyond human knowledge can be realized.In addition,we designed an interruption mechanism for the agent to increase the frequency of decisionmaking when the agent faces an emergency.When the number of threats received by the agent changes,the current action is interrupted in order to reacquire observations and make decisions again.Using the interruption mechanism can significantly improve the performance of the agent.To simulate actual air combat better,we use digital twin technology to simulate real air battles and propose a parallel battlefield mechanism that can run multiple simulation environments simultaneously,effectively improving data throughput.The experimental results demonstrate that the agent can fully utilize the situational information to make reasonable decisions and provide tactical adaptation in the air combat,verifying the effectiveness of the algorithmic framework proposed in this paper.
基金jointly granted by the Science and Technology on Avionics Integration Laboratory and the Aeronautical Science Foundation of China (No. 2016ZC15008)
文摘A decision-making problem of missile-target assignment with a novel particle swarm optimization algorithm is proposed when it comes to a multiple target collaborative combat situation.The threat function is established to describe air combat situation.Optimization function is used to find an optimal missile-target assignment.An improved particle swarm optimization algorithm is utilized to figure out the optimization function with less parameters,which is based on the adaptive random learning approach.According to the coordinated attack tactics,there are some adjustments to the assignment.Simulation example results show that it is an effective algorithm to handle with the decision-making problem of the missile-target assignment(MTA)in air combat.
基金National Key R&D Program of China(Grant No.2021YFA1000402)National Natural Science Foundation of China(Grant No.72071159)to provide fund for conducting experiments。
文摘In the air combat process,confrontation position is the critical factor to determine the confrontation situation,attack effect and escape probability of UAVs.Therefore,selecting the optimal confrontation position becomes the primary goal of maneuver decision-making.By taking the position as the UAV’s maneuver strategy,this paper constructs the optimal confrontation position selecting games(OCPSGs)model.In the OCPSGs model,the payoff function of each UAV is defined by the difference between the comprehensive advantages of both sides,and the strategy space of each UAV at every step is defined by its accessible space determined by the maneuverability.Then we design the limit approximation of mixed strategy Nash equilibrium(LAMSNQ)algorithm,which provides a method to determine the optimal probability distribution of positions in the strategy space.In the simulation phase,we assume the motions on three directions are independent and the strategy space is a cuboid to simplify the model.Several simulations are performed to verify the feasibility,effectiveness and stability of the algorithm.
文摘Based on effectiveness analysis , a novel method is presented for combat aircraft top-hierarchy concept evaluation and decision-making. Applying multi-criterion decision-making ( MCDM ) and analytic hierarchy process , the new method can help to overcome the limitations of existing evaluation systems and decision-make methods.The proposed method includes the following process :( 1 ) Establish a multi-criterion and multi-hierarchy evaluation attribute system by introducing combat effectiveness ;( 2 ) Assign weight to the attributes and normalize them ;( 3 ) Evaluate and decision-make top-hierarchy aircraft concept based on effectiveness to reach a satisfactory design by comprehensively applying four multi-criterion decision-making methodologies , i.e.grey correlation projection method , weighted summation method , weighted quadrature method and ideal solution decision-making method , while considering the attribute hierarchy system and the logical relations among the attributes.Finally , an example is given to indicate the validity and feasibility of the proposed method.
文摘At evaluating the combat effectiveness of the defense system, target′s probability to penetrate the defended area is a primary care taking index. In this paper, stochastic model to compete the probability that target penetrates the defended area along any flight path is established by the state analysis and statistical equilibrium analysis of stochastic service system theory. The simulated annealing algorithm is an enlightening random search method based on Monte Carlo recursion, and it can find global optimal solution by simulating annealing process. Combining stochastic model to compete the probability and simulated annealing algorithm, this paper establishes the method to solve problem quantitatively about combat configuration optimization of weapon systems. The calculated result shows that the perfect configuration for fire cells of the weapon is fast found by using this method, and this quantificational method for combat configuration is faster and more scientific than previous one based on principle via map fire field.
基金supported by the National Natural Science Foundation of China(No.61573286)the Aeronautical Science Foundation of China(No.20180753006)+2 种基金the Fundamental Research Funds for the Central Universities(3102019ZDHKY07)the Natural Science Foundation of Shaanxi Province(2020JQ-218)the Shaanxi Province Key Laboratory of Flight Control and Simulation Technology。
文摘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.
基金supported by the National Natural Science Foundation of China(Grant No.61933010 and 61903301)Shaanxi Aerospace Flight Vehicle Design Key Laboratory。
文摘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.
基金The authors gratefully acknowledge the support of the National Natural Science Foundation of China under Grant No.62076204 and Grant No.61612385in part by the Postdoctoral Science Foundation of China under Grants No.2021M700337in part by the Fundamental Research Funds for the Central Universities under Grant No.3102019ZX016.
文摘Online accurate recognition of target tactical intention in beyond-visual-range (BVR) air combat is an important basis for deep situational awareness and autonomous air combat decision-making, which can create pre-emptive tactical opportunities for the fighter to gain air superiority. The existing methods to solve this problem have some defects such as dependence on empirical knowledge, difficulty in interpreting the recognition results, and inability to meet the requirements of actual air combat. So an online hierarchical recognition method for target tactical intention in BVR air combat based on cascaded support vector machine (CSVM) is proposed in this study. Through the mechanism analysis of BVR air combat, the instantaneous and cumulative feature information of target trajectory and relative situation information are introduced successively using online automatic decomposition of target trajectory and hierarchical progression. Then the hierarchical recognition model from target maneuver element, tactical maneuver to tactical intention is constructed. The CSVM algorithm is designed for solving this model, and the computational complexity is decomposed by the cascaded structure to overcome the problems of convergence and timeliness when the dimensions and number of training samples are large. Meanwhile, the recognition result of each layer can be used to support the composition analysis and interpretation of target tactical intention. The simulation results show that the proposed method can effectively realize multi-dimensional online accurate recognition of target tactical intention in BVR air combat.
文摘Service-oriented air combat simulation architecture is proposed.The core design goal is high agility which represents the ability to accommodate the simulation requirements change.Its main idea is to design model units as services that can communicate and interoperate with any other services at runtime.A service is autonomous and is fully defined by a description contract which contains some combination of syntactic,semantic,and behavioral information.Based on the architecture,air combat simulation system can be described as an abstract composition of description contracts.It becomes concrete at run time as services that implement the constituent description contracts are discovered and bind.The whole process is a continuous run-time activity that responds to simulation needs and the availability of services.This provides benefits of implementation transparency and minimal dependency between models.Thus,simulation system can minimize the impact of change on it and increase the overall efficiency to respond to requirements change.
