Unmanned aerial vehicles (UAVs) can be used in swarms to achieve multiple tasks cooperatively. Multi-UAV and multi-target cooperative task assignments are difficult. To solve the problem of unbalanced, phased, cooperative assignment between UAVs and tasks, we establish an unbalanced, phased task assignment model that considers the constraints of task execution, time, and target task execution demand. Based on an improved consensus-based bundle algorithm (CBBA), we propose a two-tier task bidding mechanism. According to dynamic changes in new tasks, we study a dynamic assignment strategy and propose a mechanism based on task continuity adjustment and time windows. Finally, a simulation experiment is used to verify the feasibility and effectiveness of the proposed allocation method in multi-UAV target assignment scenarios. The results show that the dynamic task assignment strategy can efficiently assign random new tasks as they arise.

In the process of unmanned aerial vehicles (UAV) cluster coordination, communication obstruction may cause situational misjudgement and increase the risk of decision‐making errors. Therefore, based on evolutionary game theory, this research aimed to study the behaviour decision‐making selection problem in the process of UAV swarm missions in limited communication networks. First, the evolution process of the UAV swarm confrontation game is analyzed and the decision‐making risks associated with the communication network of the UAV swarm during coordination, which are caused by the complex confrontation environment are identified. Second, the decision‐making risks and mechanisms of UAV swarm communication is discussed and an evolutionary game mathematical model for the cooperative strategy of a UAV swarm under communication constraints is established. Finally, the influence of various key parameters is simulated and analyzed, such as the initial strategy probability of both parties, amount of platform information data, information analysis and utilization ability, and information interaction coefficient, on the evolution of the UAV swarm strategy. This research provides a theoretical basis and feasible reference for the improvement of UAV mission decision response mechanisms and system model construction, which have important theoretical value and practical significance.

To tackle the challenges presented by the two‐player zero sum game (TZSG) in three‐dimensional space, this study introduces an enhanced deep Q‐learning (DQN) algorithm that utilizes long short term memory (LSTM) network. The primary objective of this algorithm is to enhance the temporal correlation of the TZSG in three‐dimensional space. Additionally, it incorporates the hindsight experience replay (HER) mechanism to improve the learning efficiency of the network and mitigate the issue of the “sparse reward” that arises from prolonged training of intelligence in solving the TZSG in the three‐dimensional. Furthermore, this method enhances the convergence and stability of the overall solution.An intelligent training environment centred around an airborne agent and its mutual pursuit interaction scenario was designed to proposed approach's effectiveness. The algorithm training and comparison results show that the LSTM‐DQN‐HER algorithm outperforms similar algorithm in solving the TZSG in three‐dimensional space. In conclusion, this paper presents an improved DQN algorithm based on LSTM and incorporates the HER mechanism to address the challenges posed by the TZSG in three‐dimensional space. The proposed algorithm enhances the solution's temporal correlation, learning efficiency, convergence, and stability. The simulation results confirm its superior performance in solving the TZSG in three‐dimensional space.

In recent years, with the accelerated development of technology towards automation and intelligence, autonomous decision-making capabilities in unmanned systems are poised to play a crucial role in contemporary aerial two-player zero-sum games (TZSGs). Deep reinforcement learning (DRL) methods enable agents to make autonomous manoeuvring decisions. This paper focuses on current mainstream DRL algorithms based on fundamental tactical manoeuvres, selecting a typical aerial TZSG scenario—within visual range (WVR) combat. We model the key elements influencing the game using a Markov decision process (MDP) and demonstrate the mathematical foundation for implementing DRL. Leveraging high-fidelity simulation software (Warsim v1.0), we design a prototypical close-range aerial combat scenario. Utilizing this environment, we train mainstream DRL algorithms and analyse the training outcomes. The effectiveness of these algorithms in enabling agents to manoeuvre in aerial TZSG autonomously is summarised, providing a foundational basis for further research.