{"id":1075,"date":"2018-08-23T16:21:46","date_gmt":"2018-08-24T00:21:46","guid":{"rendered":"http:\/\/depts.washington.edu\/uwrainlab\/?page_id=1075"},"modified":"2018-08-23T16:21:46","modified_gmt":"2018-08-24T00:21:46","slug":"on-symmetry-and-controllability-of-multi-agent-systems","status":"publish","type":"page","link":"http:\/\/depts.washington.edu\/uwrainlab\/on-symmetry-and-controllability-of-multi-agent-systems\/","title":{"rendered":"On Symmetry and Controllability of Multi-Agent Systems"},"content":{"rendered":"<p><strong>A. Chapman, M. Mesbahi<\/strong><\/p>\n<p><strong>IEEE Conference on Decision and Control<\/strong><\/p>\n<div class=\"gs_scl\">\n<div id=\"gsc_vcd_descr\" class=\"gsc_vcd_value\">\n<div class=\"row\">\n<div class=\"col ng-scope\">\n<div class=\"ng-scope\">\n<div class=\"abstract-text ng-binding\">This paper delves into the link between symmetry and controllability of networked systems. We examine symmetry results pertaining to the determining sets of a graph and eigenvalue multiplicity. These provide methods to reason how symmetry structure of the network informs the control input design. We generalize graph automorphisms, which represent graph symmetries, to signed fractional graph automorphisms via a semi-definite programming relaxation. Consequently, we extend existing results on the relationship between graph automorphisms and uncontrollability to signed fractional graph automorphisms, showing necessary and sufficient conditions for controllability.<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<div class=\"gs_scl\"><\/div>\n<p><strong>Links:<\/strong><\/p>\n<p><a href=\"https:\/\/ieeexplore.ieee.org\/document\/7039451\/\"><img loading=\"lazy\" class=\"alignnone wp-image-810\" src=\"http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/download.png\" alt=\"\" width=\"26\" height=\"26\" srcset=\"http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/download.png 225w, http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/download-150x150.png 150w\" sizes=\"(max-width: 26px) 100vw, 26px\" \/><\/a> \u00a0 <a href=\"https:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?tp=&amp;arnumber=7039451\"><img loading=\"lazy\" class=\"alignnone wp-image-811\" src=\"http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/image_preview.png\" alt=\"\" width=\"31\" height=\"31\" srcset=\"http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/image_preview.png 250w, http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/image_preview-150x150.png 150w\" sizes=\"(max-width: 31px) 100vw, 31px\" \/><\/a> \u00a0 <a href=\"https:\/\/scholar.google.com\/scholar?hl=en&amp;as_sdt=0%2C48&amp;q=On+Symmetry+and+Controllability+of+Multi-Agent+Systems&amp;btnG=#d=gs_cit&amp;p=&amp;u=%2Fscholar%3Fq%3Dinfo%3A0nIPy4fUe2kJ%3Ascholar.google.com%2F%26output%3Dcite%26scirp%3D0%26hl%3Den\"><img loading=\"lazy\" class=\"alignnone wp-image-809\" src=\"http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/BibTeX_logo.svg_-300x97.png\" alt=\"\" width=\"65\" height=\"21\" srcset=\"http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/BibTeX_logo.svg_-300x97.png 300w, http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/BibTeX_logo.svg_-768x248.png 768w, http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/BibTeX_logo.svg_-1024x330.png 1024w, http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/BibTeX_logo.svg_.png 1200w\" sizes=\"(max-width: 65px) 100vw, 65px\" \/><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>A. Chapman, M. Mesbahi IEEE Conference on Decision and Control This paper delves into the link between symmetry and controllability of networked systems. We examine symmetry results pertaining to the determining sets of a graph and eigenvalue multiplicity. These provide methods to reason how symmetry structure of the network informs the control input design. We [&hellip;]<\/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\/1075"}],"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=1075"}],"version-history":[{"count":1,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1075\/revisions"}],"predecessor-version":[{"id":1076,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1075\/revisions\/1076"}],"wp:attachment":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/media?parent=1075"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}