By Topic

Network Identification via Node Knockout

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)
Nabi-Abdolyousefi, M. ; Dept. of Aeronaut. & Astronaut., Univ. of Washington, Seattle, WA, USA ; Mesbahi, M.

This technical note examines the problem of identifying the interaction geometry among a known number of agents, adopting a (weighted) consensus-type algorithm for their coordination. Inspired by how biologists use gene knockouts for experimentally identifying genetic interaction networks in cellular organisms, we propose a node-knockout procedure for the complete characterization of the interaction geometry in consensus-type networks. In our context, the node knockout is essentially a grounding procedure- where the node broadcasts a zero state to its neighbors without being removed from the network. The proposed centralized identification process is also facilitated by introducing “ports” for stimulating a subset of network vertices via an appropriately defined interface and observing the network's response at another set of vertices. We then provide an example for the utility of such a network identification process in the context of fault detection for networked systems.

Published in:

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