To address the fundamental trade-off between real-time responsiveness to high-priority missions and long-term overall economic efficiency of the system in multi-UAV dynamic task assignment, we propose a hybrid intelligent scheduling algorithm abbreviated as DPSO-Greedy. The algorithm performs periodic global batch optimization for regular orders using an improved discrete particle swarm optimization (DPSO) method, and realizes instantaneous allocation of emergency orders via an adaptive multi-factor Greedy strategy, thus enabling efficient collaborative processing of differentiated tasks. Targeting the trade-off between real-time response and long-term system efficiency, this paper proposes a hybrid DPSO-Greedy algorithm with decoupled task scheduling mechanisms. Comparative simulation results demonstrate that compared with mainstream metaheuristic algorithms (Greedy, SSA, GWO and RHS), the proposed method reduces the average response time of emergency orders by 33.2–68.2%, achieves an emergency order completion rate exceeding 90%, and improves system load balancing performance by 24–35% in dynamic scenarios characterized by burst and tidal demands. This study provides a promising solution for dynamic UAV assignment problems and offers valuable insights for a broader range of real-time resource collaborative decision-making applications.
In maritime target search missions, UAV swarm task scheduling faces several challenges. These include uncertainties in target states, the high-dimensional multimodal characteristic of the solution space, and dynamic constraints on swarm collaboration. In terms of target position estimation, existing methods ignore the spatiotemporal correlation of target movement. At the level of optimization algorithms, existing algorithms struggle to balance global exploration and local exploitation, and they tend to fall into local optima. To address the above shortcomings, this paper constructs a technical system of “state perception-strategy optimization-collaborative execution”. First, a Serial Memory Iterative Method (GMMIM) integrated with the Gaussian–Markov model is proposed. This method recursively corrects the probability distribution of target positions using historical state data, thereby providing accurate situational support for decision-making. As a result, task scheduling efficiency is improved by 5.36%. Second, the sliding window technique is introduced to improve the Grey Wolf Optimizer (GWO). Based on the convergence of the population’s optimal fitness, the decay rate of the convergence factor is dynamically and adaptively adjusted. This balances the capabilities of global exploration and local exploitation to ensure swarm scheduling efficiency. Simulations demonstrate that the optimization performance of the proposed FSW-GWO algorithm is 16.95% higher than that of the IPSO method. Finally, a dynamic task weight update mechanism is designed. By combining resource load and task timeliness requirements, this mechanism achieves complementary adaptation between swarm resources and tasks.