Distributed Consensus of Layered Multi-Agent Systems Subject to Attacks on Edges

This paper addresses the consensus problem for two-layered MASs (multi-agent systems) subject to attacks on communication edges. Unlike most existing two-layered MAS models, the considered MASs are allowed to have heterogeneous inner communication topologies between the different layers. By using th...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems. I, Regular papers Vol. 67; no. 9; pp. 3152 - 3162
Main Authors Wen, Guanghui, Wang, Peijun, Huang, Tingwen, Lu, Jinhu, Zhang, Fan
Format Journal Article
LanguageEnglish
Published New York IEEE 01.09.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
Abstract This paper addresses the consensus problem for two-layered MASs (multi-agent systems) subject to attacks on communication edges. Unlike most existing two-layered MAS models, the considered MASs are allowed to have heterogeneous inner communication topologies between the different layers. By using the linear transformation technique, some sufficient criteria are first given to achieve consensus among the leaders within the leader layer where the condition that the interaction topology has directed spanning trees with a fixed root required in most existing works has been removed. Furthermore, based on the relative outputs, observer-based controllers are designed to achieve node-to-node consensus among the two layers. By developing a new kind of multiple Lyapunov function (MLF) based on a bisection search method, some criteria are established under which the node-to-node consensus error will converge into a bounded set asymptotically. It is interestingly found that a less conservative average dwell time (ADT) constraint is obtained for achieving node-to-node consensus by utilizing the proposed MLF compared with that yielded by the traditional MLF constructed from nonsingular <inline-formula> <tex-math notation="LaTeX">M </tex-math></inline-formula> matrix theory. Moreover, we show that consensus can be achieved asymptotically in the layered MASs with the same inner topology subject to synchronous attacks under some suitable conditions. Finally, the effectiveness of the criteria is verified by simulation on networking linear oscillators.
AbstractList This paper addresses the consensus problem for two-layered MASs (multi-agent systems) subject to attacks on communication edges. Unlike most existing two-layered MAS models, the considered MASs are allowed to have heterogeneous inner communication topologies between the different layers. By using the linear transformation technique, some sufficient criteria are first given to achieve consensus among the leaders within the leader layer where the condition that the interaction topology has directed spanning trees with a fixed root required in most existing works has been removed. Furthermore, based on the relative outputs, observer-based controllers are designed to achieve node-to-node consensus among the two layers. By developing a new kind of multiple Lyapunov function (MLF) based on a bisection search method, some criteria are established under which the node-to-node consensus error will converge into a bounded set asymptotically. It is interestingly found that a less conservative average dwell time (ADT) constraint is obtained for achieving node-to-node consensus by utilizing the proposed MLF compared with that yielded by the traditional MLF constructed from nonsingular <inline-formula> <tex-math notation="LaTeX">M </tex-math></inline-formula> matrix theory. Moreover, we show that consensus can be achieved asymptotically in the layered MASs with the same inner topology subject to synchronous attacks under some suitable conditions. Finally, the effectiveness of the criteria is verified by simulation on networking linear oscillators.
This paper addresses the consensus problem for two-layered MASs (multi-agent systems) subject to attacks on communication edges. Unlike most existing two-layered MAS models, the considered MASs are allowed to have heterogeneous inner communication topologies between the different layers. By using the linear transformation technique, some sufficient criteria are first given to achieve consensus among the leaders within the leader layer where the condition that the interaction topology has directed spanning trees with a fixed root required in most existing works has been removed. Furthermore, based on the relative outputs, observer-based controllers are designed to achieve node-to-node consensus among the two layers. By developing a new kind of multiple Lyapunov function (MLF) based on a bisection search method, some criteria are established under which the node-to-node consensus error will converge into a bounded set asymptotically. It is interestingly found that a less conservative average dwell time (ADT) constraint is obtained for achieving node-to-node consensus by utilizing the proposed MLF compared with that yielded by the traditional MLF constructed from nonsingular [Formula Omitted] matrix theory. Moreover, we show that consensus can be achieved asymptotically in the layered MASs with the same inner topology subject to synchronous attacks under some suitable conditions. Finally, the effectiveness of the criteria is verified by simulation on networking linear oscillators.
Author Huang, Tingwen
Wang, Peijun
Wen, Guanghui
Lu, Jinhu
Zhang, Fan
Author_xml – sequence: 1
  givenname: Guanghui
  orcidid: 0000-0003-0070-8597
  surname: Wen
  fullname: Wen, Guanghui
  email: wenguanghui@gmail.com
  organization: Department of Systems Science, School of Mathematics, Jiangsu Provincial Key Laboratory of Networked Collective Intelligence, Southeast University, Nanjing, China
– sequence: 2
  givenname: Peijun
  orcidid: 0000-0003-1229-6278
  surname: Wang
  fullname: Wang, Peijun
  email: pjw4047778@163.com
  organization: School of Mathematics and Statistics, Anhui Normal University, Wuhu, China
– sequence: 3
  givenname: Tingwen
  orcidid: 0000-0001-9610-846X
  surname: Huang
  fullname: Huang, Tingwen
  email: tingwen.huang@qatar.tamu.edu
  organization: Texas A&M University at Qatar, Doha, Qatar
– sequence: 4
  givenname: Jinhu
  orcidid: 0000-0003-0275-8387
  surname: Lu
  fullname: Lu, Jinhu
  email: jhlu@iss.ac.cn
  organization: School of Automation Science and Electrical Engineering, Beihang University, Beijing, China
– sequence: 5
  givenname: Fan
  surname: Zhang
  fullname: Zhang, Fan
  email: zhangfan6@mail.sysu.edu.cn
  organization: School of Aeronautics and Astronautics (Shenzhen), Sun Yat-sen University, Guangzhou, China
BookMark eNp9kEFLwzAUx4NMcE4_gHgJeO58TdokPY46dTBR2DyXJH0dnVs7k_Swb2_LhgcPnt6fx__3HvyuyahpGyTkLoZpHEP2uM5XiykDBlOWKZGl_IKM4zRVESgQoyEnWaQ4U1fk2vstAMuAx2Py8VT74GrTBSxp3jYeG9952lZ0qY_o-uVbtwt1NNtgE-jq6APuPV11Zos20NDSWQjafvVEQ-flBv0Nuaz0zuPteU7I5_N8nb9Gy_eXRT5bRpZlPEQ6ATRlFhtdCsOVlSC4MNJKVZmyZKLikIBGNIZZbWRqSsuZSRQ3IARUkk_Iw-nuwbXfHfpQbNvONf3LgiVcSSESlfQteWpZ13rvsCpsHXSo2yY4Xe-KGIpBXzHoKwZ9xVlfT8Z_yIOr99od_2XuT0yNiL_9DKSQwPkPAxJ9uQ
CODEN ITCSCH
CitedBy_id crossref_primary_10_1109_LCSYS_2024_3375156
crossref_primary_10_1109_LCSYS_2022_3223305
crossref_primary_10_1109_TCSI_2021_3134816
crossref_primary_10_1016_j_cnsns_2025_108692
crossref_primary_10_1109_TCSI_2022_3177407
crossref_primary_10_1109_JSYST_2021_3085346
crossref_primary_10_1002_asjc_3413
crossref_primary_10_1109_TAC_2021_3131145
crossref_primary_10_1109_TAC_2024_3386055
crossref_primary_10_1109_TCSI_2021_3050988
crossref_primary_10_1109_TCSII_2020_3047850
crossref_primary_10_1016_j_ins_2022_12_003
crossref_primary_10_1016_j_ins_2023_119579
crossref_primary_10_1002_asjc_2473
crossref_primary_10_1109_TSMC_2024_3351909
crossref_primary_10_1002_2050_7038_13039
crossref_primary_10_3390_e25020299
crossref_primary_10_1177_01423312231207682
crossref_primary_10_3390_s23084013
crossref_primary_10_1109_TNNLS_2022_3153028
crossref_primary_10_1109_TCSI_2021_3099626
crossref_primary_10_1002_rnc_7310
crossref_primary_10_1109_TCSI_2020_3037242
crossref_primary_10_1016_j_automatica_2023_110871
crossref_primary_10_1016_j_jfranklin_2022_10_045
crossref_primary_10_1016_j_neunet_2024_106270
crossref_primary_10_1016_j_isatra_2020_11_030
crossref_primary_10_1016_j_future_2020_11_023
crossref_primary_10_1109_TCSI_2020_3034979
crossref_primary_10_1109_TCSI_2020_3031663
crossref_primary_10_1109_TCNS_2022_3203365
crossref_primary_10_1002_asjc_2701
crossref_primary_10_1016_j_jfranklin_2021_01_035
crossref_primary_10_1016_j_knosys_2021_107939
crossref_primary_10_1109_TII_2024_3417248
crossref_primary_10_1002_rnc_6211
crossref_primary_10_1002_asjc_2506
crossref_primary_10_1002_asjc_2570
crossref_primary_10_1109_TNSE_2022_3168062
crossref_primary_10_1109_TSMC_2022_3147773
crossref_primary_10_1109_TCSI_2022_3226578
crossref_primary_10_1109_TCSI_2022_3233866
crossref_primary_10_1109_TCSI_2023_3302332
crossref_primary_10_1109_TFUZZ_2024_3370254
crossref_primary_10_1016_j_amc_2024_129185
crossref_primary_10_1109_TCSII_2020_3027592
crossref_primary_10_1109_TCNS_2023_3290110
crossref_primary_10_1016_j_ins_2024_120399
crossref_primary_10_1109_TCSI_2021_3071974
crossref_primary_10_1109_TNNLS_2022_3156279
crossref_primary_10_1109_TCYB_2025_3535958
crossref_primary_10_1109_TNSE_2020_3036755
Cites_doi 10.1109/TCSI.2019.2904747
10.1109/ACCESS.2019.2919992
10.1109/TCSII.2019.2900758
10.1007/978-1-84800-015-5
10.1137/1.9781611970777
10.1016/j.automatica.2016.07.041
10.1063/1.5093728
10.1109/TAC.2018.2849587
10.1109/TCSI.2017.2777504
10.1109/TCYB.2015.2494738
10.1109/TCSI.2010.2072270
10.1016/j.automatica.2018.08.017
10.1109/TCST.2017.2709266
10.1109/TSMCB.2012.2227723
10.1002/rnc.3990
10.1109/TCSI.2013.2252452
10.1109/TCSI.2017.2762420
10.1109/TCSI.2018.2877414
10.1007/s11424-017-6181-x
10.1109/MCAS.2010.937884
10.1016/j.neucom.2014.08.057
10.1109/TAC.2018.2885079
10.1109/TPWRS.2013.2271640
10.1109/TCYB.2018.2864974
10.1109/TSMC.2017.2659759
10.1080/00207721003658202
10.1137/19M1249515
10.1109/TCSI.2013.2295878
10.1109/TCSI.2019.2908085
10.1109/TCSI.2019.2904946
10.1109/TAC.2018.2797205
10.1109/TCSI.2016.2598822
10.1109/TAC.2004.841888
10.1109/TAC.2016.2564339
10.1109/TCYB.2019.2896160
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1109/TCSI.2020.2986953
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-0806
EndPage 3162
ExternalDocumentID 10_1109_TCSI_2020_2986953
9076703
Genre orig-research
GrantInformation_xml – fundername: Southeast University Zhongying Young Scholars Project
– fundername: National Natural Science Foundation of China
  grantid: 61722303
  funderid: 10.13039/501100001809
– fundername: Six Talent Peaks of Jiangsu Province
  grantid: 2019-DZXX-006
  funderid: 10.13039/501100010014
– fundername: Australian Research Council
  grantid: DP200101199
  funderid: 10.13039/501100000923
GroupedDBID 0R~
29I
4.4
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACIWK
AETIX
AGQYO
AGSQL
AHBIQ
AIBXA
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
HZ~
H~9
IFIPE
IPLJI
JAVBF
M43
O9-
OCL
PZZ
RIA
RIE
RNS
VJK
AAYXX
CITATION
RIG
7SP
8FD
L7M
ID FETCH-LOGICAL-c293t-a40ebd91bad6b38c70636b7c78fbdd26f3040aeebb2cab75bdc32b483b0660f73
IEDL.DBID RIE
ISSN 1549-8328
IngestDate Sun Jun 29 13:39:40 EDT 2025
Thu Apr 24 22:52:00 EDT 2025
Tue Jul 01 04:15:12 EDT 2025
Wed Aug 27 02:32:35 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 9
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c293t-a40ebd91bad6b38c70636b7c78fbdd26f3040aeebb2cab75bdc32b483b0660f73
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-0275-8387
0000-0001-9610-846X
0000-0003-0070-8597
0000-0003-1229-6278
PQID 2438766484
PQPubID 85411
PageCount 11
ParticipantIDs crossref_citationtrail_10_1109_TCSI_2020_2986953
ieee_primary_9076703
proquest_journals_2438766484
crossref_primary_10_1109_TCSI_2020_2986953
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2020-09-01
PublicationDateYYYYMMDD 2020-09-01
PublicationDate_xml – month: 09
  year: 2020
  text: 2020-09-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on circuits and systems. I, Regular papers
PublicationTitleAbbrev TCSI
PublicationYear 2020
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref35
ref13
ref34
ref12
ref15
ref14
ref31
ref30
ref33
ref11
ref32
ref10
ref2
ref1
ref17
ref16
ref19
ref18
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref28
ref27
ref29
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref3
  doi: 10.1109/TCSI.2019.2904747
– ident: ref18
  doi: 10.1109/ACCESS.2019.2919992
– ident: ref24
  doi: 10.1109/TCSII.2019.2900758
– ident: ref34
  doi: 10.1007/978-1-84800-015-5
– ident: ref31
  doi: 10.1137/1.9781611970777
– ident: ref19
  doi: 10.1016/j.automatica.2016.07.041
– ident: ref4
  doi: 10.1063/1.5093728
– ident: ref20
  doi: 10.1109/TAC.2018.2849587
– ident: ref6
  doi: 10.1109/TCSI.2017.2777504
– ident: ref11
  doi: 10.1109/TCYB.2015.2494738
– ident: ref8
  doi: 10.1109/TCSI.2010.2072270
– ident: ref23
  doi: 10.1016/j.automatica.2018.08.017
– ident: ref10
  doi: 10.1109/TCST.2017.2709266
– ident: ref17
  doi: 10.1109/TSMCB.2012.2227723
– ident: ref28
  doi: 10.1002/rnc.3990
– ident: ref14
  doi: 10.1109/TCSI.2013.2252452
– ident: ref21
  doi: 10.1109/TCSI.2017.2762420
– ident: ref29
  doi: 10.1109/TCSI.2018.2877414
– ident: ref2
  doi: 10.1007/s11424-017-6181-x
– ident: ref1
  doi: 10.1109/MCAS.2010.937884
– ident: ref26
  doi: 10.1016/j.neucom.2014.08.057
– ident: ref32
  doi: 10.1109/TAC.2018.2885079
– ident: ref13
  doi: 10.1109/TPWRS.2013.2271640
– ident: ref22
  doi: 10.1109/TCYB.2018.2864974
– ident: ref27
  doi: 10.1109/TSMC.2017.2659759
– ident: ref16
  doi: 10.1080/00207721003658202
– ident: ref30
  doi: 10.1137/19M1249515
– ident: ref35
  doi: 10.1109/TCSI.2013.2295878
– ident: ref9
  doi: 10.1109/TCSI.2019.2908085
– ident: ref33
  doi: 10.1109/TCSI.2019.2904946
– ident: ref7
  doi: 10.1109/TAC.2018.2797205
– ident: ref12
  doi: 10.1109/TCSI.2016.2598822
– ident: ref15
  doi: 10.1109/TAC.2004.841888
– ident: ref25
  doi: 10.1109/TAC.2016.2564339
– ident: ref5
  doi: 10.1109/TCYB.2019.2896160
SSID ssj0029031
Score 2.5114806
Snippet This paper addresses the consensus problem for two-layered MASs (multi-agent systems) subject to attacks on communication edges. Unlike most existing...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 3152
SubjectTerms Asymptotic properties
Computer simulation
Criteria
Dwell time
Graph theory
interaction topology
Laplace equations
Layered MAS
Liapunov functions
Linear matrix inequalities
Linear transformations
Matrix theory
Multiagent systems
Network topology
node-to-node consensus
Nodes
Oscillators
Switches
Symmetric matrices
Topology
uniform boundedness
Title Distributed Consensus of Layered Multi-Agent Systems Subject to Attacks on Edges
URI https://ieeexplore.ieee.org/document/9076703
https://www.proquest.com/docview/2438766484
Volume 67
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELZKJxh4FUShIA9MiLSJ7cTOWBWqgihCopW6RX5lASWIpgP8enxJGvESYsvgJJbP9t1n330fQucqMMIw7WAqCajHIClHxJZ5qQ0DKSJFKvWG6X00mbPbRbhoocumFsZaWyaf2T48lnf5JtcrOCobOCAXcaD23HDArarVasBV7NOKG5W5v1Ei6hvMwI8Hs9HjjUOCxO-TWERxSL_4oFJU5cdOXLqX8Q6arjtWZZU89VeF6uv3b5yN_-35Ltqu40w8rCbGHmrZbB9tfWIf7KCHKyDNBb0razAId4LqxRLnKb6TbyDhicvqXG8I1Ve4pjbHbqeBoxtc5HhYFFChj_MMXwNXxAGaj69no4lXCyx42nn5wpPMt8rEgZImUlRo7uKVSHHNRaqMIVFK3RKX1ipFtFQ8VEZTopigygUqfsrpIWpneWaPEJYyZS6SEsJoxULKJJDc8Dhl3FDhQFgX-eshT3TNPg4iGM9JiUL8OAErJWClpLZSF100r7xU1Bt_Ne7AqDcN6wHvot7arkm9OJcJYdT5gIgJdvz7WydoE75dpZL1ULt4XdlTF3sU6qycdB8kbNR7
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwzV1Lb9QwEB6VcoAeKFBQtw_wAS5I2Sa2kziHHlZ9aJduKyS2Um_Br1yoNhWbFWp_C3-l_60ziXdFKeJWiVsOTiJ7Pnnms2e-AfhgEqectEhTeSIiSUk5qvAyqnyaaJUZ3nVvOD3Lhufy80V6sQK_lrUw3vs2-cz36bG9y3e1ndNR2R4SuQwRGlIoT_z1TyRos_3RIVrzI-fHR5ODYRR6CEQWHVkTaRl744rEaJcZoWyOLjkzuc1VZZzjWYV0PtbeG8OtNnlqnBXcSCUM-uK4ygV-9wk8xTgj5V112JLOFbHo1Fglzk9wFe5Mk7jYmxx8HSH35HGfFyorUnHP67VtXB7s_a1DO16H28VSdHks3_vzxvTtzR8qkf_rWr2EFyGSZoMO-q9gxU9fw9pv-oob8OWQZIGpo5d3jFqTUl-PGasrNtbX1KSUtfXH0YDqy1gQb2e4l9LhFGtqNmga0iBg9ZQdkRrGGzh_lCm9hdVpPfWbwLSuJMaKSjlrZCqkJhmfvKhk7oRCmtmDeGHi0gZ9dWrzcVm2PCsuSkJFSagoAyp68Gn5ylUnLvKvwRtk5eXAYOAe7CxwVIbtZ1ZyKdDLZVLJrb-_9R6eDSen43I8OjvZhuf0ny5xbgdWmx9zv4uRVmPetYBn8O2xUXMHXsA0yg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Distributed+Consensus+of+Layered+Multi-Agent+Systems+Subject+to+Attacks+on+Edges&rft.jtitle=IEEE+transactions+on+circuits+and+systems.+I%2C+Regular+papers&rft.au=Wen%2C+Guanghui&rft.au=Wang%2C+Peijun&rft.au=Huang%2C+Tingwen&rft.au=Lu%2C+Jinhu&rft.date=2020-09-01&rft.pub=IEEE&rft.issn=1549-8328&rft.volume=67&rft.issue=9&rft.spage=3152&rft.epage=3162&rft_id=info:doi/10.1109%2FTCSI.2020.2986953&rft.externalDocID=9076703
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1549-8328&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1549-8328&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1549-8328&client=summon