Semi-Autonomous Consensus: Network Measures and Adaptive Trees

DOI10.1109/TAC.2012.2205429MaRDI QIDQ5353068zbMATH OpenOpenAlexFDO

Authors Airlie Chapman, Mehran Mesbahi

Publication date 8 September 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2012.2205429

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Decentralized systems (93A14)

Cited in

(4)

• Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms
• \(\mathcal{H}_\infty\) network optimization for edge consensus
• Adaptive consensus of wireless sensor networks under local measurement by a sink node
• Modeling spatial networks by contact graphs of disk packings

This page was built for publication: Semi-Autonomous Consensus: Network Measures and Adaptive Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353068)