Show simple item record

dc.contributor.authorYazıcıoğlu, A. Yasin
dc.contributor.authorEgerstedt, Magnus B.
dc.contributor.authorShamma, Jeff S.
dc.date.accessioned2014-10-08T17:35:58Z
dc.date.available2014-10-08T17:35:58Z
dc.date.issued2013-12
dc.identifier.citationY. Yazicioglu, M. Egerstedt, and J. Shamma. Decentralized Degree Regularization for Multi-Agent Networks. IEEE Conference on Decision and Control (CDC 2013), Florence, Italy, Dec. 2013, pp. 7498-7503.en_US
dc.identifier.isbn978-1-4673-5714-2
dc.identifier.issn0743-1546
dc.identifier.urihttp://hdl.handle.net/1853/52413
dc.description© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en_US
dc.descriptionPresented at the IEEE 52nd Conference on Decision and Control (CDC 2013), December 10-13, 2013, Florence, Italy.
dc.descriptionDOI: 10.1109/CDC.2013.6761080
dc.description.abstractNetworked multi-agent systems are widely modeled as graphs where the agents are represented as nodes and edges exist between the agents that interact directly. In this setting, the degree of a node is the number of edges incident to it. For such systems, degree regularity (uniformity of degree across the nodes) typically provides desirable properties such as robustness and fast mixing time. As such, a key task is to achieve degree regularization in a decentralized manner. In this paper, we present a locally applicable rule that achieves this task. For any connected initial graph, the proposed reconfiguration rule preserves the graph connectivity and the total number of edges in the system while minimizing the difference between the maximum and the minimum node degrees.en_US
dc.language.isoen_USen_US
dc.publisherGeorgia Institute of Technologyen_US
dc.subjectDecentralized degree regularizationen_US
dc.subjectDegree regularityen_US
dc.subjectGraph connectivityen_US
dc.subjectGraphsen_US
dc.subjectMaximum node degreesen_US
dc.subjectMinimum node degreesen_US
dc.subjectMulti-agent networksen_US
dc.subjectMulti-agent systemsen_US
dc.subjectRobustnessen_US
dc.titleDecentralized Degree Regularization for Multi-Agent Networksen_US
dc.typePre-printen_US
dc.typeProceedingsen_US
dc.contributor.corporatenameGeorgia Institute of Technology. School of Electrical and Computer Engineeringen_US
dc.contributor.corporatenameGeorgia Institute of Technology. Institute for Robotics and Intelligent Machinesen_US
dc.publisher.originalInstitute of Electrical and Electronics Engineers
dc.identifier.doi10.1109/CDC.2013.6761080
dc.embargo.termsnullen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record