Skip to main navigation Skip to search Skip to main content

Graph-theoretic characterization of controllability for multi-agent systems

  • An Hui Zhang*
  • , Shi Jie Zhang
  • , Jian Chen
  • , Hai Bo Guo
  • , Xian Ren Kong
  • , Feng Wang
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

The paper studies the controllability problem for multi-agent systems with leader-follower structure. The relationship between system controllability and communication topology is characterized based on graph theory. A graph theoretic criterion for controllability is provided. The concept of symmetry is extended to multi-leaders systems through permutation group theory, it is proved that both topology symmetry and equitable partition are two special cases of relaxed equitable partitions. Simulation results show effectiveness of proposed method.

Original languageEnglish
Pages (from-to)1621-1626+1631
JournalKongzhi yu Juece/Control and Decision
Volume26
Issue number11
StatePublished - Nov 2011

Keywords

  • Controllability
  • Multi-agent system
  • Orbit partition
  • Relaxed equitable partition

Fingerprint

Dive into the research topics of 'Graph-theoretic characterization of controllability for multi-agent systems'. Together they form a unique fingerprint.

Cite this