Title:
A Tight Lower Bound on the Controllability of Networks with Multiple Leaders
A Tight Lower Bound on the Controllability of Networks with Multiple Leaders
| dc.contributor.author | Yazıcıoğlu, A. Yasin | en_US |
| dc.contributor.author | Abbas, Waseem | en_US |
| dc.contributor.author | Egerstedt, Magnus B. | en_US |
| dc.contributor.corporatename | Georgia Institute of Technology. School of Electrical and Computer Engineering | en_US |
| dc.contributor.corporatename | Georgia Institute of Technology. Center for Robotics and Intelligent Machines | en_US |
| dc.date.accessioned | 2013-02-12T21:17:16Z | |
| dc.date.available | 2013-02-12T21:17:16Z | |
| dc.date.issued | 2012-12 | |
| dc.description | © 2012 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. | en_US |
| dc.description | Presented at the IEEE Conference on Decision and Control, Maui, Hawaii, Dec. 2012. | en_US |
| dc.description | DOI: 10.1109/CDC.2012.6426844 | en_US |
| dc.description.abstract | In this paper we study the controllability of networked systems with static network topologies using tools from algebraic graph theory. Each agent in the network acts in a decentralized fashion by updating its state in accordance with a nearest-neighbor averaging rule, known as the consensus dynamics. In order to control the system, external control inputs are injected into the so called leader nodes, and the influence is propagated throughout the network. Our main result is a tight lower bound on the rank of the controllability matrix. This bound is derived using the distances of nodes to the leaders, and valid for systems with arbitrary network topologies and possibly multiple leaders. | en_US |
| dc.identifier.citation | Y. Yazıcıoğlu, W. Abbas, and M. Egerstedt, "A Tight Lower Bound on the Controllability of Networks with Multiple Leaders," IEEE Conference on Decision and Control, Maui, Hawaii, Dec. 2012. | en_US |
| dc.identifier.doi | 10.1109/CDC.2012.6426844 | |
| dc.identifier.isbn | 978-1-4673-2065-8 | |
| dc.identifier.issn | 0743-1546 | |
| dc.identifier.uri | http://hdl.handle.net/1853/46175 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.publisher.original | Institute of Electrical and Electronics Engineers | en_US |
| dc.subject | Network topology | en_US |
| dc.subject | Controllability | en_US |
| dc.subject | Graph theory | en_US |
| dc.subject | Decentralized controllers | en_US |
| dc.title | A Tight Lower Bound on the Controllability of Networks with Multiple Leaders | en_US |
| dc.type | Text | |
| dc.type.genre | Proceedings | |
| dc.type.genre | Post-print | |
| dspace.entity.type | Publication | |
| local.contributor.author | Egerstedt, Magnus B. | |
| local.contributor.corporatename | School of Electrical and Computer Engineering | |
| local.contributor.corporatename | College of Engineering | |
| relation.isAuthorOfPublication | dd4872d3-2e0d-435d-861d-a61559d2bcb6 | |
| relation.isOrgUnitOfPublication | 5b7adef2-447c-4270-b9fc-846bd76f80f2 | |
| relation.isOrgUnitOfPublication | 7c022d60-21d5-497c-b552-95e489a06569 |
Files
Original bundle
1 - 1 of 1