Leader–follower containment control over directed random graphs
The leader-follower consensus problem for multi-agent systems over directed random graphs is investigated. Motivated by the fact that inter-agent communication can be subject to random failure when agents perform tasks in a complex environment, a directed random graph is used to model the random los...
Saved in:
Published in | Automatica (Oxford) Vol. 66; pp. 56 - 62 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
01.04.2016
|
Subjects | |
Online Access | Get full text |
ISSN | 0005-1098 |
DOI | 10.1016/j.automatica.2015.12.016 |
Cover
Loading…
Abstract | The leader-follower consensus problem for multi-agent systems over directed random graphs is investigated. Motivated by the fact that inter-agent communication can be subject to random failure when agents perform tasks in a complex environment, a directed random graph is used to model the random loss of communication between agents, where the connection of the directed edge in the graph is assumed to be probabilistic and evolves according to a two-state Markov Model. In the leader-follower network, the leaders maintain a constant desired state and the followers update their states by communicating with local neighbors over the random communication network. Based on convex properties and a stochastic version of LaSalle's Invariance Principle, almost sure convergence of the followers' states to the convex hull spanned by the leaders' states is established for the leader-follower random network. A numerical simulation is provided to demonstrate the developed result. |
---|---|
AbstractList | The leader-follower consensus problem for multi-agent systems over directed random graphs is investigated. Motivated by the fact that inter-agent communication can be subject to random failure when agents perform tasks in a complex environment, a directed random graph is used to model the random loss of communication between agents, where the connection of the directed edge in the graph is assumed to be probabilistic and evolves according to a two-state Markov Model. In the leader-follower network, the leaders maintain a constant desired state and the followers update their states by communicating with local neighbors over the random communication network. Based on convex properties and a stochastic version of LaSalle's Invariance Principle, almost sure convergence of the followers' states to the convex hull spanned by the leaders' states is established for the leader-follower random network. A numerical simulation is provided to demonstrate the developed result. |
Author | Shea, John M. Kan, Zhen Dixon, Warren E. |
Author_xml | – sequence: 1 givenname: Zhen surname: Kan fullname: Kan, Zhen – sequence: 2 givenname: John M. surname: Shea fullname: Shea, John M. – sequence: 3 givenname: Warren E. surname: Dixon fullname: Dixon, Warren E. |
BookMark | eNqFkE1OwzAQhb0oEi1whyzZJHjcpHE2SFXFn1SJDaytwR5DqiQutgtixx24ISfBoUhIbFjNjN73njRvxiaDG4ixDHgBHBZnmwJ30fUYW42F4FAVIIokTNiUc17lwBt5yGYhbNJZghRTtlwTGvKf7x_WdZ17JZ9pN0Rsh56G-L1712XuJQmm9aQjmczjYFyfPXrcPoVjdmCxC3TyM4_Y_eXF3eo6X99e3ayW61yLRsRcY8MtYl2T1bWc23ohORAJKE2JFVgrrSl5euMBR8CYRSksoKiMtcCNnh-x033u1rvnHYWo-jZo6jocyO2CAglVIyvRlAmVe1R7F4Inq7a-7dG_KeBqbEpt1G9TamxKgVBJSNbzP1bdxoSNPWDb_R_wBZ5hfD4 |
CitedBy_id | crossref_primary_10_1109_LCSYS_2020_3019827 crossref_primary_10_1016_j_physa_2017_04_034 crossref_primary_10_1109_TAC_2023_3317505 crossref_primary_10_1155_2018_2501427 crossref_primary_10_1016_j_isatra_2024_02_035 crossref_primary_10_1109_TASE_2024_3439747 crossref_primary_10_1109_TCYB_2023_3252800 crossref_primary_10_1016_j_automatica_2017_01_044 crossref_primary_10_1016_j_automatica_2020_108992 crossref_primary_10_1109_TCNS_2021_3065650 crossref_primary_10_1109_TAC_2018_2884998 crossref_primary_10_1002_acs_2950 crossref_primary_10_1109_TCNS_2022_3144119 crossref_primary_10_3390_math10122010 crossref_primary_10_1109_ACCESS_2018_2876041 crossref_primary_10_1007_s12555_019_0106_5 crossref_primary_10_1016_j_jfranklin_2016_10_030 crossref_primary_10_1016_j_neucom_2017_05_073 crossref_primary_10_1016_j_amc_2020_125809 crossref_primary_10_1109_TNNLS_2018_2826847 crossref_primary_10_1109_TCYB_2020_2991514 crossref_primary_10_1080_00207179_2016_1214875 crossref_primary_10_1109_TCNS_2018_2873204 crossref_primary_10_1016_j_jfranklin_2018_04_009 crossref_primary_10_3390_s18030927 crossref_primary_10_1109_ACCESS_2019_2921950 crossref_primary_10_1103_PhysRevE_94_052310 crossref_primary_10_1109_TAC_2021_3074849 crossref_primary_10_1109_TCSII_2019_2932758 crossref_primary_10_1109_TAC_2018_2867594 crossref_primary_10_1109_TNNLS_2021_3121403 crossref_primary_10_1002_rnc_4919 crossref_primary_10_1016_j_neucom_2019_12_067 crossref_primary_10_1109_TCST_2018_2794336 crossref_primary_10_1109_TCYB_2018_2859159 crossref_primary_10_1109_TCSII_2024_3354808 crossref_primary_10_1002_mma_8289 crossref_primary_10_1109_TCYB_2018_2868470 crossref_primary_10_1115_1_4034745 crossref_primary_10_1109_ACCESS_2019_2940618 crossref_primary_10_1002_asjc_2775 crossref_primary_10_1016_j_sysconle_2020_104708 crossref_primary_10_1155_2021_4760249 crossref_primary_10_1016_j_automatica_2019_04_031 crossref_primary_10_1016_j_ins_2022_08_095 crossref_primary_10_1109_ACCESS_2023_3289316 |
Cites_doi | 10.1016/j.automatica.2014.05.018 10.1109/TAC.2010.2041612 10.1109/TAC.2007.904603 10.1109/MCS.2007.338264 10.1109/TAC.2008.930098 10.1109/TCNS.2014.2367363 10.1016/j.automatica.2012.01.020 10.1109/TAC.2011.2178883 10.1109/TAC.2014.2359306 10.1109/TAC.2006.878783 10.1109/TAC.2003.812781 10.1109/TAC.2005.858670 10.1109/TAC.2007.895897 10.1016/j.automatica.2010.09.005 10.1109/JPROC.2006.887293 10.1109/TAC.2007.895948 10.1016/j.automatica.2015.03.026 10.1016/j.automatica.2012.05.071 10.1109/TAC.2008.917743 10.1016/j.automatica.2009.10.021 10.1109/TAC.2012.2183177 10.1016/j.automatica.2011.01.077 10.1109/TAC.2011.2174680 10.1016/j.automatica.2012.02.032 |
ContentType | Journal Article |
DBID | AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
DOI | 10.1016/j.automatica.2015.12.016 |
DatabaseName | CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
DatabaseTitleList | Technology Research Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EndPage | 62 |
ExternalDocumentID | 10_1016_j_automatica_2015_12_016 |
GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 3R3 4.4 457 4G. 5GY 5VS 6TJ 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AATTM AAXKI AAXUO AAYWO AAYXX ABFNM ABFRF ABJNI ABMAC ABUCO ABWVN ABXDB ACBEA ACDAQ ACGFO ACGFS ACNNM ACRLP ACRPL ACVFH ADBBV ADCNI ADEZE ADIYS ADMUD ADNMO ADTZH AEBSH AECPX AEFWE AEIPS AEKER AENEX AEUPX AFFNX AFJKZ AFPUW AFTJW AFXIZ AGCQF AGHFR AGQPQ AGRNS AGUBO AGYEJ AHHHB AHJVU AHPGS AI. AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU APLSM APXCP ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC BNPGV CITATION CS3 EBS EFJIC EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ RXW SBC SDF SDG SDP SES SET SEW SPC SPCBC SSB SSD SSH SST SSZ T5K T9H TAE TN5 VH1 WH7 WUQ X6Y XPP ZMT ~G- 7SC 7SP 8FD JQ2 L7M L~C L~D |
ID | FETCH-LOGICAL-c292t-ca90faa77efc783f76801ee214d4a51ff8fd40101bafc78dd642f1a25dff10dc3 |
ISSN | 0005-1098 |
IngestDate | Fri Jul 11 15:27:01 EDT 2025 Tue Jul 01 00:43:37 EDT 2025 Thu Apr 24 23:07:39 EDT 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c292t-ca90faa77efc783f76801ee214d4a51ff8fd40101bafc78dd642f1a25dff10dc3 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
PQID | 1815985294 |
PQPubID | 23500 |
PageCount | 7 |
ParticipantIDs | proquest_miscellaneous_1815985294 crossref_primary_10_1016_j_automatica_2015_12_016 crossref_citationtrail_10_1016_j_automatica_2015_12_016 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2016-04-00 20160401 |
PublicationDateYYYYMMDD | 2016-04-01 |
PublicationDate_xml | – month: 04 year: 2016 text: 2016-04-00 |
PublicationDecade | 2010 |
PublicationTitle | Automatica (Oxford) |
PublicationYear | 2016 |
References | Wu (10.1016/j.automatica.2015.12.016_br000130) 2006; 51 Cao (10.1016/j.automatica.2015.12.016_br000010) 2012; 48 Ren (10.1016/j.automatica.2015.12.016_br000105) 2007; 27 Jadbabaie (10.1016/j.automatica.2015.12.016_br000035) 2003; 48 Meng (10.1016/j.automatica.2015.12.016_br000085) 2010; 46 Olfati-Saber (10.1016/j.automatica.2015.12.016_br000095) 2007; 95 Dimarogonas (10.1016/j.automatica.2015.12.016_br000020) 2007; 52 Kan (10.1016/j.automatica.2015.12.016_br000055) 2015; 2 Wang (10.1016/j.automatica.2015.12.016_br000125) 2015; 60 Kan (10.1016/j.automatica.2015.12.016_br000045) 2012; 57 Tahbaz-Salehi (10.1016/j.automatica.2015.12.016_br000110) 2008; 53 Lou (10.1016/j.automatica.2015.12.016_br000075) 2012; 48 Ji (10.1016/j.automatica.2015.12.016_br000040) 2008; 53 Kushner (10.1016/j.automatica.2015.12.016_br000065) 1971 Wang (10.1016/j.automatica.2015.12.016_br000120) 2014; 50 Hatano (10.1016/j.automatica.2015.12.016_br000030) 2005; 50 Zhang (10.1016/j.automatica.2015.12.016_br000135) 2010; 55 Zhang (10.1016/j.automatica.2015.12.016_br000140) 2012; 57 Zhu (10.1016/j.automatica.2015.12.016_br000145) 2010; 46 Grimmett (10.1016/j.automatica.2015.12.016_br000025) 2001 Khalil (10.1016/j.automatica.2015.12.016_br000060) 2002 Porfiri (10.1016/j.automatica.2015.12.016_br000100) 2007; 52 10.1016/j.automatica.2015.12.016_br000015 Kan (10.1016/j.automatica.2015.12.016_br000050) 2015; 56 Notarstefano (10.1016/j.automatica.2015.12.016_br000090) 2011; 47 Boyd (10.1016/j.automatica.2015.12.016_br000005) 2004 Mei (10.1016/j.automatica.2015.12.016_br000080) 2012; 48 Tanner (10.1016/j.automatica.2015.12.016_br000115) 2007; 52 Li (10.1016/j.automatica.2015.12.016_br000070) 2012; 57 |
References_xml | – volume: 50 start-page: 1922 issue: 7 year: 2014 ident: 10.1016/j.automatica.2015.12.016_br000120 article-title: Containment control of multi-agent systems in a noisy communication environment publication-title: Automatica doi: 10.1016/j.automatica.2014.05.018 – volume: 55 start-page: 939 issue: 4 year: 2010 ident: 10.1016/j.automatica.2015.12.016_br000135 article-title: Consensus of data-sampled multi-agent systems with random communication delay and packet loss publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2010.2041612 – volume: 52 start-page: 1767 issue: 9 year: 2007 ident: 10.1016/j.automatica.2015.12.016_br000100 article-title: Consensus seeking over random weighted directed graphs publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2007.904603 – volume: 27 start-page: 71 year: 2007 ident: 10.1016/j.automatica.2015.12.016_br000105 article-title: Information consensus in multivehicle cooperative control publication-title: IEEE Control Systems Magazine doi: 10.1109/MCS.2007.338264 – year: 2001 ident: 10.1016/j.automatica.2015.12.016_br000025 – volume: 53 start-page: 1972 issue: 8 year: 2008 ident: 10.1016/j.automatica.2015.12.016_br000040 article-title: Containment control in mobile networks publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2008.930098 – year: 2004 ident: 10.1016/j.automatica.2015.12.016_br000005 – volume: 2 start-page: 24 issue: 1 year: 2015 ident: 10.1016/j.automatica.2015.12.016_br000055 article-title: Graph matching based formation reconfiguration of networked agents with connectivity maintenance publication-title: IEEE Transactions on Control of Network Systems doi: 10.1109/TCNS.2014.2367363 – volume: 48 start-page: 653 issue: 4 year: 2012 ident: 10.1016/j.automatica.2015.12.016_br000080 article-title: Distributed containment control for Lagrangian networks with parametric uncertainties under a directed graph publication-title: Automatica doi: 10.1016/j.automatica.2012.01.020 – volume: 57 start-page: 1827 issue: 7 year: 2012 ident: 10.1016/j.automatica.2015.12.016_br000045 article-title: Network connectivity preserving formation stabilization and obstacle avoidance via a decentralized controller publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2011.2178883 – volume: 60 start-page: 1374 issue: 5 year: 2015 ident: 10.1016/j.automatica.2015.12.016_br000125 article-title: Seeking consensus in networks of linear agents: communication noises and Markovian switching topologies publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2014.2359306 – volume: 51 start-page: 1207 issue: 7 year: 2006 ident: 10.1016/j.automatica.2015.12.016_br000130 article-title: Synchronization and convergence of linear dynamics in random directed networks publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2006.878783 – volume: 48 start-page: 988 issue: 6 year: 2003 ident: 10.1016/j.automatica.2015.12.016_br000035 article-title: Coordination of groups of mobile autonomous agents using nearest neighbor rules publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2003.812781 – volume: 50 start-page: 1867 issue: 11 year: 2005 ident: 10.1016/j.automatica.2015.12.016_br000030 article-title: Agreement over random networks publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2005.858670 – volume: 52 start-page: 916 issue: 5 year: 2007 ident: 10.1016/j.automatica.2015.12.016_br000020 article-title: On the rendezvous problem for multiple nonholonomic agents publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2007.895897 – volume: 46 start-page: 2092 issue: 12 year: 2010 ident: 10.1016/j.automatica.2015.12.016_br000085 article-title: Distributed finite-time attitude containment control for multiple rigid bodies publication-title: Automatica doi: 10.1016/j.automatica.2010.09.005 – volume: 95 start-page: 215 issue: 1 year: 2007 ident: 10.1016/j.automatica.2015.12.016_br000095 article-title: Consensus and cooperation in networked multi-agent systems publication-title: Proceedings of the IEEE doi: 10.1109/JPROC.2006.887293 – volume: 52 start-page: 863 issue: 5 year: 2007 ident: 10.1016/j.automatica.2015.12.016_br000115 article-title: Flocking in fixed and switching networks publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2007.895948 – volume: 56 start-page: 86 year: 2015 ident: 10.1016/j.automatica.2015.12.016_br000050 article-title: Containment control for a social network with state-dependent connectivity publication-title: Automatica doi: 10.1016/j.automatica.2015.03.026 – year: 1971 ident: 10.1016/j.automatica.2015.12.016_br000065 – volume: 48 start-page: 1586 year: 2012 ident: 10.1016/j.automatica.2015.12.016_br000010 article-title: Distributed containment control with multiple stationary or dynamic leaders in fixed and switching directed networks publication-title: Automatica doi: 10.1016/j.automatica.2012.05.071 – ident: 10.1016/j.automatica.2015.12.016_br000015 – volume: 53 start-page: 791 issue: 3 year: 2008 ident: 10.1016/j.automatica.2015.12.016_br000110 article-title: A necessary and sufficient condition for consensus over random networks publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2008.917743 – volume: 46 start-page: 322 issue: 2 year: 2010 ident: 10.1016/j.automatica.2015.12.016_br000145 article-title: Discrete-time dynamic average consensus publication-title: Automatica doi: 10.1016/j.automatica.2009.10.021 – volume: 57 start-page: 2127 issue: 8 year: 2012 ident: 10.1016/j.automatica.2015.12.016_br000140 article-title: Maximum allowable loss probability for consensus of multi-agent systems over random weighted lossy networks publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2012.2183177 – volume: 47 start-page: 1035 issue: 5 year: 2011 ident: 10.1016/j.automatica.2015.12.016_br000090 article-title: Containment in leader–follower networks with switching communication topologies publication-title: Automatica doi: 10.1016/j.automatica.2011.01.077 – volume: 57 start-page: 1553 issue: 6 year: 2012 ident: 10.1016/j.automatica.2015.12.016_br000070 article-title: Distributed containment control with multiple dynamic leaders for double-integrator dynamics using only position measurements publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2011.2174680 – year: 2002 ident: 10.1016/j.automatica.2015.12.016_br000060 – volume: 48 start-page: 879 issue: 5 year: 2012 ident: 10.1016/j.automatica.2015.12.016_br000075 article-title: Target containment control of multi-agent systems with random switching interconnection topologies publication-title: Automatica doi: 10.1016/j.automatica.2012.02.032 |
SSID | ssj0004182 |
Score | 2.442566 |
Snippet | The leader-follower consensus problem for multi-agent systems over directed random graphs is investigated. Motivated by the fact that inter-agent communication... |
SourceID | proquest crossref |
SourceType | Aggregation Database Enrichment Source Index Database |
StartPage | 56 |
SubjectTerms | Computer simulation Constants Containment Failure Followers Graphs Markov models Networks |
Title | Leader–follower containment control over directed random graphs |
URI | https://www.proquest.com/docview/1815985294 |
Volume | 66 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3LSsNAFB2qbnQhPvFNBHclpZPMpJNlEUWFumqxuAmTeaCiqWgK4kL8B__QL_FOJtNELfjYhJAmQ5N7uI-ZM-cidEADwQgPQz-NI-mTiKQ-Z1z4KQBARZgxKc3m5N55dDIgZ0M6bDROa6ylcZ62xPPUfSX_sSpcA7uaXbJ_sOxkULgA52BfOIKF4fgrG9v-mI6vEGqwqWl6VvDP3Tq_46IbqmbTBjDIMSFCydFds5CrfqwnqN1xPipUXHkhRPpkue8VI9vOl15eVTvITE9sR-pt9lqTzPj6yS7oXxgycNY8atUnGHBU46U4p2nESm2zaOc0o7rXo1Etflrn-s0z20mCG8PLKV_D8OpoMReLp4hhfwlSE-qgY6XdJNVIiRkpwUECP8yguQAqBtPMovVSsX0IZlY4vnyXktRlqX7T_9PnTOVzoC6yj_4SWizLBq9rMbCMGipbQQs1MclV1LVoeH99czjwajjwShx4Bgeew4FnceBZHKyhwfFR__DELxtk-CKIg9wXPG5rzjsdpUWHhRpKxzZWKsBEEk6x1kxLYkQEU25ukBKKTY15QKXWuC1FuI5ms1GmNpAnoXBQMdOMEE6EZkwRxSnRgrYFZyndRB33MRJRqsebJia3yU8G2UR48uS9VVD5xTP77nsn4O7MGhbP1Gj8mEBCSmNGg5hs_WPcbTRfIXwHzeYPY7ULSWWe7hVw-QDq-Xpj |
linkProvider | Elsevier |
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=Leader%E2%80%93follower+containment+control+over+directed+random+graphs&rft.jtitle=Automatica+%28Oxford%29&rft.au=Kan%2C+Zhen&rft.au=Shea%2C+John+M.&rft.au=Dixon%2C+Warren+E.&rft.date=2016-04-01&rft.issn=0005-1098&rft.volume=66&rft.spage=56&rft.epage=62&rft_id=info:doi/10.1016%2Fj.automatica.2015.12.016&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_automatica_2015_12_016 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0005-1098&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0005-1098&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0005-1098&client=summon |