• DocumentCode
    2856187
  • Title

    Hierarchical assembly of leader-asymmetric, single-leader networks

  • Author

    Abbas, W. ; Egerstedt, M.

  • Author_Institution
    Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
  • fYear
    2011
  • fDate
    June 29 2011-July 1 2011
  • Firstpage
    1082
  • Lastpage
    1087
  • Abstract
    The connection between leader-asymmetry and controllability in controlled agreement networks provides a topological, necessary condition for controllability. In this paper we investigate how to produce hierarchical networks that, at each level in the hierarchy, exhibit the leader-asymmetry properties. Graph grammars are moreover provided for assembling the leader-asymmetric networks of any size.
  • Keywords
    controllability; graph grammars; multi-robot systems; controllability; graph grammars; hierarchical assembly; hierarchical networks; leader-asymmetric networks; single-leader networks; Controllability; Crystals; Grammar; Joining processes; Lead; Self-assembly; Trajectory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    American Control Conference (ACC), 2011
  • Conference_Location
    San Francisco, CA
  • ISSN
    0743-1619
  • Print_ISBN
    978-1-4577-0080-4
  • Type

    conf

  • DOI
    10.1109/ACC.2011.5991340
  • Filename
    5991340