Consensus Seeking in Large-Scale Multiagent Systems With Hierarchical Switching-Backbone Topology

被引:2
作者
Xie, Guangqiang [1 ]
Xu, Haoran [2 ,3 ]
Li, Yang [1 ]
Wang, Chang-Dong [4 ]
Zhong, Biwei [1 ]
Hu, Xianbiao [5 ]
机构
[1] Guangdong Univ Technol, Sch Comp Sci & Technol, Guangzhou 510006, Peoples R China
[2] Sun Yat Sen Univ, Sch Intelligent Syst Engn, Shenzhen 510275, Peoples R China
[3] Peng Cheng Lab, Dept Networked Intelligence, Shenzhen 518066, Peoples R China
[4] Sun Yat Sen Univ, Sch Comp Sci & Technol, Guangzhou 510006, Peoples R China
[5] Penn State Univ, Dept Civil & Environm Engn, University Pk, PA 16802 USA
基金
中国国家自然科学基金;
关键词
Network topology; Topology; Switches; Convergence; Laplace equations; Consensus algorithm; Multi-agent systems; Backbone network; connectivity preservation; hierarchical topology control; large scale; multiagent systems (MASs); FAULT-DETECTION; ALGORITHM; NETWORK; STABILITY; TRACKING;
D O I
10.1109/TNNLS.2023.3290015
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recent developments in multiagent consensus problems have heightened the role of network topology when the agent number increases largely. The existing works assume that the convergence evolution typically proceeds over a peer-to-peer architecture where agents are treated equally and communicate directly with perceived one-hop neighbors, thus resulting in slower convergence speed. In this article, we first extract the backbone network topology to provide a hierarchical organization over the original multiagent system (MAS). Second, we introduce a geometric convergence method based on the constraint set (CS) under periodically extracted switching-backbone topologies. Finally, we derive a fully decentralized framework named hierarchical switching-backbone MAS (HSBMAS) that is designed to conduct agents converge to a common stable equilibrium. Provable connectivity and convergence guarantees of the framework are provided when the initial topology is connected. Extensive simulation results on different-type and varying-density topologies have shown the superiority of the proposed framework.
引用
收藏
页码:15810 / 15824
页数:15
相关论文
共 59 条
[1]   Connectivity Preservation in Nonholonomic Multi-Agent Systems: A Bounded Distributed Control Strategy [J].
Ajorlou, Amir ;
Aghdam, Amir G. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2013, 58 (09) :2366-2371
[2]  
Amis A. D., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P32, DOI 10.1109/INFCOM.2000.832171
[3]   Distributed memoryless point convergence algorithm for mobile robots with limited visibility [J].
Ando, H ;
Oasa, Y ;
Suzuki, I ;
Yamashita, M .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1999, 15 (05) :818-828
[4]  
[Anonymous], 2016, PROC 14 INT S MODEL
[5]   Stable energy-aware topology management in ad hoc networks [J].
Bao, Lichun ;
Garcia-Luna-Aceves, J. J. .
AD HOC NETWORKS, 2010, 8 (03) :313-327
[6]   Finite-Time Connectivity-Preserving Consensus of Networked Nonlinear Agents With Unknown Lipschitz Terms [J].
Cao, Yongcan ;
Ren, Wei ;
Casbeer, David W. ;
Schumacher, Corey .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2016, 61 (06) :1700-1705
[7]   Detecting hierarchical structure of community members in social networks [J].
Chen, Fengjiao ;
Li, Kan .
KNOWLEDGE-BASED SYSTEMS, 2015, 87 :3-15
[8]   Multi-Agent Deep Reinforcement Learning for Large-Scale Traffic Signal Control [J].
Chu, Tianshu ;
Wang, Jie ;
Codeca, Lara ;
Li, Zhaojian .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2020, 21 (03) :1086-1095
[9]   Hierarchical structure and the prediction of missing links in networks [J].
Clauset, Aaron ;
Moore, Cristopher ;
Newman, M. E. J. .
NATURE, 2008, 453 (7191) :98-101
[10]   Robust rendezvous for mobile autonomous agents via proximity graphs. in arbitrary dimensions [J].
Cortes, Jorge ;
Martinez, Sonia ;
Bullo, Francesco .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2006, 51 (08) :1289-1298