文章检索
研究论文

含有等容胞腔的多智能体系统的能控性

  • 刘萌萌 ,
  • 纪志坚 ,
  • 刘允刚 ,
  • 林崇 ,
  • 刘萌萌 ,
  • 纪志坚 ,
  • 刘允刚 ,
  • 林崇
展开
  • 1.青岛大学 a.自动化学院;b.系统科学研究院,山东 青岛 266071;
    2.山东大学控制科学与工程学院, 济南 250061
刘萌萌(1997-),女,山东济宁人,硕士研究生,主要研究方向为多智能体网络分布式控制。

收稿日期: 2023-03-15

  修回日期: 2023-04-12

  网络出版日期: 2025-04-27

基金资助

国家自然科学基金(62373205,62033007);山东省泰山学者特聘教授人才支持计划(tstp20230624,ts20190930);山东省泰山学者攀登计划

Controllability of Multi-agent Systems with Cells of Equal Capacity

  • LIU Mengmeng ,
  • JI Zhijian ,
  • LIU Yungang ,
  • LIN Chong ,
  • LIU Mengmeng ,
  • JI Zhijian ,
  • LIU Yungang ,
  • LIN Chong
Expand
  • School of Automation, Qingdao University,Qingdao 266071, China

Received date: 2023-03-15

  Revised date: 2023-04-12

  Online published: 2025-04-27

摘要

为研究含有等容胞腔的多智能体系统的能控性问题,基于等容胞腔中的等势节点,区分了等势节点与自同构节点,发现等势节点是自同构节点的扩展。通过选取等势节点和非等势节点作为领导者,分析了系统的能控性,并提出了一种根据等容胞腔数量决定领导者数量的新方法。最后通过分析拉普拉斯矩阵,揭示了其秩与拓扑结构的之间的关系。研究结果表明,提出的领导者选择方式能有效提升系统的能控性。

本文引用格式

刘萌萌 , 纪志坚 , 刘允刚 , 林崇 , 刘萌萌 , 纪志坚 , 刘允刚 , 林崇 . 含有等容胞腔的多智能体系统的能控性[J]. 复杂系统与复杂性科学, 2025 , 22(1) : 97 -103 . DOI: 10.13306/j.1672-3813.2025.01.013

Abstract

This paper aims to investigate the controllability of multi-agent systems with cells of equal capacity. Firstly, based on the equipotential nodes within cells of equal capacity, a distinction is made between equipotential nodes and automorphic nodes, revealing that equipotential nodes extend automorphic nodes. Secondly, by selecting equipotential nodes and non-equipotential nodes as leaders, the controllability of the system is analyzed, and a novel leader selection method based on the number of cells of equal capacity is proposed. Finally, by analyzing the Laplacian matrix, the relationship between its rank and the topological structure is revealed. The research results demonstrate that the proposed leader selection method can effectively enhance the controllability of the system.

参考文献

[1] JI Z J, LIN H, CAO S B, et al. The complexity in complete graphic characterizations of multi-agent controllability[J]. IEEE Transactions on Cybernectics, 2021, 51(1):64-76.
[2] GUAN Y Q, JI Z J, ZHANG L, et al. Controllability of heterogeneous multi-agent systems under directed and weighted topology[J]. International Journal of Control, 2016, 89(5):1009-1024.
[3] GUO J H, JI Z J, LIU Y G, et al. Unified understanding and new results of controllability model of multi-agent systems[J]. International Journal of Robust and Nonlinear Control, 2022, 32(11):6330-6345.
[4] SUN Y S, JI Z J, LIU Y G, et al. On stabilizability of multi-agent systems[J]. Automatica, 2022, 144:110491.
[5] LIU B, PING Y Y, WU L C, et al. Controllability of discrete-time multi-agent systems based on absolute protocol with time-delays[J]. Neurocomputing, 2020, 409:316-328.
[6] 王潇, 纪志坚. 基于MAS的无人机新型编队算法[J]. 复杂系统与复杂性科学, 2019, 16(2):60-68.
WANG X, JI Z J. A new UAV formational algorithm based on MAS[J]. Complex Systems and Complexity Science, 2019, 16(2):60-68.[7] KLOTZ J R, KAN Z, SHEA J M, et al. Asymptotic synchronization of a leader-follower network of uncertain Euler-Lagrange systems[J]. IEEE Transactions on Control of Network Systems, 2015, 2(2):174-182.
[8] JI Z J, LIN H, YU H S. Leaders in multi-agent controllability under consensus algorithm and tree topology[J]. Systems and Control Letters, 2012, 61(9):918-925.
[9] TANNER H. On the controllability of nearest neighbor interconnections[J]. Proceedings of the 43rd IEEE Conference on Decision and Control. Atlantis, Paradise Island, Bahamas, 2004:2467-2472.
[10] JI M, EGERSTEDT M. A graph-theoretic characterization of controllability for multi-agent systems[C]. Proceedings of the 26th American Control Conference. New York, USA, 2007:4588-4593.
[11] JI Z J, WANG Z D, LIN H, et al. Interconnection topologies for multi-agent coordination under leader-follower framework[J]. Automatica, 2009, 45(12):2857-2863.
[12] RAHMANI A, JI M, MESBAHI M, et al. Controllability of multi-agent systems from a graph-theoretic perspective[J]. SIAM Journal on Control and Optimization, 2009, 48(1):162-186.
[13] MARTINI S, EGERSTEDT M, BICCHI A. Controllability analysis of multi-agent systems using relaxed equitable partitions[J]. International Journal of Systems, Control and Communications, 2010, 2(1/2/3): 100-121.
[14] ZHANG S, CAO M, CAMLIBEL M K. Upper and lower bounds for controllable subspaces of networks of diffusively coupled agents[J]. IEEE Transactions on Automatic Control, 2014, 59(3):745-750.
[15] AGUILAR C O, GHARESIFARD B. Almost equitable partition and new necessary conditions for network controllability[J]. Automatica, 2017(80):25-31.
[16] AGUILAR C O, GHARESIFARD B. Graph controllability classes for the laplacian leader-follower dynamics[J]. IEEE Transactions on Automatic Control, 2015, 60(6):1611-1626.
[17] PARLANGELI G, NOTARSTEFANO G. On the reachability and observability of path and cycle graph[J]. IEEE Transaction on Automatic Control, 2012, 57(3):743-748.
[18] LIU X Z, JI Z J. Controllability of multi-agent systems based on path and cycle graphs[J]. International Journal of Robust and Nonlinear Control, 2018, 28(1):296-309.
[19] KALMAN R E. Mathematical description of linear dynamical systems[J]. Journal of the Society for Industrial and Applied Mathematics, Series A: Control, 1963, 1(2):152-192.
[20] LOU Y H, JI Z J, QU J J. New results of multi-agent controllability under equitable partitions[J]. IEEE Access, 2020, 59:73523-73535.
[21] 张安慧, 张世杰, 陈健, 等. 多智能体系统能控性的图论刻画[J]. 控制与决策, 2011, 26(11):1621-1626.
ZHANG A H, ZHANG S J, CHEN J, et al. Graph theory characterization of controllability of multi-agent systems[J]. Control and Decision, 2011, 26(11):1621-1626.
[22] QU J J, JI Z J, SHI Y. The graphical conditions for controllability of multiagent systems under equitable partition[J]. IEEE Transactions on Cybernetics, 2021, 51(9):4661-4672.
[23] CARDOSO D M, DELORME C, RAMA P. Laplacian eigenvectors and eigenvalues and almost equitable partitions[J]. European Journal of Combinatorics, 2007, 28(3): 665-673.
文章导航

/

〈 〉