Pulling the strings on agreement: Anchoring, controllability, and graph automorphisms

Amirreza Rahmani, Mehran Mesbahi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Scopus citations

Abstract

This work examines the controlled Laplacian (or agreement) over a network of interconnected dynamic units. This dynamics has recently been the focus of a large number of research work in the systems community. Most of the existing work in this area- however- consider the unforced agreement protocol. In the present paper, we consider the controlled version of this dynamics and introduce graph theoretic conditions for its system theoretic properties. In particular, we show how the symmetry structure of the network, characterized in terms of its automorphism group, relates to the network controllability. Some of the ramifications of such a characterization are then explored.

Original languageEnglish
Title of host publicationProceedings of the American Control Conference
Pages2738-2743
Number of pages6
DOIs
StatePublished - Dec 1 2007
Event2007 American Control Conference, ACC - New York, NY, United States
Duration: Jul 9 2007Jul 13 2007

Other

Other2007 American Control Conference, ACC
CountryUnited States
CityNew York, NY
Period7/9/077/13/07

    Fingerprint

Keywords

  • Agreement dynamics
  • Algebraic graph theory
  • Automorphism group
  • Controllability

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Rahmani, A., & Mesbahi, M. (2007). Pulling the strings on agreement: Anchoring, controllability, and graph automorphisms. In Proceedings of the American Control Conference (pp. 2738-2743). [4282502] https://doi.org/10.1109/ACC.2007.4282502