Skip to main content

Rearranging trees for robust consensus

Author(s): Young, GF; Scardovi, L; Leonard, NE

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1f963
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYoung, GFen_US
dc.contributor.authorScardovi, Len_US
dc.contributor.authorLeonard, NEen_US
dc.date.accessioned2018-07-20T15:08:32Z-
dc.date.available2018-07-20T15:08:32Z-
dc.date.issued2011-12-01en_US
dc.identifier.citationYoung, GF, Scardovi, L, Leonard, NE. (2011). Rearranging trees for robust consensus. Proceedings of the IEEE Conference on Decision and Control, 1000 - 1005. doi:10.1109/CDC.2011.6161270en_US
dc.identifier.issn0191-2216en_US
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1f963-
dc.description.abstractIn this paper, we use the H 2 norm associated with a communication graph to characterize the robustness of consensus to noise. In particular, we restrict our attention to trees, and by systematic attention to the effect of local changes in topology, we derive a partial ordering for undirected trees according to the H 2 norm. Our approach for undirected trees provides a constructive method for deriving an ordering for directed trees. Further, our approach suggests a decentralized manner in which trees can be rearranged in order to improve their robustness. © 2011 IEEE.en_US
dc.format.extent1000 - 1005en_US
dc.relation.ispartofProceedings of the IEEE Conference on Decision and Controlen_US
dc.titleRearranging trees for robust consensusen_US
dc.typeConference Proceeding-
dc.identifier.doidoi:10.1109/CDC.2011.6161270en_US
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceedingen_US

Files in This Item:
File Description SizeFormat 
Rearranging trees for robust consensus.pdf313.06 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.