By Topic

Graph-Theoretic Analysis and Synthesis of Relative Sensing Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Daniel Zelazo ; Institute for Systems Theory and Automatic Control, Universität Stuttgart, Stuttgart, Germany ; Mehran Mesbahi

This work provides a general framework for the analysis and synthesis of a class of relative sensing networks (RSNs) in the context of its H2 and H performance. We consider RSNs with homogeneous and heterogeneous agent dynamics. In both cases, explicit graph theoretic expressions and bounds for the H2 and H performance are derived. The H2 performance turns out to be a function of the number of edges in the graph, whereas the H performance is structure dependent and related to the spectral radius of the graph Laplacian. The analysis results are then used to develop synthesis methods for RSNs. An optimal topology is designed using the Kruskal's Algorithm for H2 performance, and a semi-definite program for the H performance of uncertain RSNs.

Published in:

IEEE Transactions on Automatic Control  (Volume:56 ,  Issue: 5 )