Qichen Shang

As artificial intelligence continues to evolve, reinforcement learning (RL) has shown remarkable potential for solving complex sequential decision problems and is now applied in diverse areas, including robotics, autonomous vehicles, and financial analytics. Among the various RL paradigms, multi-agent reinforcement learning (MARL) stands out for its ability to manage cooperative and competitive interactions within multi-entity systems. However, mainstream MARL algorithms still face critical challenges in training stability and policy generalization due to factors such as environmental non-stationarity, policy coupling, and inefficient sample utilization. To mitigate these limitations, this study introduces an enhanced algorithm named MATD3_AHD, developed by extending the MATD3 framework, which integrates TD3 and MADDPG principles. The goal is to improve the learning efficiency and overall policy effectiveness of agents operating in complex environments. The proposed method incorporates three key mechanisms: (1) an Adaptive Exploration Policy (AEP), which dynamically adjusts the perturbation magnitude based on TD error to improve both exploration capability and training stability; (2) a Hierarchical Sampling Policy (HSP), which enhances experience utilization through sample clustering and prioritized replay; and (3) a Dynamic Delayed Update (DDU), which adaptively modulates the actor update frequency based on critic network errors, thereby accelerating convergence and improving policy stability. Experiments conducted on multiple benchmark tasks within the Multi-Agent Particle Environment (MPE) demonstrate the superior performance of MATD3_AHD compared to baseline methods such as MADDPG and MATD3. The proposed MATD3_AHD algorithm outperforms baseline methods—by an average of 5% over MATD3 and 20% over MADDPG—achieving faster convergence, higher rewards, and more stable policy learning, thereby confirming its robustness and generalization capability.

With the increasingly widespread application of unmanned aerial vehicle (UAV) systems in disaster monitoring, urban management, logistics transportation, and reconnaissance, efficient dynamic task allocation has become a key issue in improving task execution efficiency. To address the challenges posed by dynamic changes in task objectives and resource constraints that traditional task allocation methods struggle with in complex environments, this paper proposes a multi-objective particle swarm optimization algorithm, DCMPSO, for UAV dynamic reconnaissance task allocation. First, the framework of DCMPSO is constructed, dividing the optimization of dynamic problems into three parts: environment change detection, environment change response, and actual optimization, with the designed strategy of range prediction strategy based on centroid translation. Then, simulation experiments are conducted to verify the effectiveness of the algorithm mechanisms through ablation experiments and to demonstrate the superiority of DCMPSO in convergence and distribution compared to DNSGA-II and SGEA through comparative experiments. Finally, a multi-UAV dynamic task allocation model is established and optimized, proving that DCMPSO can correctly solve the UAV dynamic multi-objective allocation problem and effectively find its optimal solution, providing an effective solution for practical applications.