Semi-Global Consensus Problems of Discrete-Time Multi-Agent Systems in the Presence of Input Constraints
This paper studies the consensus problems of the discrete-time multi-agent systems (MASs) in the presence of input saturation constraints over directed communication networks. Two kinds of consensus problems, of the leaderless consensus problem with no leader agent and the containment control proble...
Gespeichert in:
| Veröffentlicht in: | Shanghai jiao tong da xue xue bao. Yi xue ban 2020-06, Vol.25 (3), p.288 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | chi |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 3 |
| container_start_page | 288 |
| container_title | Shanghai jiao tong da xue xue bao. Yi xue ban |
| container_volume | 25 |
| creator | Wang, Jian Shi, Liangren |
| description | This paper studies the consensus problems of the discrete-time multi-agent systems (MASs) in the presence of input saturation constraints over directed communication networks. Two kinds of consensus problems, of the leaderless consensus problem with no leader agent and the containment control problem with multiple leader agents, are investigated in this paper. Low gain feedback consensus algorithms based on the improved discretetime parametric algebraic Riccati equation (ARE) are proposed to solve the consensus problems. For the MAS without any leader, the trajectories of all agents converge together when the communication networks contain a directed spanning tree. For the MAS with multiple leaders, the trajectories of all follower agents converge to the convex hull spanned by the leader agents when there is at least one leader agent which is trackable for each follower agent. Simulation examples are provided to verify the theoretical results. |
| doi_str_mv | 10.1007/s12204-020-2183-2 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2411807472</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2411807472</sourcerecordid><originalsourceid>FETCH-proquest_journals_24118074723</originalsourceid><addsrcrecordid>eNqNjDFuAjEQRV2AFAQcgM4StYnHu8FLiQghFEhI0KNdNARHXpt4xgW3zxJxgFS_eO99ISagZ6C1fSUwRpdKG60MVIUyPTGAuS1VBfD2IsZErum8-aIwVg_E9YCtUxsfm9rLVQyEgTLJfYqNx5ZkvMh3R-eEjOroWpS77Nmp5RcGloc78UNyQfIVuwi7_IyPaBtumf8OOdUuMI1E_1J7wvFzh2L6sT6uPtUtxZ-MxKfvmFPo0MmUAJW2pTXF_6xfG-BM1g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2411807472</pqid></control><display><type>article</type><title>Semi-Global Consensus Problems of Discrete-Time Multi-Agent Systems in the Presence of Input Constraints</title><source>DOAJ Directory of Open Access Journals</source><creator>Wang, Jian ; Shi, Liangren</creator><creatorcontrib>Wang, Jian ; Shi, Liangren</creatorcontrib><description>This paper studies the consensus problems of the discrete-time multi-agent systems (MASs) in the presence of input saturation constraints over directed communication networks. Two kinds of consensus problems, of the leaderless consensus problem with no leader agent and the containment control problem with multiple leader agents, are investigated in this paper. Low gain feedback consensus algorithms based on the improved discretetime parametric algebraic Riccati equation (ARE) are proposed to solve the consensus problems. For the MAS without any leader, the trajectories of all agents converge together when the communication networks contain a directed spanning tree. For the MAS with multiple leaders, the trajectories of all follower agents converge to the convex hull spanned by the leader agents when there is at least one leader agent which is trackable for each follower agent. Simulation examples are provided to verify the theoretical results.</description><identifier>ISSN: 1674-8115</identifier><identifier>DOI: 10.1007/s12204-020-2183-2</identifier><language>chi</language><publisher>Shanghai: Shanghai Jiaotong University Press</publisher><subject>Algorithms ; Communication networks ; Communications networks ; Computational geometry ; Computer simulation ; Containment ; Convergence ; Convexity ; Discrete time systems ; Graph theory ; Hulls ; Multiagent systems ; Riccati equation</subject><ispartof>Shanghai jiao tong da xue xue bao. Yi xue ban, 2020-06, Vol.25 (3), p.288</ispartof><rights>Copyright Shanghai Jiaotong University Press Jun 2020</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,778,782,862,27911,27912</link.rule.ids></links><search><creatorcontrib>Wang, Jian</creatorcontrib><creatorcontrib>Shi, Liangren</creatorcontrib><title>Semi-Global Consensus Problems of Discrete-Time Multi-Agent Systems in the Presence of Input Constraints</title><title>Shanghai jiao tong da xue xue bao. Yi xue ban</title><description>This paper studies the consensus problems of the discrete-time multi-agent systems (MASs) in the presence of input saturation constraints over directed communication networks. Two kinds of consensus problems, of the leaderless consensus problem with no leader agent and the containment control problem with multiple leader agents, are investigated in this paper. Low gain feedback consensus algorithms based on the improved discretetime parametric algebraic Riccati equation (ARE) are proposed to solve the consensus problems. For the MAS without any leader, the trajectories of all agents converge together when the communication networks contain a directed spanning tree. For the MAS with multiple leaders, the trajectories of all follower agents converge to the convex hull spanned by the leader agents when there is at least one leader agent which is trackable for each follower agent. Simulation examples are provided to verify the theoretical results.</description><subject>Algorithms</subject><subject>Communication networks</subject><subject>Communications networks</subject><subject>Computational geometry</subject><subject>Computer simulation</subject><subject>Containment</subject><subject>Convergence</subject><subject>Convexity</subject><subject>Discrete time systems</subject><subject>Graph theory</subject><subject>Hulls</subject><subject>Multiagent systems</subject><subject>Riccati equation</subject><issn>1674-8115</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNqNjDFuAjEQRV2AFAQcgM4StYnHu8FLiQghFEhI0KNdNARHXpt4xgW3zxJxgFS_eO99ISagZ6C1fSUwRpdKG60MVIUyPTGAuS1VBfD2IsZErum8-aIwVg_E9YCtUxsfm9rLVQyEgTLJfYqNx5ZkvMh3R-eEjOroWpS77Nmp5RcGloc78UNyQfIVuwi7_IyPaBtumf8OOdUuMI1E_1J7wvFzh2L6sT6uPtUtxZ-MxKfvmFPo0MmUAJW2pTXF_6xfG-BM1g</recordid><startdate>20200601</startdate><enddate>20200601</enddate><creator>Wang, Jian</creator><creator>Shi, Liangren</creator><general>Shanghai Jiaotong University Press</general><scope>7QL</scope><scope>7QO</scope><scope>7QP</scope><scope>7T5</scope><scope>7TK</scope><scope>7TM</scope><scope>7TO</scope><scope>7U9</scope><scope>8FD</scope><scope>C1K</scope><scope>FR3</scope><scope>H94</scope><scope>M7N</scope><scope>P64</scope><scope>RC3</scope></search><sort><creationdate>20200601</creationdate><title>Semi-Global Consensus Problems of Discrete-Time Multi-Agent Systems in the Presence of Input Constraints</title><author>Wang, Jian ; Shi, Liangren</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_24118074723</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>chi</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Communication networks</topic><topic>Communications networks</topic><topic>Computational geometry</topic><topic>Computer simulation</topic><topic>Containment</topic><topic>Convergence</topic><topic>Convexity</topic><topic>Discrete time systems</topic><topic>Graph theory</topic><topic>Hulls</topic><topic>Multiagent systems</topic><topic>Riccati equation</topic><toplevel>online_resources</toplevel><creatorcontrib>Wang, Jian</creatorcontrib><creatorcontrib>Shi, Liangren</creatorcontrib><collection>Bacteriology Abstracts (Microbiology B)</collection><collection>Biotechnology Research Abstracts</collection><collection>Calcium & Calcified Tissue Abstracts</collection><collection>Immunology Abstracts</collection><collection>Neurosciences Abstracts</collection><collection>Nucleic Acids Abstracts</collection><collection>Oncogenes and Growth Factors Abstracts</collection><collection>Virology and AIDS Abstracts</collection><collection>Technology Research Database</collection><collection>Environmental Sciences and Pollution Management</collection><collection>Engineering Research Database</collection><collection>AIDS and Cancer Research Abstracts</collection><collection>Algology Mycology and Protozoology Abstracts (Microbiology C)</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Genetics Abstracts</collection><jtitle>Shanghai jiao tong da xue xue bao. Yi xue ban</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Jian</au><au>Shi, Liangren</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Semi-Global Consensus Problems of Discrete-Time Multi-Agent Systems in the Presence of Input Constraints</atitle><jtitle>Shanghai jiao tong da xue xue bao. Yi xue ban</jtitle><date>2020-06-01</date><risdate>2020</risdate><volume>25</volume><issue>3</issue><spage>288</spage><pages>288-</pages><issn>1674-8115</issn><abstract>This paper studies the consensus problems of the discrete-time multi-agent systems (MASs) in the presence of input saturation constraints over directed communication networks. Two kinds of consensus problems, of the leaderless consensus problem with no leader agent and the containment control problem with multiple leader agents, are investigated in this paper. Low gain feedback consensus algorithms based on the improved discretetime parametric algebraic Riccati equation (ARE) are proposed to solve the consensus problems. For the MAS without any leader, the trajectories of all agents converge together when the communication networks contain a directed spanning tree. For the MAS with multiple leaders, the trajectories of all follower agents converge to the convex hull spanned by the leader agents when there is at least one leader agent which is trackable for each follower agent. Simulation examples are provided to verify the theoretical results.</abstract><cop>Shanghai</cop><pub>Shanghai Jiaotong University Press</pub><doi>10.1007/s12204-020-2183-2</doi></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1674-8115 |
| ispartof | Shanghai jiao tong da xue xue bao. Yi xue ban, 2020-06, Vol.25 (3), p.288 |
| issn | 1674-8115 |
| language | chi |
| recordid | cdi_proquest_journals_2411807472 |
| source | DOAJ Directory of Open Access Journals |
| subjects | Algorithms Communication networks Communications networks Computational geometry Computer simulation Containment Convergence Convexity Discrete time systems Graph theory Hulls Multiagent systems Riccati equation |
| title | Semi-Global Consensus Problems of Discrete-Time Multi-Agent Systems in the Presence of Input Constraints |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T20%3A16%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Semi-Global%20Consensus%20Problems%20of%20Discrete-Time%20Multi-Agent%20Systems%20in%20the%20Presence%20of%20Input%20Constraints&rft.jtitle=Shanghai%20jiao%20tong%20da%20xue%20xue%20bao.%20Yi%20xue%20ban&rft.au=Wang,%20Jian&rft.date=2020-06-01&rft.volume=25&rft.issue=3&rft.spage=288&rft.pages=288-&rft.issn=1674-8115&rft_id=info:doi/10.1007/s12204-020-2183-2&rft_dat=%3Cproquest%3E2411807472%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2411807472&rft_id=info:pmid/&rfr_iscdi=true |