计算机科学
接头(建筑物)
博弈论
实时计算
钥匙(锁)
车辆动力学
分布式计算
算法设计
计算机网络
控制(管理)
作者
Z K Li,Weiguo Xia,SB Zhang
标识
DOI:10.1109/tmc.2026.3708388
摘要
In this paper, we propose a joint switch coalition formation game (JSCFG) model, which optimizes the communication topology of a heterogeneous unmanned aerial vehicle (UAV) swarm via dynamic grouping. This approach effectively overcomes the limitations inherent in existing coalition formation game (CFG) models with basic task requirement constraints and eliminates inefficient communication links. Specifically, we propose a joint switch common improvement (JSCI) preference order by accounting for the dynamic attributes of UAVs and iteratively update the coalition structure to the near-optimal solution through successive joint switch operations. Furthermore, we prove the existence of Nash equilibrium solutions under the proposed preference order using the exact potential game (EPG). We also develop a basic coalition structure formation algorithm (BCSFA), which preprocesses the heterogeneous UAV swarm through a sequential greedy selection strategy, effectively reducing the computational complexity during initial iteration. Finally, a joint switch coalition formation algorithm (JSCFA) is proposed to generate the final Nash-stable coalition structure based on established joint switch rules. Numerical results underscore the effectiveness of dynamic grouping and further illustrate that the JSCFA is more efficient in coalition formation than the state-of-the-art algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI