.png){kind=icon}
.png){kind=icon}
Return
Task-oriented overlapping coalition formation: a game-theoretic framework for heterogeneous UAV task allocation
.png){kind=icon}
PRE
AI
S
J
P
DOI：10.1007/s10514-026-10244-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The overlapping coalition formation (OCF) game has emerged as a key framework in multi-agent systems, enabling unmanned aerial vehicles (UAVs) to participate in multiple distinct coalitions simultaneously. This paper studies constrained task allocation in heterogeneous UAV systems using OCF, with a focus on resource heterogeneity, communication constraints, and temporal limitations. We introduce an adaptive exploration–exploitation mechanism that systematically refines the solution space while avoiding premature convergence in coalition optimization. Comparative simulations with state-of-the-art OCF methods and variable neighborhood search (VNS) demonstrate that our approach significantly improves performance in resource-limited settings, achieving a 24.57% increase in coalition utility and a 38.46% higher task completion rate compared to conventional coalition formation algorithms, with a slight increase in convergence time and coalition size. These results quantitatively confirm the effectiveness of the proposed method in balancing exploration–exploitation trade-offs for coalition optimization.
Keywords:
Task allocation
Overlapping coalition formation
Communication constraints
Resource constraints
Journal
IF:
4.3
Papers:
1.6K
Citations:
5.0K
Organization
Cited Papers