{"id":1327,"date":"2018-12-27T11:14:18","date_gmt":"2018-12-27T19:14:18","guid":{"rendered":"http:\/\/depts.washington.edu\/uwrainlab\/?page_id=1327"},"modified":"2018-12-27T11:14:18","modified_gmt":"2018-12-27T19:14:18","slug":"system-theoretic-aspects-of-influence-consensus-single-input-case","status":"publish","type":"page","link":"http:\/\/depts.washington.edu\/uwrainlab\/system-theoretic-aspects-of-influence-consensus-single-input-case\/","title":{"rendered":"System theoretic aspects of influence consensus: single input case"},"content":{"rendered":"

A. Chapman, M. Mesbahi<\/strong><\/p>\n

IEEE Transactions on Automatic 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
\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
This technical note examines the dynamics of networked multi-agent systems operating with a consensus-type algorithm, under the influence of an attached node or external agent. Depending on the specific scenario, the attached node can be viewed as a network intruder or an administrator. We introduce an influence scheme, naive of the network topology, involving predictable excitation of the network with the objective of manipulating, disrupting, or steering its evolution. The spectrum of the corresponding Dirichlet matrix provides bounds on the system-theoretic properties of the resulting influenced network, quantifying its security-or viewed differently-its manageability. Finally, the controllability gramian for influenced consensus is examined, providing insights into its\u00a0H<\/i>2<\/sub>-norm and controllability properties.<\/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<\/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":"

A. Chapman, M. Mesbahi IEEE Transactions on Automatic Control This technical note examines the dynamics of networked multi-agent systems operating with a consensus-type algorithm, under the influence of an attached node or external agent. Depending on the specific scenario, the attached node can be viewed as a network intruder or an administrator. We introduce 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\/1327"}],"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=1327"}],"version-history":[{"count":1,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1327\/revisions"}],"predecessor-version":[{"id":1330,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1327\/revisions\/1330"}],"wp:attachment":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/media?parent=1327"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}