Consensus of Multiagent Systems Subject to Partially Accessible and Overlapping Markovian Network Topologies

This paper addresses the consensus problem for a continuous-time multiagent system (MAS) with Markovian network topologies and external disturbance. Different from some existing results, global jumping modes of the Markovian network topologies are not required to be completely available for consensu...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on cybernetics Vol. 47; no. 8; pp. 1807 - 1819
Main Authors Ge, Xiaohua, Han, Qing-Long
Format Journal Article
LanguageEnglish
Published United States IEEE 01.08.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
Abstract This paper addresses the consensus problem for a continuous-time multiagent system (MAS) with Markovian network topologies and external disturbance. Different from some existing results, global jumping modes of the Markovian network topologies are not required to be completely available for consensus protocol design. A network topology mode regulator (NTMR) is first developed to decompose unavailable global modes into several overlapping groups, where overlapping groups refer to the scenario that there exist commonly shared local modes between any two distinct groups. The NTMR schedules which group modes each agent may access at every time step. Then a new group mode-dependent distributed consensus protocol on the basis of relative measurement outputs of neighboring agents is delicately constructed. In this sense, the proposed consensus protocol relies only on group and partial modes and eliminates the need for complete knowledge of global modes. Sufficient conditions on the existence of desired distributed consensus protocols are derived to ensure consensus of the MAS with a prescribed H_{\infty } performance level. Two examples are provided to show the effectiveness of the proposed consensus protocol.
AbstractList This paper addresses the consensus problem for a continuous-time multiagent system (MAS) with Markovian network topologies and external disturbance. Different from some existing results, global jumping modes of the Markovian network topologies are not required to be completely available for consensus protocol design. A network topology mode regulator (NTMR) is first developed to decompose unavailable global modes into several overlapping groups, where overlapping groups refer to the scenario that there exist commonly shared local modes between any two distinct groups. The NTMR schedules which group modes each agent may access at every time step. Then a new group mode-dependent distributed consensus protocol on the basis of relative measurement outputs of neighboring agents is delicately constructed. In this sense, the proposed consensus protocol relies only on group and partial modes and eliminates the need for complete knowledge of global modes. Sufficient conditions on the existence of desired distributed consensus protocols are derived to ensure consensus of the MAS with a prescribed H_{\infty } performance level. Two examples are provided to show the effectiveness of the proposed consensus protocol.
This paper addresses the consensus problem for a continuous-time multiagent system (MAS) with Markovian network topologies and external disturbance. Different from some existing results, global jumping modes of the Markovian network topologies are not required to be completely available for consensus protocol design. A network topology mode regulator (NTMR) is first developed to decompose unavailable global modes into several overlapping groups, where overlapping groups refer to the scenario that there exist commonly shared local modes between any two distinct groups. The NTMR schedules which group modes each agent may access at every time step. Then a new group mode-dependent distributed consensus protocol on the basis of relative measurement outputs of neighboring agents is delicately constructed. In this sense, the proposed consensus protocol relies only on group and partial modes and eliminates the need for complete knowledge of global modes. Sufficient conditions on the existence of desired distributed consensus protocols are derived to ensure consensus of the MAS with a prescribed $H_{\infty }$ performance level. Two examples are provided to show the effectiveness of the proposed consensus protocol.This paper addresses the consensus problem for a continuous-time multiagent system (MAS) with Markovian network topologies and external disturbance. Different from some existing results, global jumping modes of the Markovian network topologies are not required to be completely available for consensus protocol design. A network topology mode regulator (NTMR) is first developed to decompose unavailable global modes into several overlapping groups, where overlapping groups refer to the scenario that there exist commonly shared local modes between any two distinct groups. The NTMR schedules which group modes each agent may access at every time step. Then a new group mode-dependent distributed consensus protocol on the basis of relative measurement outputs of neighboring agents is delicately constructed. In this sense, the proposed consensus protocol relies only on group and partial modes and eliminates the need for complete knowledge of global modes. Sufficient conditions on the existence of desired distributed consensus protocols are derived to ensure consensus of the MAS with a prescribed $H_{\infty }$ performance level. Two examples are provided to show the effectiveness of the proposed consensus protocol.
Author Xiaohua Ge
Qing-Long Han
Author_xml – sequence: 1
  givenname: Xiaohua
  surname: Ge
  fullname: Ge, Xiaohua
– sequence: 2
  givenname: Qing-Long
  orcidid: 0000-0002-7207-0716
  surname: Han
  fullname: Han, Qing-Long
BackLink https://www.ncbi.nlm.nih.gov/pubmed/27295697$$D View this record in MEDLINE/PubMed
BookMark eNp9kUtvGyEUhVGVqEnT_ICqUoXUTTd2gXkAy9TqI1IeleIuuhoxzMXCwTAFJpX_fbHsepFF7oYr7nc46J436MQHDwi9o2ROKZGfl4vfX-aM0HbOGk5ES16hc0ZbMWOMNyfHvuVn6DKlNSklypUUr9EZ40w2reTnyC2CT-DTlHAw-HZy2aoV-IwftinDJuGHqV-DzjgH_FPFMnVui6-0hpRs7wArP-D7J4hOjaP1K3yr4mN4ssrjO8h_Q3zEyzAGF1YW0lt0apRLcHk4L9Cvb1-Xix-zm_vv14urm5muaplnrOrBsKpipiFKGSKHVis9sIHoVqqmbmDoSa8YqSvTCEL7VgjNdU0MMcLUrLpAn_bvjjH8mSDlbmOTBueUhzCljoqyFsLruinox2foOkzRl991VBaHVjDBC_XhQE39BoZujHaj4rb7v8cC0D2gY0gpgjkilHS7uLpdXN0uru4QV9HwZxpts8o2-ByVdS8q3--VFgCOTrwuM8mqf3yYopQ
CODEN ITCEB8
CitedBy_id crossref_primary_10_1007_s11071_017_3873_7
crossref_primary_10_1109_ACCESS_2021_3115047
crossref_primary_10_1016_j_ins_2018_02_021
crossref_primary_10_1016_j_ins_2019_07_003
crossref_primary_10_1109_TNSE_2023_3235930
crossref_primary_10_1109_TCYB_2018_2815549
crossref_primary_10_1109_JAS_2021_1004165
crossref_primary_10_1016_j_jfranklin_2018_11_051
crossref_primary_10_1016_j_neucom_2019_03_088
crossref_primary_10_1155_2018_8124861
crossref_primary_10_1016_j_neucom_2019_03_089
crossref_primary_10_1109_TCYB_2018_2829713
crossref_primary_10_1016_j_neucom_2018_11_085
crossref_primary_10_1109_TCYB_2019_2957415
crossref_primary_10_1109_TIE_2016_2613929
crossref_primary_10_1016_j_automatica_2021_109908
crossref_primary_10_1016_j_isatra_2020_11_007
crossref_primary_10_1109_TCYB_2017_2659698
crossref_primary_10_1109_TCYB_2018_2799929
crossref_primary_10_1177_01423312231162970
crossref_primary_10_1016_j_jfranklin_2019_12_026
crossref_primary_10_1016_j_neucom_2020_03_012
crossref_primary_10_1109_TII_2023_3332951
crossref_primary_10_1016_j_neucom_2019_10_039
crossref_primary_10_3390_electronics12030636
crossref_primary_10_1080_00207721_2020_1869343
crossref_primary_10_1080_23307706_2023_2203682
crossref_primary_10_1109_TSMC_2019_2961753
crossref_primary_10_1109_TCYB_2024_3419830
crossref_primary_10_1109_TSMC_2019_2919146
crossref_primary_10_1109_TSMC_2020_2983133
crossref_primary_10_1177_01423312221117083
crossref_primary_10_1016_j_ins_2019_08_052
crossref_primary_10_1007_s12555_023_0409_4
crossref_primary_10_1016_j_jfranklin_2022_08_030
crossref_primary_10_1016_j_ins_2018_04_016
crossref_primary_10_1016_j_neucom_2019_03_091
crossref_primary_10_1109_TCYB_2018_2839360
crossref_primary_10_1016_j_neucom_2020_04_006
crossref_primary_10_1109_TCYB_2020_3005354
crossref_primary_10_1016_j_neucom_2020_07_032
crossref_primary_10_1109_TCYB_2019_2900478
crossref_primary_10_3934_mbe_2023637
crossref_primary_10_1016_j_neucom_2019_03_096
crossref_primary_10_1016_j_ins_2018_06_044
crossref_primary_10_1080_00207721_2021_1883765
crossref_primary_10_1016_j_jfranklin_2019_01_025
crossref_primary_10_1109_TCYB_2017_2708321
crossref_primary_10_1080_00207721_2021_1938280
crossref_primary_10_1109_ACCESS_2019_2946286
crossref_primary_10_1109_TCYB_2021_3054796
crossref_primary_10_1016_j_neucom_2020_01_076
crossref_primary_10_1109_TCYB_2016_2610419
crossref_primary_10_1109_TCYB_2021_3087710
crossref_primary_10_1109_TII_2018_2817248
crossref_primary_10_1109_TSMC_2018_2833203
crossref_primary_10_1109_TIE_2017_2752148
crossref_primary_10_1109_TCYB_2019_2923011
crossref_primary_10_1016_j_ins_2018_02_008
crossref_primary_10_1109_TCYB_2018_2813423
crossref_primary_10_1016_j_ins_2018_01_040
crossref_primary_10_1016_j_ins_2019_05_051
crossref_primary_10_1109_TCYB_2019_2912403
crossref_primary_10_1109_TCYB_2017_2701889
crossref_primary_10_1016_j_jfranklin_2018_07_042
crossref_primary_10_1109_TSMC_2018_2814572
crossref_primary_10_1177_0142331218799818
crossref_primary_10_1109_TCYB_2017_2789296
crossref_primary_10_1109_TCYB_2018_2856508
crossref_primary_10_1109_TSMC_2019_2912980
crossref_primary_10_1109_TCYB_2017_2789212
crossref_primary_10_1109_TCYB_2019_2901631
crossref_primary_10_1109_TSMC_2018_2875515
crossref_primary_10_1109_TETCI_2024_3386692
crossref_primary_10_1109_TCYB_2017_2769722
crossref_primary_10_1109_TCYB_2018_2868786
crossref_primary_10_1016_j_neucom_2018_07_086
crossref_primary_10_1016_j_jfranklin_2019_01_016
crossref_primary_10_1109_TCSI_2019_2904747
crossref_primary_10_1109_TCYB_2020_2970556
crossref_primary_10_1109_TCYB_2020_3010947
crossref_primary_10_1016_j_ins_2018_04_085
crossref_primary_10_1109_TCNS_2023_3282131
crossref_primary_10_1109_TCSI_2019_2948015
crossref_primary_10_1016_j_jfranklin_2018_09_028
crossref_primary_10_1016_j_ins_2019_05_049
crossref_primary_10_1109_TCYB_2020_3030037
crossref_primary_10_1109_TCNS_2022_3158817
crossref_primary_10_1109_TCYB_2017_2716970
crossref_primary_10_1016_j_physa_2019_123949
crossref_primary_10_1109_TCYB_2019_2931008
crossref_primary_10_1016_j_nahs_2021_101085
crossref_primary_10_1002_rnc_7054
crossref_primary_10_1109_ACCESS_2019_2914922
crossref_primary_10_1109_TCYB_2018_2799858
crossref_primary_10_1016_j_jfranklin_2023_03_016
crossref_primary_10_1109_TNSE_2019_2911713
crossref_primary_10_1109_TCYB_2019_2922740
crossref_primary_10_53941_ijndi0101008
crossref_primary_10_1016_j_neucom_2019_04_015
crossref_primary_10_1049_cth2_12098
crossref_primary_10_1109_TNSE_2023_3252598
crossref_primary_10_1109_JSYST_2023_3307686
crossref_primary_10_1016_j_amc_2019_124560
crossref_primary_10_1109_TCYB_2018_2890645
crossref_primary_10_1016_j_neucom_2017_10_008
crossref_primary_10_1016_j_neucom_2017_10_009
crossref_primary_10_1109_ACCESS_2020_3028366
crossref_primary_10_1002_rnc_6313
crossref_primary_10_1109_TCYB_2018_2868169
crossref_primary_10_1109_TCYB_2018_2885567
crossref_primary_10_1016_j_jfranklin_2018_07_027
crossref_primary_10_1002_asjc_1636
crossref_primary_10_1109_TCYB_2018_2840430
crossref_primary_10_1109_TCYB_2020_3021350
crossref_primary_10_1109_TCYB_2019_2903817
crossref_primary_10_1109_TCYB_2017_2753382
crossref_primary_10_1016_j_ins_2020_08_013
crossref_primary_10_1016_j_ins_2018_03_011
crossref_primary_10_1016_j_neucom_2019_04_080
crossref_primary_10_1016_j_neucom_2019_04_081
crossref_primary_10_1109_TCYB_2017_2714173
crossref_primary_10_1016_j_neucom_2019_04_084
crossref_primary_10_1109_TCYB_2018_2831684
crossref_primary_10_1109_TSMC_2018_2867900
crossref_primary_10_1016_j_ins_2017_12_052
crossref_primary_10_1016_j_isatra_2024_11_054
crossref_primary_10_1109_TCYB_2019_2955543
crossref_primary_10_1016_j_ins_2018_04_054
crossref_primary_10_1109_TCYB_2017_2786474
crossref_primary_10_1007_s00034_023_02404_4
crossref_primary_10_1016_j_amc_2018_04_067
crossref_primary_10_1109_TCYB_2017_2766762
crossref_primary_10_1109_TCYB_2018_2864974
crossref_primary_10_1109_TCYB_2020_3008020
crossref_primary_10_1109_TIE_2017_2701778
crossref_primary_10_1109_TNNLS_2021_3055761
crossref_primary_10_1002_acs_3749
crossref_primary_10_1109_TNSE_2018_2876262
crossref_primary_10_1007_s11063_022_11128_6
crossref_primary_10_1109_TCYB_2020_2985043
crossref_primary_10_1109_TCYB_2022_3166649
crossref_primary_10_1016_j_cnsns_2023_107618
crossref_primary_10_1016_j_ins_2019_02_047
crossref_primary_10_1109_ACCESS_2020_3041243
crossref_primary_10_1007_s11432_017_9169_4
crossref_primary_10_1109_TCYB_2018_2879905
crossref_primary_10_1016_j_jfranklin_2019_11_032
crossref_primary_10_1007_s11071_020_05885_z
crossref_primary_10_1109_TCYB_2017_2771560
crossref_primary_10_1109_TCYB_2018_2827037
crossref_primary_10_1016_j_fss_2019_11_005
crossref_primary_10_1016_j_neucom_2021_07_027
crossref_primary_10_1016_j_automatica_2020_109128
crossref_primary_10_1002_asjc_1612
crossref_primary_10_1109_TCNS_2022_3213710
crossref_primary_10_1109_TCSI_2023_3242677
crossref_primary_10_1109_TCYB_2019_2921821
crossref_primary_10_1016_j_ins_2018_02_050
crossref_primary_10_1115_1_4041202
crossref_primary_10_1002_asjc_3466
crossref_primary_10_1109_TCSII_2019_2922311
crossref_primary_10_1109_JSYST_2021_3079181
crossref_primary_10_1109_TCYB_2019_2915941
crossref_primary_10_1007_s00034_021_01744_3
crossref_primary_10_1109_TCYB_2018_2870543
crossref_primary_10_1109_TNNLS_2021_3093700
crossref_primary_10_1007_s40435_023_01271_w
crossref_primary_10_1109_TCYB_2019_2927471
crossref_primary_10_1109_TCNS_2017_2718669
crossref_primary_10_1109_TAC_2020_3034212
crossref_primary_10_1080_00207721_2021_1884917
crossref_primary_10_3390_s20236866
crossref_primary_10_1109_TCYB_2019_2909784
crossref_primary_10_1109_TCYB_2018_2868994
crossref_primary_10_1109_ACCESS_2020_3036447
crossref_primary_10_1080_00207721_2021_1998843
crossref_primary_10_1016_j_nahs_2020_100969
Cites_doi 10.1109/TNN.2008.2004404
10.1016/j.sysconle.2012.04.003
10.1109/TAC.2004.834113
10.1016/j.automatica.2014.05.022
10.1109/TAC.2007.900839
10.1109/TAC.2009.2015558
10.1109/TII.2012.2219061
10.1109/TAC.2010.2042982
10.1049/iet-cta.2013.1109
10.1049/iet-cta.2014.0006
10.1016/j.automatica.2010.06.016
10.1109/MCS.2007.338264
10.1016/j.automatica.2013.07.024
10.1109/TCSI.2013.2265978
10.1109/TAC.2012.2188353
10.1016/j.automatica.2015.09.028
10.1016/j.automatica.2012.02.032
10.1049/iet-cta.2014.0057
10.1109/TCSI.2013.2268091
10.1016/j.automatica.2014.03.017
10.1016/j.automatica.2006.07.017
10.1109/TCYB.2015.2398892
10.1080/03081079.2014.883715
10.1080/00207170903267039
10.1109/TAC.2008.919571
10.1016/j.automatica.2013.01.063
10.1007/s11424-009-9145-y
10.1109/TAC.2009.2020638
10.1109/JPROC.2006.887293
10.1016/j.automatica.2009.07.005
10.1016/j.automatica.2013.04.021
10.1109/ROBOT.2003.1242005
10.1080/21642583.2014.897658
10.1016/j.automatica.2013.03.005
10.1016/j.automatica.2012.09.010
10.1016/j.automatica.2013.12.006
10.1016/j.sysconle.2011.07.004
10.1109/TAC.2004.841935
10.1109/TCYB.2014.2366204
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017
DBID 97E
RIA
RIE
AAYXX
CITATION
NPM
7SC
7SP
7TB
8FD
F28
FR3
H8D
JQ2
L7M
L~C
L~D
7X8
DOI 10.1109/TCYB.2016.2570860
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
PubMed
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
Aerospace Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
DatabaseTitle CrossRef
PubMed
Aerospace Database
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
DatabaseTitleList
Aerospace Database
MEDLINE - Academic
PubMed
Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 2
  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 Sciences (General)
EISSN 2168-2275
EndPage 1819
ExternalDocumentID 27295697
10_1109_TCYB_2016_2570860
7486092
Genre orig-research
Journal Article
GrantInformation_xml – fundername: Australian Research Council Discovery Project
  grantid: DP160103567
  funderid: 10.13039/501100000923
GroupedDBID 0R~
4.4
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACIWK
AENEX
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
HZ~
IFIPE
IPLJI
JAVBF
M43
O9-
OCL
PQQKQ
RIA
RIE
RNS
AAYXX
CITATION
RIG
NPM
7SC
7SP
7TB
8FD
F28
FR3
H8D
JQ2
L7M
L~C
L~D
7X8
ID FETCH-LOGICAL-c349t-23bef2332f50aaf09d6cacd2d0c69a545edb0ba2043f5801b688c7c40f0f8f423
IEDL.DBID RIE
ISSN 2168-2267
2168-2275
IngestDate Thu Jul 10 21:11:00 EDT 2025
Sun Jun 29 13:40:13 EDT 2025
Mon Jul 21 05:51:29 EDT 2025
Tue Jul 01 04:35:07 EDT 2025
Thu Apr 24 22:52:01 EDT 2025
Tue Aug 26 16:38:57 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 8
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c349t-23bef2332f50aaf09d6cacd2d0c69a545edb0ba2043f5801b688c7c40f0f8f423
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ORCID 0000-0002-7207-0716
PMID 27295697
PQID 1920468287
PQPubID 85422
PageCount 13
ParticipantIDs proquest_journals_1920468287
crossref_primary_10_1109_TCYB_2016_2570860
pubmed_primary_27295697
ieee_primary_7486092
crossref_citationtrail_10_1109_TCYB_2016_2570860
proquest_miscellaneous_1826707445
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2017-08-01
PublicationDateYYYYMMDD 2017-08-01
PublicationDate_xml – month: 08
  year: 2017
  text: 2017-08-01
  day: 01
PublicationDecade 2010
PublicationPlace United States
PublicationPlace_xml – name: United States
– name: Piscataway
PublicationTitle IEEE transactions on cybernetics
PublicationTitleAbbrev TCYB
PublicationTitleAlternate IEEE Trans Cybern
PublicationYear 2017
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
ref37
ref15
ref36
ref14
ref31
ref30
ref33
ref11
ref10
ref2
ref1
ref39
ref17
ref38
ref16
ref19
wu (ref18) 2015
ref24
ref26
ref25
ref20
ref42
ref41
shi (ref32) 2009; 54
ref21
ref43
lin (ref44) 2008
ref28
ref27
he (ref23) 2015
ref29
ref8
ref7
ref9
ref3
ref6
ref5
he (ref22) 2015
ref40
ge (ref4) 2015
References_xml – ident: ref38
  doi: 10.1109/TNN.2008.2004404
– ident: ref41
  doi: 10.1016/j.sysconle.2012.04.003
– ident: ref7
  doi: 10.1109/TAC.2004.834113
– ident: ref25
  doi: 10.1016/j.automatica.2014.05.022
– ident: ref33
  doi: 10.1109/TAC.2007.900839
– year: 2015
  ident: ref22
  article-title: Network-based leader-following consensus of nonlinear multi-agent systems via distributed impulsive control
  publication-title: Inf Sci
– ident: ref35
  doi: 10.1109/TAC.2009.2015558
– ident: ref5
  doi: 10.1109/TII.2012.2219061
– ident: ref8
  doi: 10.1109/TAC.2010.2042982
– ident: ref11
  doi: 10.1049/iet-cta.2013.1109
– ident: ref30
  doi: 10.1049/iet-cta.2014.0006
– ident: ref37
  doi: 10.1016/j.automatica.2010.06.016
– ident: ref3
  doi: 10.1109/MCS.2007.338264
– ident: ref36
  doi: 10.1016/j.automatica.2013.07.024
– ident: ref12
  doi: 10.1109/TCSI.2013.2265978
– ident: ref28
  doi: 10.1109/TAC.2012.2188353
– ident: ref21
  doi: 10.1016/j.automatica.2015.09.028
– ident: ref39
  doi: 10.1016/j.automatica.2012.02.032
– start-page: 1564
  year: 2008
  ident: ref44
  article-title: Distributed leadless coordination for networks of second-order agents with time-delay on switching topology
  publication-title: Proc Amer Control Conf
– ident: ref40
  doi: 10.1049/iet-cta.2014.0057
– ident: ref16
  doi: 10.1109/TCSI.2013.2268091
– ident: ref6
  doi: 10.1016/j.automatica.2014.03.017
– ident: ref34
  doi: 10.1016/j.automatica.2006.07.017
– ident: ref17
  doi: 10.1109/TCYB.2015.2398892
– ident: ref27
  doi: 10.1080/03081079.2014.883715
– ident: ref43
  doi: 10.1080/00207170903267039
– ident: ref31
  doi: 10.1109/TAC.2008.919571
– year: 2015
  ident: ref18
  article-title: Distributed consensus of stochastic delayed multi-agent systems under asynchronous switching
  publication-title: IEEE Trans Cybern
– ident: ref19
  doi: 10.1016/j.automatica.2013.01.063
– ident: ref20
  doi: 10.1007/s11424-009-9145-y
– volume: 54
  start-page: 1668
  year: 2009
  ident: ref32
  article-title: Output feedback stabilization of networked control systems with random delays modeled by Markov chains
  publication-title: IEEE Trans Autom Control
  doi: 10.1109/TAC.2009.2020638
– year: 2015
  ident: ref23
  article-title: Sampled-data leader-following consensus of nonlinear multi-agent systems with stochastic sampling
  publication-title: IEEE Trans Cybern
– ident: ref1
  doi: 10.1109/JPROC.2006.887293
– ident: ref26
  doi: 10.1016/j.automatica.2009.07.005
– ident: ref14
  doi: 10.1016/j.automatica.2013.04.021
– ident: ref42
  doi: 10.1109/ROBOT.2003.1242005
– ident: ref2
  doi: 10.1080/21642583.2014.897658
– ident: ref10
  doi: 10.1016/j.automatica.2013.03.005
– ident: ref29
  doi: 10.1016/j.automatica.2012.09.010
– ident: ref15
  doi: 10.1016/j.automatica.2013.12.006
– ident: ref9
  doi: 10.1016/j.sysconle.2011.07.004
– year: 2015
  ident: ref4
  article-title: Distributed networked control systems: A brief overview
  publication-title: Inf Sci
– ident: ref24
  doi: 10.1109/TAC.2004.841935
– ident: ref13
  doi: 10.1109/TCYB.2014.2366204
SSID ssj0000816898
Score 2.5391831
Snippet This paper addresses the consensus problem for a continuous-time multiagent system (MAS) with Markovian network topologies and external disturbance. Different...
SourceID proquest
pubmed
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 1807
SubjectTerms Accessibility
Consensus
Distributed processing
Eigenvalues and eigenfunctions
Markov processes
Markovian network topologies
Multi-agent systems
Multiagent systems
multiagent systems (MASs)
Network topologies
Network topology
network topology mode regulator (NTMR)
overlapping modes
Protocol
Protocol (computers)
Protocols
Schedules
Switches
Topology
Title Consensus of Multiagent Systems Subject to Partially Accessible and Overlapping Markovian Network Topologies
URI https://ieeexplore.ieee.org/document/7486092
https://www.ncbi.nlm.nih.gov/pubmed/27295697
https://www.proquest.com/docview/1920468287
https://www.proquest.com/docview/1826707445
Volume 47
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT9wwEB5RTlzaAn1sC8hIPZSqWUwezvoICISQoBwWiZ4iPxEiSlA3iwS_nhnHG1VVQdwixXESzdj-xp75PoBvMtC6eQxTvRUJzpIykTYtE5z5XDZRODYV1Q6fnYuTy_z0qrhagp9DLYxzLiSfuTFdhrN825o5bZXtlqSYJHHCfYOBW1-rNeynBAGJIH2b4kWCqKKMh5h7XO5OD38fUB6XGJNqG_ZCJMCIKwtBbE9_rUhBYuV5tBlWneN3cLb43j7Z5HY87_TYPP5D5fjaH3oPbyP8ZPu9v6zCkmvWYDUO8Bn7Hlmod9ahJilP0sGYsdazUKerqAyLRY5zhlMO7eGwrmUX5H-qrh_YftBfvNG1Y6qx7Nc9bRcSBcQ1o6qg9h69kZ33qeds2gs0YKz-AS6Pj6aHJ0mUZkhMlssuSTPtfJplqS-4Up5LK4wyNrXcCKkQlTmruVZUeOsLXAS1mExMadAruJ94hHAfYblpG_cZGM-UFYXEuFGr3BdaYiMMbVPvCu8lL0bAF-apTOQtJ_mMugrxC5cVGbci41bRuCP4MTxy15N2vNR4nQwzNIw2GcHGwgeqOKxnFcJhngvSCBjB9nAbBySdsqjGtXNsgwFbicAsxy__1PvO0PfC5b78_51fYSUl1BDyCzdgufszd5uIeTq9FZz9CdnT-pw
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3BbtQwEB1V5QAXoBToQgEjcQBEtsaJnfWxVFQLdBcOW6mcItuxESJKEJutBF_PjOONEALELVIcJ9GM7Tf2zHsAT3SkdQsYpoZaZThL6kzXosxw5vP5zODYNFQ7vFiq-Xnx9kJe7MCLsRbGex-Tz_yULuNZft25DW2VHZWkmKRxwr2C674UQ7XWuKMSJSSi-K3AiwxxRZmOMV9yfbQ6-fiKMrnUlHTbsB-iAUZkKRXxPf2yJkWRlb_jzbjunN6AxfaLh3STL9NNb6fux29kjv_7SzfhegKg7HjwmD3Y8e0t2EtDfM2eJh7qZ_vQkJgnKWGsWRdYrNQ1VIjFEss5w0mHdnFY37EP5IGmab6z46jA-Nk2npm2Zu8vacOQSCA-MaoL6i7RH9lySD5nq0GiAaP123B--np1Ms-SOEPm8kL3mcitDyLPRZDcmMB1rZxxtai5U9qgfXxtuTVUehskLoNWzWaudOgXPMwCgrg7sNt2rT8AxnNTK6kxcrSmCNJqbITBrQhehqC5nADfmqdyibmcBDSaKkYwXFdk3IqMWyXjTuD5-MjXgbbjX433yTBjw2STCRxufaBKA3tdISDmhSKVgAk8Hm_jkKRzFtP6boNtMGQrEZoV-OV3B98Z-9663L0_v_MRXJ2vFmfV2Zvlu_twTRCGiNmGh7Dbf9v4B4iAevswOv5PEpj95g
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=Consensus+of+Multiagent+Systems+Subject+to+Partially+Accessible+and+Overlapping+Markovian+Network+Topologies&rft.jtitle=IEEE+transactions+on+cybernetics&rft.au=Ge%2C+Xiaohua&rft.au=Qing-Long%2C+Han&rft.date=2017-08-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=2168-2267&rft.eissn=2168-2275&rft.volume=47&rft.issue=8&rft.spage=1807&rft_id=info:doi/10.1109%2FTCYB.2016.2570860&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2168-2267&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2168-2267&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2168-2267&client=summon