By Topic

On the Control and Estimation Over 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
$31 $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

3 Author(s)
Sandhu, J. ; Lincoln Lab., MIT, Cambridge, MA, USA ; Mesbahi, M. ; Tsukamaki, T.

In this note, we consider certain structural aspects of estimation and control over relative sensing networks (RSNs). In this venue, using tools from basic algebraic graph theory-namely, the incidence matrix and cut and cycle spaces of a connect graph- we examine transformations among relative sensing topologies for a networked system. These transformations are parameterized for noise-free as well as noisy networks and their utility in the context of network-centric robust control and control reconfigurations is explored.

Published in:

Automatic Control, IEEE Transactions on  (Volume:54 ,  Issue: 12 )