Graph-Theoretic Analysis and Synthesis of Relative Sensing Networks

DOI10.1109/TAC.2010.2085312zbMATH Open1368.93163DBLPjournals/tac/ZelazoM11aWikidataQ57719061 ScholiaQ57719061MaRDI QIDQ5347696FDOQ5347696

Daniel Zelazo, Mehran Mesbahi

Publication date: 25 August 2017

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

Recommendations

• Sensor networks: from dependence analysis via matroid bases to online synthesis
• Relative interleavings and applications to sensor networks
• Partitioning of relative sensing networks: a stability margin perspective
• Distributed Graph Layout for Sensor Networks
• Graph Drawing
• Some applications of graph theory to network analysis and synthesis
• Network synchronizability analysis: a graph-theoretic approach

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) (H^infty)-control (93B36)

Cited In (10)

• Stability margin of undirected homogeneous relative sensing networks: a geometric perspective
• Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms
• Robust and nonlinear control literature survey (No. 25)
• On the internal stability of diffusively coupled multi-agent systems and the dangers of cancel culture
• Merging relative sensing networks: a stability margin perspective
• Sensitivity-based link addition for robust linear dynamical networks
• Partitioning of relative sensing networks: a stability margin perspective
• Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs
• Efficient identification of link importance in dynamic networks
• Convergence analysis using the edge Laplacian: robust consensus of nonlinear multi-agent systems via ISS method

This page was built for publication: Graph-Theoretic Analysis and Synthesis of Relative Sensing Networks

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