Wolf-Inspired Algorithm With Lévy Flight Boosts Multi-UAV Reconnaissance Task Allocation

When a swarm of drones must fan out over hostile terrain to gather intelligence, the question of which drone should visit which target is far harder than it sounds. Assigning reconnaissance tasks across dozens of unmanned aerial vehicles involves a combinatorial explosion of possible schedules, each weighed against flight time, energy budgets, and mission deadlines. A new study published in Cluster Computing tackles this optimization challenge with a redesigned swarm-intelligence method, the adaptive Lévy wolf pack algorithm, and reports substantial gains in both solution quality and computational stability across hundreds of simulated problem instances.

The research, led by JiaMing Bai with colleagues Xiao Lv, ChenJiang Shi, Yu Zhang, and Qi Zhao, addresses a persistent weakness in metaheuristic optimization: premature convergence. Classical swarm algorithms, including the wolf pack algorithm that inspired the new work, tend to cluster their candidate solutions around an early promising region of the search space. Once that happens, the population loses diversity, the search stagnates, and the algorithm settles for a mediocre assignment schedule even when better ones exist. For time-critical military or disaster-response reconnaissance missions, that shortfall translates directly into missed targets or wasted flight hours.

The authors’ central design choice is to strip the wolf metaphor down to a structural scaffold while replacing its stochastic search behavior with more principled mechanisms. The wolf pack stages — scouting, calling, and besieging prey — remain as the framework that organizes how candidate solutions explore and exploit the landscape. But the random walks that drive movement between solutions are redrawn from a Lévy flight distribution, a heavy-tailed probability law in which occasional extremely long jumps punctuate many short, local steps. This pattern, observed in the foraging paths of real animals from albatrosses to deer, is mathematically attractive for optimization because it balances dense local sampling with rare long-range escapes that can carry the search out of a local optimum entirely.

Adaptivity is the second pillar of the method. Rather than fixing the step-size scale or the balance between exploration and exploitation for the entire run, the algorithm modulates these parameters in response to the evolving state of the population. Early in the search, when solutions are scattered, the algorithm favors wide-ranging Lévy jumps to map the terrain. As convergence progresses and the swarm tightens around promising regions, the step lengths shrink and the search shifts toward fine-grained refinement. This dynamic scheduling guards against the twin failure modes of metaheuristics: wandering aimlessly when exploration dominates, and locking in prematurely when exploitation takes over.

To evaluate the approach, the team benchmarked it against ten competing algorithms — a lineup that includes established metaheuristics such as particle swarm optimization, grey wolf optimizer, and whale optimization algorithm, alongside the original wolf pack algorithm and a probability-threshold variant labeled EWPA-PT. The testbed consisted of 300 randomly generated instances of the multi-UAV task allocation problem, organized into three scales of 100 instances each. The largest problems involved 50 UAVs and 100 tasks, a scale at which exact combinatorial methods become computationally intractable and heuristics are the only practical option.

The results were unambiguous. Across all 300 instances, the adaptive Lévy wolf pack algorithm achieved the best mean objective values, and nonparametric statistical tests confirmed that the improvements were significant rather than artifacts of random variation. On the largest benchmark class, the method reduced the mean objective by roughly 8.3 percent compared with the strongest competing algorithm, a margin the authors describe as practically meaningful for mission planning. Perhaps more telling was the consistency: the new algorithm showed the lowest variance in solution quality across independent runs, indicating that its performance does not hinge on a lucky random seed.

Runtime told a similar story. The adaptive variant completed the large-scale instances in about 4.6 seconds on average, roughly 20 percent faster than the original wolf pack algorithm and an order of magnitude quicker than several competitors that exceeded 40 seconds per instance. The authors attribute this efficiency to the streamlined search dynamics — fewer wasted evaluations spent revisiting already-explored regions — and to the adaptive mechanism’s ability to terminate refinement once improvements plateau.

The study also probes the algorithm’s internal behavior through ablation-style analysis. Removing the adaptive component and fixing parameters at static values degraded both solution quality and convergence speed, confirming that the dynamic tuning is not decorative but load-bearing. Similarly, replacing the Lévy flight with Gaussian random walks produced noticeably worse results on the hardest instances, supporting the hypothesis that heavy-tailed jumps are what allow the search to escape deep local optima in the rugged assignment landscape.

Beyond the benchmarks, the authors demonstrate the method on a realistic reconnaissance scenario with geographically distributed targets and UAVs constrained by range and endurance. The resulting schedules respect all operational constraints while achieving near-optimal coverage scores, suggesting the approach could be integrated into real mission-planning software. The framework is also generic: because the wolf pack structure serves purely as an organizational scaffold, the same Lévy-driven, adaptively tuned search could be applied to other combinatorial problems such as vehicle routing, satellite scheduling, or sensor placement.

The work arrives amid a broader debate about the proliferation of nature-inspired metaheuristics, many of which critics argue differ from one another mainly in metaphor rather than mechanism. By explicitly identifying which components — the Lévy jumps, the adaptive parameter control, the structural stages — contribute measurable performance, this study offers a template for more rigorous algorithm design. For the growing community deploying drone swarms in agriculture, surveillance, and emergency response, the message is practical: how you randomize your search matters, and tuning that randomness to the problem’s evolving structure can turn a sluggish optimizer into a mission-ready planner.

Subject of Research: Swarm-intelligence optimization for multi-UAV reconnaissance task allocation

Article Title: Adaptive lévy wolf pack algorithm for multi-UAV cooperative reconnaissance task allocation

Article References: Bai, J., Lv, X., Shi, C., Zhang, Y., & Zhao, Q. (2026). Adaptive lévy wolf pack algorithm for multi-UAV cooperative reconnaissance task allocation. Cluster Computing, 29(15), 864. https://doi.org/10.1007/s10586-026-06629-1

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06629-1

Keywords: UAV swarms, task allocation, swarm intelligence, Lévy flight, wolf pack algorithm, metaheuristics, combinatorial optimization, reconnaissance, adaptive algorithms, drone missions, Adaptive, wolf