Forced consensus in networks of double integrator systems with delayed input
This communique presents forced second-order consensus protocols with communication time-delays for the network of agents with double integrator dynamics and gives a measure of the robustness of the protocols to the communication time-delays. By employing a frequency domain method, it is proven that...
Gespeichert in:
| Veröffentlicht in: | Automatica (Oxford) 2010-03, Vol.46 (3), p.629-632 |
|---|---|
| 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 | 632 |
|---|---|
| container_issue | 3 |
| container_start_page | 629 |
| container_title | Automatica (Oxford) |
| container_volume | 46 |
| creator | Yang, Bo Fang, Huajing |
| description | This communique presents forced second-order consensus protocols with communication time-delays for the network of agents with double integrator dynamics and gives a measure of the robustness of the protocols to the communication time-delays. By employing a frequency domain method, it is proven that the forced consensus is achieved asymptotically for appropriate time-delay if the network is connected. Particularly, the maximum fixed time-delay that can be tolerated by the network is found. The forced consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results. |
| doi_str_mv | 10.1016/j.automatica.2010.01.013 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_753739270</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0005109810000336</els_id><sourcerecordid>753739270</sourcerecordid><originalsourceid>FETCH-LOGICAL-c380t-ee59dea19d296c7e5ae63c6a5638d0023052794ba568a171a649684b4a9a4ca43</originalsourceid><addsrcrecordid>eNqFUMGqFDEQDKLg-vQfchFPs3aSmUxy1IdPhQUveg69mV7NOjtZ0xkf-_fmsQ89CgVNF1VddAkhFWwVKPv2uMW15hPWFHGrodGgGswTsVFuNJ12xj4VGwAYOgXePRcvmI9t7ZXTG7G7yyXSJGNemBZeWaZFLlTvc_nJMh_klNf9TI2t9L1gzUXyhSudWN6n-kNONOOl-dNyXutL8eyAM9Orx3kjvt19-Hr7qdt9-fj59t2ui8ZB7YgGPxEqP2lv40gDkjXR4mCNmwC0gUGPvt83wqEaFdreW9fve_TYR-zNjXhzvXsu-ddKXMMpcaR5xoXyymEczGi8HqEp3VUZS2YudAjnkk5YLkFBeOgvHMO__sJDfwFUg2nW148hyBHnQ8ElJv7r19rBANY33furjtrHvxOVwDHR0kpNhWINU07_D_sDF1OL7A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>753739270</pqid></control><display><type>article</type><title>Forced consensus in networks of double integrator systems with delayed input</title><source>Elsevier ScienceDirect Journals Complete</source><creator>Yang, Bo ; Fang, Huajing</creator><creatorcontrib>Yang, Bo ; Fang, Huajing</creatorcontrib><description>This communique presents forced second-order consensus protocols with communication time-delays for the network of agents with double integrator dynamics and gives a measure of the robustness of the protocols to the communication time-delays. By employing a frequency domain method, it is proven that the forced consensus is achieved asymptotically for appropriate time-delay if the network is connected. Particularly, the maximum fixed time-delay that can be tolerated by the network is found. The forced consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results.</description><identifier>ISSN: 0005-1098</identifier><identifier>EISSN: 1873-2836</identifier><identifier>DOI: 10.1016/j.automatica.2010.01.013</identifier><identifier>CODEN: ATCAA9</identifier><language>eng</language><publisher>Kidlington: Elsevier Ltd</publisher><subject>Algebraic graph theory ; Applied sciences ; Asymptotic properties ; Combinatorics ; Combinatorics. Ordered structures ; Communication time-delays ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Double integrators ; Dynamic networks ; Dynamical systems ; Dynamics ; Exact sciences and technology ; Forced second-order consensus ; Frequency domain analysis ; Graph theory ; Information retrieval. Graph ; Mathematical models ; Mathematics ; Networks ; Protocol (computers) ; Robustness ; Sciences and techniques of general use ; Software ; Theoretical computing</subject><ispartof>Automatica (Oxford), 2010-03, Vol.46 (3), p.629-632</ispartof><rights>2010 Elsevier Ltd</rights><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c380t-ee59dea19d296c7e5ae63c6a5638d0023052794ba568a171a649684b4a9a4ca43</citedby><cites>FETCH-LOGICAL-c380t-ee59dea19d296c7e5ae63c6a5638d0023052794ba568a171a649684b4a9a4ca43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.automatica.2010.01.013$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22805069$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Yang, Bo</creatorcontrib><creatorcontrib>Fang, Huajing</creatorcontrib><title>Forced consensus in networks of double integrator systems with delayed input</title><title>Automatica (Oxford)</title><description>This communique presents forced second-order consensus protocols with communication time-delays for the network of agents with double integrator dynamics and gives a measure of the robustness of the protocols to the communication time-delays. By employing a frequency domain method, it is proven that the forced consensus is achieved asymptotically for appropriate time-delay if the network is connected. Particularly, the maximum fixed time-delay that can be tolerated by the network is found. The forced consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results.</description><subject>Algebraic graph theory</subject><subject>Applied sciences</subject><subject>Asymptotic properties</subject><subject>Combinatorics</subject><subject>Combinatorics. Ordered structures</subject><subject>Communication time-delays</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Double integrators</subject><subject>Dynamic networks</subject><subject>Dynamical systems</subject><subject>Dynamics</subject><subject>Exact sciences and technology</subject><subject>Forced second-order consensus</subject><subject>Frequency domain analysis</subject><subject>Graph theory</subject><subject>Information retrieval. Graph</subject><subject>Mathematical models</subject><subject>Mathematics</subject><subject>Networks</subject><subject>Protocol (computers)</subject><subject>Robustness</subject><subject>Sciences and techniques of general use</subject><subject>Software</subject><subject>Theoretical computing</subject><issn>0005-1098</issn><issn>1873-2836</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNqFUMGqFDEQDKLg-vQfchFPs3aSmUxy1IdPhQUveg69mV7NOjtZ0xkf-_fmsQ89CgVNF1VddAkhFWwVKPv2uMW15hPWFHGrodGgGswTsVFuNJ12xj4VGwAYOgXePRcvmI9t7ZXTG7G7yyXSJGNemBZeWaZFLlTvc_nJMh_klNf9TI2t9L1gzUXyhSudWN6n-kNONOOl-dNyXutL8eyAM9Orx3kjvt19-Hr7qdt9-fj59t2ui8ZB7YgGPxEqP2lv40gDkjXR4mCNmwC0gUGPvt83wqEaFdreW9fve_TYR-zNjXhzvXsu-ddKXMMpcaR5xoXyymEczGi8HqEp3VUZS2YudAjnkk5YLkFBeOgvHMO__sJDfwFUg2nW148hyBHnQ8ElJv7r19rBANY33furjtrHvxOVwDHR0kpNhWINU07_D_sDF1OL7A</recordid><startdate>20100301</startdate><enddate>20100301</enddate><creator>Yang, Bo</creator><creator>Fang, Huajing</creator><general>Elsevier Ltd</general><general>Elsevier</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20100301</creationdate><title>Forced consensus in networks of double integrator systems with delayed input</title><author>Yang, Bo ; Fang, Huajing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c380t-ee59dea19d296c7e5ae63c6a5638d0023052794ba568a171a649684b4a9a4ca43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algebraic graph theory</topic><topic>Applied sciences</topic><topic>Asymptotic properties</topic><topic>Combinatorics</topic><topic>Combinatorics. Ordered structures</topic><topic>Communication time-delays</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Double integrators</topic><topic>Dynamic networks</topic><topic>Dynamical systems</topic><topic>Dynamics</topic><topic>Exact sciences and technology</topic><topic>Forced second-order consensus</topic><topic>Frequency domain analysis</topic><topic>Graph theory</topic><topic>Information retrieval. Graph</topic><topic>Mathematical models</topic><topic>Mathematics</topic><topic>Networks</topic><topic>Protocol (computers)</topic><topic>Robustness</topic><topic>Sciences and techniques of general use</topic><topic>Software</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yang, Bo</creatorcontrib><creatorcontrib>Fang, Huajing</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology 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><jtitle>Automatica (Oxford)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yang, Bo</au><au>Fang, Huajing</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Forced consensus in networks of double integrator systems with delayed input</atitle><jtitle>Automatica (Oxford)</jtitle><date>2010-03-01</date><risdate>2010</risdate><volume>46</volume><issue>3</issue><spage>629</spage><epage>632</epage><pages>629-632</pages><issn>0005-1098</issn><eissn>1873-2836</eissn><coden>ATCAA9</coden><abstract>This communique presents forced second-order consensus protocols with communication time-delays for the network of agents with double integrator dynamics and gives a measure of the robustness of the protocols to the communication time-delays. By employing a frequency domain method, it is proven that the forced consensus is achieved asymptotically for appropriate time-delay if the network is connected. Particularly, the maximum fixed time-delay that can be tolerated by the network is found. The forced consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results.</abstract><cop>Kidlington</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.automatica.2010.01.013</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0005-1098 |
| ispartof | Automatica (Oxford), 2010-03, Vol.46 (3), p.629-632 |
| issn | 0005-1098 1873-2836 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_753739270 |
| source | Elsevier ScienceDirect Journals Complete |
| subjects | Algebraic graph theory Applied sciences Asymptotic properties Combinatorics Combinatorics. Ordered structures Communication time-delays Computer science control theory systems Computer systems and distributed systems. User interface Double integrators Dynamic networks Dynamical systems Dynamics Exact sciences and technology Forced second-order consensus Frequency domain analysis Graph theory Information retrieval. Graph Mathematical models Mathematics Networks Protocol (computers) Robustness Sciences and techniques of general use Software Theoretical computing |
| title | Forced consensus in networks of double integrator systems with delayed input |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T15%3A43%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Forced%20consensus%20in%20networks%20of%20double%20integrator%20systems%20with%20delayed%20input&rft.jtitle=Automatica%20(Oxford)&rft.au=Yang,%20Bo&rft.date=2010-03-01&rft.volume=46&rft.issue=3&rft.spage=629&rft.epage=632&rft.pages=629-632&rft.issn=0005-1098&rft.eissn=1873-2836&rft.coden=ATCAA9&rft_id=info:doi/10.1016/j.automatica.2010.01.013&rft_dat=%3Cproquest_cross%3E753739270%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=753739270&rft_id=info:pmid/&rft_els_id=S0005109810000336&rfr_iscdi=true |