Title:
Robust Graph Topologies for Networked Systems
Robust Graph Topologies for Networked Systems
| 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-13T16:03:46Z | |
| dc.date.available | 2013-02-13T16:03:46Z | |
| dc.date.issued | 2012-09 | |
| dc.description | Presented at the 3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems (2012) | en_US |
| dc.description | DOI: 10.3182/20120914-2-US-4030.00052 | en_US |
| dc.description.abstract | Robustness of networked systems against noise corruption and structural changes in an underlying network topology is a critical issue for a reliable performance. In this paper, we investigate this issue of robustness in networked systems both from structural and functional viewpoints. Structural robustness deals with the effect of changes in a graph structure due to link or edge failures, while functional robustness addresses how well a system behaves in the presence of noise. We discuss that both of these aspects are inter-related, and can be measured through a common graph invariant. A graph process is introduced where edges are added to an existing graph in a step-wise manner to maximize robustness. Moreover, a relationship between the symmetry of an underlying network structure and robustness is also discussed. | en_US |
| dc.identifier.citation | W. Abbas and M. Egerstedt, “Robust Graph Topologies for Networked Systems,” IFAC Workshop on Estimation and Control of Networked Systems, Santa Barbara, CA, Sept. 2012. | en_US |
| dc.identifier.doi | 10.3182/20120914-2-US-4030.00052 | |
| dc.identifier.isbn | 978-3-902823-22-9 | |
| dc.identifier.uri | http://hdl.handle.net/1853/46181 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.publisher.original | Elsevier | en_US |
| dc.subject | Networked systems | en_US |
| dc.subject | Graph theoretic models | en_US |
| dc.subject | Robustness | en_US |
| dc.subject | Linear consensus | en_US |
| dc.title | Robust Graph Topologies for Networked Systems | 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