{"id":1170,"date":"2018-09-03T17:37:26","date_gmt":"2018-09-04T01:37:26","guid":{"rendered":"http:\/\/depts.washington.edu\/uwrainlab\/?page_id=1170"},"modified":"2018-09-03T17:37:26","modified_gmt":"2018-09-04T01:37:26","slug":"a-graph-realization-approach-to-network-identification","status":"publish","type":"page","link":"http:\/\/depts.washington.edu\/uwrainlab\/a-graph-realization-approach-to-network-identification\/","title":{"rendered":"A graph realization approach to network identification"},"content":{"rendered":"

M. Nabi-Abdolyousefi, M. Fazel, M. Mesbahi<\/strong><\/p>\n

IEEE Conference on Decision and Control<\/strong><\/p>\n

\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
In this paper, we examine the problem of identifying the interaction geometry among a known number of agents, adopting a consensus-type algorithm for their coordination. The proposed identification process is facilitated by introducing \u201cports\u201d for steering a subset of network vertices via an appropriately defined interface and observing the network’s response at another set of vertices. Using the fact that system identification provides a realization of the original network, we utilize transformations to identify a graph topology that is compatible with the set of input-output data. An example demonstrates the application of the proposed method.<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
<\/div>\n

Links:<\/strong><\/p>\n

\"\"<\/a> \u00a0 \"\"<\/a> \u00a0 \"\"<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

M. Nabi-Abdolyousefi, M. Fazel, M. Mesbahi IEEE Conference on Decision and Control In this paper, we examine the problem of identifying the interaction geometry among a known number of agents, adopting a consensus-type algorithm for their coordination. The proposed identification process is facilitated by introducing \u201cports\u201d for steering a subset of network vertices via an […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1170"}],"collection":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/comments?post=1170"}],"version-history":[{"count":1,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1170\/revisions"}],"predecessor-version":[{"id":1172,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1170\/revisions\/1172"}],"wp:attachment":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/media?parent=1170"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}