系统仿真学报 ›› 2023, Vol. 35 ›› Issue (4): 695-708.doi: 10.16182/j.issn1004731x.joss.22-1297

• 论文 • 上一篇    

基于网络节点聚类的多无人机动态目标分配

赵拓(), 邓汉强, 高佳隆, 黄健()   

  1. 国防科技大学 智能科学学院,湖南 长沙 410003
  • 收稿日期:2022-10-31 修回日期:2022-12-05 出版日期:2023-04-29 发布日期:2023-04-12
  • 通讯作者: 黄健 E-mail:458621115@qq.com;nudtjhuang@hotmail.com
  • 作者简介:赵拓(1996-),男,助理工程师,硕士生,研究方向为无人作战仿真。E-mail:458621115@qq.com

Dynamic Target Assignment of Multiple Unmanned Aerial Vehicles Based on Clustering of Network Nodes

Tuo Zhao(), Hanqiang Deng, Jialong Gao, Jian Huang()   

  1. School of Mechatronic Engineering and Automation, National University of Defense Technology, Changsha 410003, China
  • Received:2022-10-31 Revised:2022-12-05 Online:2023-04-29 Published:2023-04-12
  • Contact: Jian Huang E-mail:458621115@qq.com;nudtjhuang@hotmail.com

摘要:

为解决分布式的多无人机目标分配算法容易产生通信冗余,导致编队出现通信规模过大的问题,提出一种基于通信网络节点聚类的多无人机动态目标分配算法(clustered consensus-based bundle algorithm, CU-CBBA)。该算法引入了通信网络节点分组聚类策略,依据节点的度中心性、特征向量中心性、中介中心性等属性,建立了网络节点重要性排序模型,选取网络拓扑结构中的一组关键节点,按照最短路径原则完成网络拓扑节点聚类。仿真结果表明:与CBBA、ACBBA(asynchronous consensus-based bundle algorithm)、MCDGA(minimizing communications in decentralized greedy task allocation)算法相比,CU-CBBA算法的通信规模最小,收敛速度最快,迭代稳定性强,编队规模或目标数量的改变不会影响其有效性,与其他CBBA变种算法相比,该算法不需要智能体之间建立相对稳定的通信拓扑结构,通用性和稳定性较好,对复杂战场环境下的多机多目标分配具有部分借鉴意义。

关键词: 战场环境, 通信网络, 节点聚类, 多无人机, 目标分配

Abstract:

In order to solve the problem that the distributed multi-UAV target assignment algorithm is prone to communication redundancy, which leads to the large communication scale of formation, a multi-UAV dynamic target assignment algorithm (CU-CBBA) based on node clustering in communication network is proposed.The algorithm introduces the communication network node grouping clustering strategy. According to the node's degree centrality, feature vector centrality, intermediate centrality and other attributes, the network node importance ranking model is established. A group of key nodes in the network topology structure are selected and the network topology node clustering is completed according to the shortest path principle. The simulation results show that, compared with CBBA, ACBBA and MCDGA algorithms, CU-CBBA algorithm has the smallest communication scale, the fastest convergence speed, and strong iterative stability. The change of formation size or target number does not affect its effectiveness. Compared with the other CBBA variant algorithms, the algorithm does not need the establishment of relatively stable communication topology between agents and has good universality and stability, which has a certain reference significance for the multi-aircraft and multi-target allocation in complex battlefield environment.

Key words: battlefield environment, communication network, node clustering, multiple uavs, target allocation

中图分类号: