Containment Problem for Sampled-Data Agent Networks Subject to Information Delays and Switching Topologies
In this paper, a containment problem is investigated for sampled-data agent networks subject to switching topologies and information delays. A nonlinear algorithm is introduced to ensure that the agents move into a convex area formed by some static leaders. The analytical approaches include the mode...
Gespeichert in:
| Veröffentlicht in: | IEEE access 2019, Vol.7, p.71007-71012 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 71012 |
|---|---|
| container_issue | |
| container_start_page | 71007 |
| container_title | IEEE access |
| container_volume | 7 |
| creator | Qiu, Zhifeng Xu, Jiahao Hou, Hailiang |
| description | In this paper, a containment problem is investigated for sampled-data agent networks subject to switching topologies and information delays. A nonlinear algorithm is introduced to ensure that the agents move into a convex area formed by some static leaders. The analytical approaches include the model transformation, the convexity analysis, and the Lyapunov approach. It proves that the containment problem can be achieved for sampled-data agent networks with bounded information delays and switching topologies if the union of the communication graphs has spanning trees. A numerical example is employed to demonstrate the validity of the theoretical results. |
| doi_str_mv | 10.1109/ACCESS.2019.2918960 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_8721640</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8721640</ieee_id><doaj_id>oai_doaj_org_article_f2834ec4e0734cf7b05df24ba302e2b8</doaj_id><sourcerecordid>2455644021</sourcerecordid><originalsourceid>FETCH-LOGICAL-c358t-5063542d4e05e90ff09c021227f746726e63138468c9413930ecafbf29ce6d33</originalsourceid><addsrcrecordid>eNpNkU9r3DAQxU1poCHJJ8hF0LO3-m_ruDhpuxCSgPcuZHm0tWtbW0lLyLePtg4huoyYee_NwK8obgneEILVj23T3LfthmKiNlSRWkn8pbikRKqSCSa_fvp_K25iHHF-dW6J6rIYG78kMywzLAk9B99NMCPnA2rNfJygL-9MMmh7OI8fIb348Dei9tSNYBNKHu2WLJ5NGvyC7mAyrxGZpUfty5Dsn2E5oL0_-skfBojXxYUzU4Sb93pV7H_e75vf5cPTr12zfSgtE3UqBZZMcNpzwAIUdg4riymhtHIVlxWVIBlhNZe1VZwwxTBY4zpHlQXZM3ZV7NbY3ptRH8Mwm_CqvRn0_4YPB21CGuwE2tGacbB5U8W4dVWHRe8o7wzDFGhX56zva9Yx-H8niEmP_hSWfL2mXAjJeb4sq9iqssHHGMB9bCVYnxHpFZE-I9LviLLrdnUNAPDhqKsMi2P2Bkx0jGs</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2455644021</pqid></control><display><type>article</type><title>Containment Problem for Sampled-Data Agent Networks Subject to Information Delays and Switching Topologies</title><source>IEEE Open Access Journals</source><source>DOAJ Directory of Open Access Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Qiu, Zhifeng ; Xu, Jiahao ; Hou, Hailiang</creator><creatorcontrib>Qiu, Zhifeng ; Xu, Jiahao ; Hou, Hailiang</creatorcontrib><description>In this paper, a containment problem is investigated for sampled-data agent networks subject to switching topologies and information delays. A nonlinear algorithm is introduced to ensure that the agents move into a convex area formed by some static leaders. The analytical approaches include the model transformation, the convexity analysis, and the Lyapunov approach. It proves that the containment problem can be achieved for sampled-data agent networks with bounded information delays and switching topologies if the union of the communication graphs has spanning trees. A numerical example is employed to demonstrate the validity of the theoretical results.</description><identifier>ISSN: 2169-3536</identifier><identifier>EISSN: 2169-3536</identifier><identifier>DOI: 10.1109/ACCESS.2019.2918960</identifier><identifier>CODEN: IAECCG</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Agent networks ; Algorithms ; Analytical models ; Containment ; containment control ; Convexity ; Delays ; Graph theory ; information delays ; Mathematical model ; Network topologies ; Network topology ; sampled-data ; Switches ; Switching ; switching topologies ; Topology ; Trees (mathematics)</subject><ispartof>IEEE access, 2019, Vol.7, p.71007-71012</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c358t-5063542d4e05e90ff09c021227f746726e63138468c9413930ecafbf29ce6d33</cites><orcidid>0000-0003-4804-4996 ; 0000-0001-7561-6668</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8721640$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,860,2096,4010,27610,27900,27901,27902,54908</link.rule.ids></links><search><creatorcontrib>Qiu, Zhifeng</creatorcontrib><creatorcontrib>Xu, Jiahao</creatorcontrib><creatorcontrib>Hou, Hailiang</creatorcontrib><title>Containment Problem for Sampled-Data Agent Networks Subject to Information Delays and Switching Topologies</title><title>IEEE access</title><addtitle>Access</addtitle><description>In this paper, a containment problem is investigated for sampled-data agent networks subject to switching topologies and information delays. A nonlinear algorithm is introduced to ensure that the agents move into a convex area formed by some static leaders. The analytical approaches include the model transformation, the convexity analysis, and the Lyapunov approach. It proves that the containment problem can be achieved for sampled-data agent networks with bounded information delays and switching topologies if the union of the communication graphs has spanning trees. A numerical example is employed to demonstrate the validity of the theoretical results.</description><subject>Agent networks</subject><subject>Algorithms</subject><subject>Analytical models</subject><subject>Containment</subject><subject>containment control</subject><subject>Convexity</subject><subject>Delays</subject><subject>Graph theory</subject><subject>information delays</subject><subject>Mathematical model</subject><subject>Network topologies</subject><subject>Network topology</subject><subject>sampled-data</subject><subject>Switches</subject><subject>Switching</subject><subject>switching topologies</subject><subject>Topology</subject><subject>Trees (mathematics)</subject><issn>2169-3536</issn><issn>2169-3536</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><sourceid>RIE</sourceid><sourceid>DOA</sourceid><recordid>eNpNkU9r3DAQxU1poCHJJ8hF0LO3-m_ruDhpuxCSgPcuZHm0tWtbW0lLyLePtg4huoyYee_NwK8obgneEILVj23T3LfthmKiNlSRWkn8pbikRKqSCSa_fvp_K25iHHF-dW6J6rIYG78kMywzLAk9B99NMCPnA2rNfJygL-9MMmh7OI8fIb348Dei9tSNYBNKHu2WLJ5NGvyC7mAyrxGZpUfty5Dsn2E5oL0_-skfBojXxYUzU4Sb93pV7H_e75vf5cPTr12zfSgtE3UqBZZMcNpzwAIUdg4riymhtHIVlxWVIBlhNZe1VZwwxTBY4zpHlQXZM3ZV7NbY3ptRH8Mwm_CqvRn0_4YPB21CGuwE2tGacbB5U8W4dVWHRe8o7wzDFGhX56zva9Yx-H8niEmP_hSWfL2mXAjJeb4sq9iqssHHGMB9bCVYnxHpFZE-I9LviLLrdnUNAPDhqKsMi2P2Bkx0jGs</recordid><startdate>2019</startdate><enddate>2019</enddate><creator>Qiu, Zhifeng</creator><creator>Xu, Jiahao</creator><creator>Hou, Hailiang</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7SR</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0003-4804-4996</orcidid><orcidid>https://orcid.org/0000-0001-7561-6668</orcidid></search><sort><creationdate>2019</creationdate><title>Containment Problem for Sampled-Data Agent Networks Subject to Information Delays and Switching Topologies</title><author>Qiu, Zhifeng ; Xu, Jiahao ; Hou, Hailiang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c358t-5063542d4e05e90ff09c021227f746726e63138468c9413930ecafbf29ce6d33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Agent networks</topic><topic>Algorithms</topic><topic>Analytical models</topic><topic>Containment</topic><topic>containment control</topic><topic>Convexity</topic><topic>Delays</topic><topic>Graph theory</topic><topic>information delays</topic><topic>Mathematical model</topic><topic>Network topologies</topic><topic>Network topology</topic><topic>sampled-data</topic><topic>Switches</topic><topic>Switching</topic><topic>switching topologies</topic><topic>Topology</topic><topic>Trees (mathematics)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Qiu, Zhifeng</creatorcontrib><creatorcontrib>Xu, Jiahao</creatorcontrib><creatorcontrib>Hou, Hailiang</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE Open Access Journals</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>Engineered Materials Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials Research 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><collection>DOAJ Directory of Open Access Journals</collection><jtitle>IEEE access</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Qiu, Zhifeng</au><au>Xu, Jiahao</au><au>Hou, Hailiang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Containment Problem for Sampled-Data Agent Networks Subject to Information Delays and Switching Topologies</atitle><jtitle>IEEE access</jtitle><stitle>Access</stitle><date>2019</date><risdate>2019</risdate><volume>7</volume><spage>71007</spage><epage>71012</epage><pages>71007-71012</pages><issn>2169-3536</issn><eissn>2169-3536</eissn><coden>IAECCG</coden><abstract>In this paper, a containment problem is investigated for sampled-data agent networks subject to switching topologies and information delays. A nonlinear algorithm is introduced to ensure that the agents move into a convex area formed by some static leaders. The analytical approaches include the model transformation, the convexity analysis, and the Lyapunov approach. It proves that the containment problem can be achieved for sampled-data agent networks with bounded information delays and switching topologies if the union of the communication graphs has spanning trees. A numerical example is employed to demonstrate the validity of the theoretical results.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/ACCESS.2019.2918960</doi><tpages>6</tpages><orcidid>https://orcid.org/0000-0003-4804-4996</orcidid><orcidid>https://orcid.org/0000-0001-7561-6668</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2169-3536 |
| ispartof | IEEE access, 2019, Vol.7, p.71007-71012 |
| issn | 2169-3536 2169-3536 |
| language | eng |
| recordid | cdi_ieee_primary_8721640 |
| source | IEEE Open Access Journals; DOAJ Directory of Open Access Journals; EZB-FREE-00999 freely available EZB journals |
| subjects | Agent networks Algorithms Analytical models Containment containment control Convexity Delays Graph theory information delays Mathematical model Network topologies Network topology sampled-data Switches Switching switching topologies Topology Trees (mathematics) |
| title | Containment Problem for Sampled-Data Agent Networks Subject to Information Delays and Switching Topologies |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T14%3A06%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Containment%20Problem%20for%20Sampled-Data%20Agent%20Networks%20Subject%20to%20Information%20Delays%20and%20Switching%20Topologies&rft.jtitle=IEEE%20access&rft.au=Qiu,%20Zhifeng&rft.date=2019&rft.volume=7&rft.spage=71007&rft.epage=71012&rft.pages=71007-71012&rft.issn=2169-3536&rft.eissn=2169-3536&rft.coden=IAECCG&rft_id=info:doi/10.1109/ACCESS.2019.2918960&rft_dat=%3Cproquest_ieee_%3E2455644021%3C/proquest_ieee_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2455644021&rft_id=info:pmid/&rft_ieee_id=8721640&rft_doaj_id=oai_doaj_org_article_f2834ec4e0734cf7b05df24ba302e2b8&rfr_iscdi=true |