Structural Controllability of a Consensus Network With Multiple Leaders

This paper examines the structural controllability for a group of agents, called followers, connected to each other based on the consensus law under commands of multiple leaders, which are agents with superior capabilities, over a fixed communication topology. It is proved that the graph-theoretic s...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 2019-12, Vol.64 (12), p.5101-5107
Main Authors: Mehrabadi, Milad Kazemi, Zamani, Mohsen, Chen, Zhiyong
Format: Article
Language:English
Subjects:
Controllability
Graph theory
Laplace equations
Leadership
Linear systems
Mathematical analysis
Matrix methods
Multiagent systems
Network topology
Parameterization
structural controllability
Topology
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c291t-f0ad25aa68dc0a1ba956deba6b3e227b763ce49fc1a1257063fc2262af34cf543
cites cdi_FETCH-LOGICAL-c291t-f0ad25aa68dc0a1ba956deba6b3e227b763ce49fc1a1257063fc2262af34cf543
container_end_page 5107
container_issue 12
container_start_page 5101
container_title IEEE transactions on automatic control
container_volume 64
creator Mehrabadi, Milad Kazemi
Zamani, Mohsen
Chen, Zhiyong
description This paper examines the structural controllability for a group of agents, called followers, connected to each other based on the consensus law under commands of multiple leaders, which are agents with superior capabilities, over a fixed communication topology. It is proved that the graph-theoretic sufficient and necessary condition for the set of followers to be structurally controllable under the leaders' commands is leader-follower connectivity of the associated graph topology. This shrinks to graph connectivity for the case of solo leader. In the approach, we explicitly put into account the dependence among the entries of the system matrices for a consensus network using the linear parameterization technique.
doi_str_mv 10.1109/TAC.2019.2909809
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_proquest_journals_2322789871</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8684271</ieee_id><sourcerecordid>2322789871</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-f0ad25aa68dc0a1ba956deba6b3e227b763ce49fc1a1257063fc2262af34cf543</originalsourceid><addsrcrecordid>eNo9kEFLAzEQRoMoWKt3wUvA89ZksptNjmXRKlQ9WPEYstkEt65NTbJI_70pLZ6GGd73DTyErimZUUrk3WrezIBQOQNJpCDyBE1oVYkCKmCnaEIIFYUEwc_RRYzrvPKypBO0eEthNGkMesCN36Tgh0G3_dCnHfYO6_0x2k0cI36x6deHL_zRp0_8PA6p3w4WL63ubIiX6MzpIdqr45yi94f7VfNYLF8XT818WRiQNBWO6A4qrbnoDNG01bLinW01b5kFqNuaM2NL6QzVFKqacOYMAAftWGlcVbIpuj30boP_GW1Mau3HsMkvFbDcIKSoaabIgTLBxxisU9vQf-uwU5SovS6Vdam9LnXUlSM3h0hvrf3HBRcl5MI_4hFmkQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2322789871</pqid></control><display><type>article</type><title>Structural Controllability of a Consensus Network With Multiple Leaders</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Mehrabadi, Milad Kazemi ; Zamani, Mohsen ; Chen, Zhiyong</creator><creatorcontrib>Mehrabadi, Milad Kazemi ; Zamani, Mohsen ; Chen, Zhiyong</creatorcontrib><description>This paper examines the structural controllability for a group of agents, called followers, connected to each other based on the consensus law under commands of multiple leaders, which are agents with superior capabilities, over a fixed communication topology. It is proved that the graph-theoretic sufficient and necessary condition for the set of followers to be structurally controllable under the leaders' commands is leader-follower connectivity of the associated graph topology. This shrinks to graph connectivity for the case of solo leader. In the approach, we explicitly put into account the dependence among the entries of the system matrices for a consensus network using the linear parameterization technique.</description><identifier>ISSN: 0018-9286</identifier><identifier>EISSN: 1558-2523</identifier><identifier>DOI: 10.1109/TAC.2019.2909809</identifier><identifier>CODEN: IETAA9</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Controllability ; Graph theory ; Laplace equations ; Leadership ; Linear systems ; Mathematical analysis ; Matrix methods ; Multiagent systems ; Network topology ; Parameterization ; structural controllability ; Topology</subject><ispartof>IEEE transactions on automatic control, 2019-12, Vol.64 (12), p.5101-5107</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-f0ad25aa68dc0a1ba956deba6b3e227b763ce49fc1a1257063fc2262af34cf543</citedby><cites>FETCH-LOGICAL-c291t-f0ad25aa68dc0a1ba956deba6b3e227b763ce49fc1a1257063fc2262af34cf543</cites><orcidid>0000-0003-2972-7417 ; 0000-0002-2033-4249 ; 0000-0003-2716-2758</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8684271$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,54771</link.rule.ids></links><search><creatorcontrib>Mehrabadi, Milad Kazemi</creatorcontrib><creatorcontrib>Zamani, Mohsen</creatorcontrib><creatorcontrib>Chen, Zhiyong</creatorcontrib><title>Structural Controllability of a Consensus Network With Multiple Leaders</title><title>IEEE transactions on automatic control</title><addtitle>TAC</addtitle><description>This paper examines the structural controllability for a group of agents, called followers, connected to each other based on the consensus law under commands of multiple leaders, which are agents with superior capabilities, over a fixed communication topology. It is proved that the graph-theoretic sufficient and necessary condition for the set of followers to be structurally controllable under the leaders' commands is leader-follower connectivity of the associated graph topology. This shrinks to graph connectivity for the case of solo leader. In the approach, we explicitly put into account the dependence among the entries of the system matrices for a consensus network using the linear parameterization technique.</description><subject>Controllability</subject><subject>Graph theory</subject><subject>Laplace equations</subject><subject>Leadership</subject><subject>Linear systems</subject><subject>Mathematical analysis</subject><subject>Matrix methods</subject><subject>Multiagent systems</subject><subject>Network topology</subject><subject>Parameterization</subject><subject>structural controllability</subject><subject>Topology</subject><issn>0018-9286</issn><issn>1558-2523</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNo9kEFLAzEQRoMoWKt3wUvA89ZksptNjmXRKlQ9WPEYstkEt65NTbJI_70pLZ6GGd73DTyErimZUUrk3WrezIBQOQNJpCDyBE1oVYkCKmCnaEIIFYUEwc_RRYzrvPKypBO0eEthNGkMesCN36Tgh0G3_dCnHfYO6_0x2k0cI36x6deHL_zRp0_8PA6p3w4WL63ubIiX6MzpIdqr45yi94f7VfNYLF8XT818WRiQNBWO6A4qrbnoDNG01bLinW01b5kFqNuaM2NL6QzVFKqacOYMAAftWGlcVbIpuj30boP_GW1Mau3HsMkvFbDcIKSoaabIgTLBxxisU9vQf-uwU5SovS6Vdam9LnXUlSM3h0hvrf3HBRcl5MI_4hFmkQ</recordid><startdate>20191201</startdate><enddate>20191201</enddate><creator>Mehrabadi, Milad Kazemi</creator><creator>Zamani, Mohsen</creator><creator>Chen, Zhiyong</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>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0003-2972-7417</orcidid><orcidid>https://orcid.org/0000-0002-2033-4249</orcidid><orcidid>https://orcid.org/0000-0003-2716-2758</orcidid></search><sort><creationdate>20191201</creationdate><title>Structural Controllability of a Consensus Network With Multiple Leaders</title><author>Mehrabadi, Milad Kazemi ; Zamani, Mohsen ; Chen, Zhiyong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-f0ad25aa68dc0a1ba956deba6b3e227b763ce49fc1a1257063fc2262af34cf543</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Controllability</topic><topic>Graph theory</topic><topic>Laplace equations</topic><topic>Leadership</topic><topic>Linear systems</topic><topic>Mathematical analysis</topic><topic>Matrix methods</topic><topic>Multiagent systems</topic><topic>Network topology</topic><topic>Parameterization</topic><topic>structural controllability</topic><topic>Topology</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mehrabadi, Milad Kazemi</creatorcontrib><creatorcontrib>Zamani, Mohsen</creatorcontrib><creatorcontrib>Chen, Zhiyong</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 Online</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering 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>IEEE transactions on automatic control</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mehrabadi, Milad Kazemi</au><au>Zamani, Mohsen</au><au>Chen, Zhiyong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Structural Controllability of a Consensus Network With Multiple Leaders</atitle><jtitle>IEEE transactions on automatic control</jtitle><stitle>TAC</stitle><date>2019-12-01</date><risdate>2019</risdate><volume>64</volume><issue>12</issue><spage>5101</spage><epage>5107</epage><pages>5101-5107</pages><issn>0018-9286</issn><eissn>1558-2523</eissn><coden>IETAA9</coden><abstract>This paper examines the structural controllability for a group of agents, called followers, connected to each other based on the consensus law under commands of multiple leaders, which are agents with superior capabilities, over a fixed communication topology. It is proved that the graph-theoretic sufficient and necessary condition for the set of followers to be structurally controllable under the leaders' commands is leader-follower connectivity of the associated graph topology. This shrinks to graph connectivity for the case of solo leader. In the approach, we explicitly put into account the dependence among the entries of the system matrices for a consensus network using the linear parameterization technique.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TAC.2019.2909809</doi><tpages>7</tpages><orcidid>https://orcid.org/0000-0003-2972-7417</orcidid><orcidid>https://orcid.org/0000-0002-2033-4249</orcidid><orcidid>https://orcid.org/0000-0003-2716-2758</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0018-9286
ispartof IEEE transactions on automatic control, 2019-12, Vol.64 (12), p.5101-5107
issn 0018-9286
1558-2523
language eng
recordid cdi_proquest_journals_2322789871
source IEEE Electronic Library (IEL) Journals
subjects Controllability
Graph theory
Laplace equations
Leadership
Linear systems
Mathematical analysis
Matrix methods
Multiagent systems
Network topology
Parameterization
structural controllability
Topology
title Structural Controllability of a Consensus Network With Multiple Leaders
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T20%3A54%3A57IST&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=Structural%20Controllability%20of%20a%20Consensus%20Network%20With%20Multiple%20Leaders&rft.jtitle=IEEE%20transactions%20on%20automatic%20control&rft.au=Mehrabadi,%20Milad%20Kazemi&rft.date=2019-12-01&rft.volume=64&rft.issue=12&rft.spage=5101&rft.epage=5107&rft.pages=5101-5107&rft.issn=0018-9286&rft.eissn=1558-2523&rft.coden=IETAA9&rft_id=info:doi/10.1109/TAC.2019.2909809&rft_dat=%3Cproquest_ieee_%3E2322789871%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c291t-f0ad25aa68dc0a1ba956deba6b3e227b763ce49fc1a1257063fc2262af34cf543%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2322789871&rft_id=info:pmid/&rft_ieee_id=8684271&rfr_iscdi=true