基于k-shell分解的多智能体牵制控制算法
CSTR:
作者:
作者单位:

(1. 解放军陆军工程大学指挥控制工程学院,南京210007;2. 解放军94860部队,南京210000)

作者简介:

通讯作者:

E-mail: 718996172@qq.com.

中图分类号:

TP273

基金项目:

国家重点研发计划项目(2018YFC0806900);中国博士后科学基金项目(2018M633757);江苏省重点研发计划项目(BE2016904,BE2017616,BE2018754,BE2019762);江苏省博士后科学基金项目(2019K185).


Multi-agent pinning control algorithm based on k-shell decomposition
Author:
Affiliation:

(1. Command & Control Engineering College,Army Engineering University of PLA,Nanjing210007,China;2. Unit 94860 of PLA,Nanjing210000,China)

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对多智能体网络在牵制控制过程中存在的网络分裂现象,考虑到牵制节点选择对多智能体收敛速度的影响,提出一种基于k-shell分解的牵制控制算法.首先根据节点连通度划分子网;然后提出基于k-shell分解的牵制节点选择方法;最后完成多智能体的牵制控制.理论推导证明,采用该算法后整个智能体网络最终将形成一个子网.分析对比3种牵制控制算法,通过实验仿真结果验证所提出算法能够实现多智能体的一致性,有利于提高多智能体的收敛速度.

    Abstract:

    Aiming at the network splitting phenomenon in the control process of multi-agent network, considering the influence of informed agent selection on the convergence speed of multi-agents, the pinning control algorithm based on k-shell decomposition is proposed. Firstly, the subnet is divided according to the node connectivity. Then, the method of selecting the informed agent based on k-shell decomposition is proposed. Finally, the pinning control of multi-agent is completed. Theoretical derivation proves that after the algorithm is adopted, the entire mutli-agent network eventually form a connected graph. The experimental results verify that the proposed algorithm can achieve the consensus of multi-agent, and benefits to improve the convergence speed compared with three pinning control algorithms.

    参考文献
    相似文献
    引证文献
引用本文

何明,许元云,刘锦涛,等.基于k-shell分解的多智能体牵制控制算法[J].控制与决策,2020,35(10):2556-2560

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2020-08-28
  • 出版日期:
文章二维码