Finite-Time Consensus of Switched Multiagent Systems
This paper focuses on the finite-time consensus (FTC) problem of switched multiagent system (MAS) which is composed of continuous-time and discrete-time subsystems. Different from the existing results, each agent of this system is controlled by switching control method. To achieve consensus in finit...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on systems, man, and cybernetics. Systems man, and cybernetics. Systems, 2017-07, Vol.47 (7), p.1535-1545 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1545 |
|---|---|
| container_issue | 7 |
| container_start_page | 1535 |
| container_title | IEEE transactions on systems, man, and cybernetics. Systems |
| container_volume | 47 |
| creator | Lin, Xue Zheng, Yuanshi |
| description | This paper focuses on the finite-time consensus (FTC) problem of switched multiagent system (MAS) which is composed of continuous-time and discrete-time subsystems. Different from the existing results, each agent of this system is controlled by switching control method. To achieve consensus in finite time for the switched MAS, two types of consensus protocols (the FTC protocol and the fixed-time consensus (FdTC) protocol) are proposed. By using algebraic graph theory, Lyapunov theory and matrix theory, it is proved that the FTC problem in strongly connected network and leader-following network can be solved, respectively. When the initial states of agents are not available, the FdTC protocol is applied to solve the FTC problem. Simulations are provided to illustrate the effectiveness of our theoretical results. |
| doi_str_mv | 10.1109/TSMC.2016.2631659 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1913521090</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7778200</ieee_id><sourcerecordid>1913521090</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-567d09865d836c0c0489e2c4683cd90ff9e3d5403e48e76b5b572f7cffba5793</originalsourceid><addsrcrecordid>eNo9kE1Lw0AQhhdRsNT-APES8Jw6u5v9OkqwKrR4aO5LupnVLW1Ssxuk_96Ulp5mDs_7DvMQ8khhTimYl2q9KucMqJwzyakU5oZMGJU6Z4yz2-tO5T2ZxbgFAMq05CAnpFiENiTMq7DHrOzaiG0cYtb5bP0XkvvBJlsNuxTqb2xTtj7GhPv4QO58vYs4u8wpqRZvVfmRL7_eP8vXZe6Y4SkXUjVgtBSN5tKBg0IbZK6QmrvGgPcGeSMK4FhoVHIjNkIxr5z3m1oow6fk-Vx76LvfAWOy227o2_GipYZywcbfYaTomXJ9F2OP3h76sK_7o6VgT3rsSY896bEXPWPm6ZwJiHjllVKaAfB_QmpfPw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1913521090</pqid></control><display><type>article</type><title>Finite-Time Consensus of Switched Multiagent Systems</title><source>IEEE Electronic Library (IEL)</source><creator>Lin, Xue ; Zheng, Yuanshi</creator><creatorcontrib>Lin, Xue ; Zheng, Yuanshi</creatorcontrib><description>This paper focuses on the finite-time consensus (FTC) problem of switched multiagent system (MAS) which is composed of continuous-time and discrete-time subsystems. Different from the existing results, each agent of this system is controlled by switching control method. To achieve consensus in finite time for the switched MAS, two types of consensus protocols (the FTC protocol and the fixed-time consensus (FdTC) protocol) are proposed. By using algebraic graph theory, Lyapunov theory and matrix theory, it is proved that the FTC problem in strongly connected network and leader-following network can be solved, respectively. When the initial states of agents are not available, the FdTC protocol is applied to solve the FTC problem. Simulations are provided to illustrate the effectiveness of our theoretical results.</description><identifier>ISSN: 2168-2216</identifier><identifier>EISSN: 2168-2232</identifier><identifier>DOI: 10.1109/TSMC.2016.2631659</identifier><identifier>CODEN: ITSMFE</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algebra ; Consensus ; Control systems ; Convergence ; Eigenvalues and eigenfunctions ; finite-time ; fixed-time ; Graph theory ; Matrix theory ; Multi-agent systems ; Multiagent systems ; Protocol ; Protocol (computers) ; Protocols ; switched multiagent systems (MASs) ; Switches ; Switching ; Topology</subject><ispartof>IEEE transactions on systems, man, and cybernetics. Systems, 2017-07, Vol.47 (7), p.1535-1545</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c293t-567d09865d836c0c0489e2c4683cd90ff9e3d5403e48e76b5b572f7cffba5793</citedby><cites>FETCH-LOGICAL-c293t-567d09865d836c0c0489e2c4683cd90ff9e3d5403e48e76b5b572f7cffba5793</cites><orcidid>0000-0002-1143-2509</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7778200$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7778200$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Lin, Xue</creatorcontrib><creatorcontrib>Zheng, Yuanshi</creatorcontrib><title>Finite-Time Consensus of Switched Multiagent Systems</title><title>IEEE transactions on systems, man, and cybernetics. Systems</title><addtitle>TSMC</addtitle><description>This paper focuses on the finite-time consensus (FTC) problem of switched multiagent system (MAS) which is composed of continuous-time and discrete-time subsystems. Different from the existing results, each agent of this system is controlled by switching control method. To achieve consensus in finite time for the switched MAS, two types of consensus protocols (the FTC protocol and the fixed-time consensus (FdTC) protocol) are proposed. By using algebraic graph theory, Lyapunov theory and matrix theory, it is proved that the FTC problem in strongly connected network and leader-following network can be solved, respectively. When the initial states of agents are not available, the FdTC protocol is applied to solve the FTC problem. Simulations are provided to illustrate the effectiveness of our theoretical results.</description><subject>Algebra</subject><subject>Consensus</subject><subject>Control systems</subject><subject>Convergence</subject><subject>Eigenvalues and eigenfunctions</subject><subject>finite-time</subject><subject>fixed-time</subject><subject>Graph theory</subject><subject>Matrix theory</subject><subject>Multi-agent systems</subject><subject>Multiagent systems</subject><subject>Protocol</subject><subject>Protocol (computers)</subject><subject>Protocols</subject><subject>switched multiagent systems (MASs)</subject><subject>Switches</subject><subject>Switching</subject><subject>Topology</subject><issn>2168-2216</issn><issn>2168-2232</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1Lw0AQhhdRsNT-APES8Jw6u5v9OkqwKrR4aO5LupnVLW1Ssxuk_96Ulp5mDs_7DvMQ8khhTimYl2q9KucMqJwzyakU5oZMGJU6Z4yz2-tO5T2ZxbgFAMq05CAnpFiENiTMq7DHrOzaiG0cYtb5bP0XkvvBJlsNuxTqb2xTtj7GhPv4QO58vYs4u8wpqRZvVfmRL7_eP8vXZe6Y4SkXUjVgtBSN5tKBg0IbZK6QmrvGgPcGeSMK4FhoVHIjNkIxr5z3m1oow6fk-Vx76LvfAWOy227o2_GipYZywcbfYaTomXJ9F2OP3h76sK_7o6VgT3rsSY896bEXPWPm6ZwJiHjllVKaAfB_QmpfPw</recordid><startdate>20170701</startdate><enddate>20170701</enddate><creator>Lin, Xue</creator><creator>Zheng, Yuanshi</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>H8D</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-1143-2509</orcidid></search><sort><creationdate>20170701</creationdate><title>Finite-Time Consensus of Switched Multiagent Systems</title><author>Lin, Xue ; Zheng, Yuanshi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-567d09865d836c0c0489e2c4683cd90ff9e3d5403e48e76b5b572f7cffba5793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algebra</topic><topic>Consensus</topic><topic>Control systems</topic><topic>Convergence</topic><topic>Eigenvalues and eigenfunctions</topic><topic>finite-time</topic><topic>fixed-time</topic><topic>Graph theory</topic><topic>Matrix theory</topic><topic>Multi-agent systems</topic><topic>Multiagent systems</topic><topic>Protocol</topic><topic>Protocol (computers)</topic><topic>Protocols</topic><topic>switched multiagent systems (MASs)</topic><topic>Switches</topic><topic>Switching</topic><topic>Topology</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lin, Xue</creatorcontrib><creatorcontrib>Zheng, Yuanshi</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on systems, man, and cybernetics. Systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lin, Xue</au><au>Zheng, Yuanshi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Finite-Time Consensus of Switched Multiagent Systems</atitle><jtitle>IEEE transactions on systems, man, and cybernetics. Systems</jtitle><stitle>TSMC</stitle><date>2017-07-01</date><risdate>2017</risdate><volume>47</volume><issue>7</issue><spage>1535</spage><epage>1545</epage><pages>1535-1545</pages><issn>2168-2216</issn><eissn>2168-2232</eissn><coden>ITSMFE</coden><abstract>This paper focuses on the finite-time consensus (FTC) problem of switched multiagent system (MAS) which is composed of continuous-time and discrete-time subsystems. Different from the existing results, each agent of this system is controlled by switching control method. To achieve consensus in finite time for the switched MAS, two types of consensus protocols (the FTC protocol and the fixed-time consensus (FdTC) protocol) are proposed. By using algebraic graph theory, Lyapunov theory and matrix theory, it is proved that the FTC problem in strongly connected network and leader-following network can be solved, respectively. When the initial states of agents are not available, the FdTC protocol is applied to solve the FTC problem. Simulations are provided to illustrate the effectiveness of our theoretical results.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TSMC.2016.2631659</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0002-1143-2509</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2168-2216 |
| ispartof | IEEE transactions on systems, man, and cybernetics. Systems, 2017-07, Vol.47 (7), p.1535-1545 |
| issn | 2168-2216 2168-2232 |
| language | eng |
| recordid | cdi_proquest_journals_1913521090 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algebra Consensus Control systems Convergence Eigenvalues and eigenfunctions finite-time fixed-time Graph theory Matrix theory Multi-agent systems Multiagent systems Protocol Protocol (computers) Protocols switched multiagent systems (MASs) Switches Switching Topology |
| title | Finite-Time Consensus of Switched Multiagent Systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T23%3A45%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Finite-Time%20Consensus%20of%20Switched%20Multiagent%20Systems&rft.jtitle=IEEE%20transactions%20on%20systems,%20man,%20and%20cybernetics.%20Systems&rft.au=Lin,%20Xue&rft.date=2017-07-01&rft.volume=47&rft.issue=7&rft.spage=1535&rft.epage=1545&rft.pages=1535-1545&rft.issn=2168-2216&rft.eissn=2168-2232&rft.coden=ITSMFE&rft_id=info:doi/10.1109/TSMC.2016.2631659&rft_dat=%3Cproquest_RIE%3E1913521090%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1913521090&rft_id=info:pmid/&rft_ieee_id=7778200&rfr_iscdi=true |