Distributed auction-based adaptive task assignment and re-assignment for multi-UAV suppressive jamming

Task assignment is critical for multiple unmanned aerial vehicles (UAVs) to perform suppressive jamming against radar network. However, under abrupt state changes of enemy radars, centralized methods often incur high computational complexity and exhibit limited robustness, rendering them unsuitable for rapid task re-assignment. To address these challenges, an adaptive multi-UAV task assignment and re-assignment scheme for suppressive jamming against intermittent radar network is proposed. Specifically, the system is comprehensively modeled by integrating a motion model describing high-value target trajectory, a reconnaissance model detecting radar state transitions, and a suppressive jamming model characterizing the matching relationships between UAVs and radars. The problem is formulated as a dynamic integer program with time-varying constraints. To solve this, a distributed auction-based task assignment and re-assignment algorithm is proposed, enabling task assignment and re-assignment triggered by sudden radar activations or deactivations. Simulation results demonstrate that the proposed approach achieves jamming performance comparable to centralized methods, outperforms traditional fixed and random strategies, and enables re-assignment in response to abrupt radar state changes.

Authors

Institutions

Publication Details

Journal
Defence Technology
Published
2025-11-01
DOI
https://doi.org/10.1016/j.dt.2025.11.012
Primary Topic
Radar Systems and Signal Processing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed auction-based adaptive task assignment and re-assignment for multi-UAV suppressive jamming

Baozhu Hu, Caipin Li, Tianxian Zhang, Rongxiang Han
Defence Technology
Radar Systems and Signal Processing
article

Distributed auction-based adaptive task assignment and re-assignment for multi-UAV suppressive jamming

Baozhu Hu, Caipin Li, Tianxian Zhang, Rongxiang Han
article en

Abstract

Task assignment is critical for multiple unmanned aerial vehicles (UAVs) to perform suppressive jamming against radar network. However, under abrupt state changes of enemy radars, centralized methods often incur high computational complexity and exhibit limited robustness, rendering them unsuitable for rapid task re-assignment. To address these challenges, an adaptive multi-UAV task assignment and re-assignment scheme for suppressive jamming against intermittent radar network is proposed. Specifically, the system is comprehensively modeled by integrating a motion model describing high-value target trajectory, a reconnaissance model detecting radar state transitions, and a suppressive jamming model characterizing the matching relationships between UAVs and radars. The problem is formulated as a dynamic integer program with time-varying constraints. To solve this, a distributed auction-based task assignment and re-assignment algorithm is proposed, enabling task assignment and re-assignment triggered by sudden radar activations or deactivations. Simulation results demonstrate that the proposed approach achieves jamming performance comparable to centralized methods, outperforms traditional fixed and random strategies, and enables re-assignment in response to abrupt radar state changes.

Defence Technology
University of Electronic Science and Technology of China (CN), China Academy of Space Technology (CN), Space Micro (United States) (US)
Openalex Percentile: Top 53%
Radar Systems and Signal Processing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.