Controllability of multi-agent systems from a graph-theoretic perspective

Amirreza Rahmani, Meng Ji, Mehran Mesbahi, Magnus Egerstedt

Research output: Contribution to journalArticle

462 Citations (Scopus)

Abstract

In this work, we consider the controlled agreement problem for multi-agent networks, where a collection of agents take on leader roles while the remaining agents execute local, consensus-like protocols. Our aim is to identify reflections of graph-theoretic notions on systemtheoretic properties of such systems. In particular, we show how the symmetry structure of the network, characterized in terms of its automorphism group, directly relates to the controllability of the corresponding multi-agent system. Moreover, we introduce network equitable partitions as a means by which such controllability characterizations can be extended to the multileader setting.

Original languageEnglish
Pages (from-to)162-186
Number of pages25
JournalSIAM Journal on Control and Optimization
Volume48
Issue number1
DOIs
StatePublished - Feb 23 2009

Fingerprint

Controllability
Multi agent systems
Multi-agent Systems
Graph in graph theory
Automorphism Group
Partition
Symmetry

Keywords

  • Agreement dynamics
  • Algebraic graph theory
  • Automorphism group
  • Controllability
  • Equitable partitions
  • Multi-agent systems
  • Networked systems

ASJC Scopus subject areas

  • Control and Optimization
  • Applied Mathematics

Cite this

Controllability of multi-agent systems from a graph-theoretic perspective. / Rahmani, Amirreza; Ji, Meng; Mesbahi, Mehran; Egerstedt, Magnus.

In: SIAM Journal on Control and Optimization, Vol. 48, No. 1, 23.02.2009, p. 162-186.

Research output: Contribution to journalArticle

Rahmani, Amirreza ; Ji, Meng ; Mesbahi, Mehran ; Egerstedt, Magnus. / Controllability of multi-agent systems from a graph-theoretic perspective. In: SIAM Journal on Control and Optimization. 2009 ; Vol. 48, No. 1. pp. 162-186.
@article{fcf562e4bd184f36a7fe3b9a8838e953,
title = "Controllability of multi-agent systems from a graph-theoretic perspective",
abstract = "In this work, we consider the controlled agreement problem for multi-agent networks, where a collection of agents take on leader roles while the remaining agents execute local, consensus-like protocols. Our aim is to identify reflections of graph-theoretic notions on systemtheoretic properties of such systems. In particular, we show how the symmetry structure of the network, characterized in terms of its automorphism group, directly relates to the controllability of the corresponding multi-agent system. Moreover, we introduce network equitable partitions as a means by which such controllability characterizations can be extended to the multileader setting.",
keywords = "Agreement dynamics, Algebraic graph theory, Automorphism group, Controllability, Equitable partitions, Multi-agent systems, Networked systems",
author = "Amirreza Rahmani and Meng Ji and Mehran Mesbahi and Magnus Egerstedt",
year = "2009",
month = "2",
day = "23",
doi = "10.1137/060674971",
language = "English",
volume = "48",
pages = "162--186",
journal = "SIAM Journal on Control and Optimization",
issn = "0363-0129",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "1",

}

TY - JOUR

T1 - Controllability of multi-agent systems from a graph-theoretic perspective

AU - Rahmani, Amirreza

AU - Ji, Meng

AU - Mesbahi, Mehran

AU - Egerstedt, Magnus

PY - 2009/2/23

Y1 - 2009/2/23

N2 - In this work, we consider the controlled agreement problem for multi-agent networks, where a collection of agents take on leader roles while the remaining agents execute local, consensus-like protocols. Our aim is to identify reflections of graph-theoretic notions on systemtheoretic properties of such systems. In particular, we show how the symmetry structure of the network, characterized in terms of its automorphism group, directly relates to the controllability of the corresponding multi-agent system. Moreover, we introduce network equitable partitions as a means by which such controllability characterizations can be extended to the multileader setting.

AB - In this work, we consider the controlled agreement problem for multi-agent networks, where a collection of agents take on leader roles while the remaining agents execute local, consensus-like protocols. Our aim is to identify reflections of graph-theoretic notions on systemtheoretic properties of such systems. In particular, we show how the symmetry structure of the network, characterized in terms of its automorphism group, directly relates to the controllability of the corresponding multi-agent system. Moreover, we introduce network equitable partitions as a means by which such controllability characterizations can be extended to the multileader setting.

KW - Agreement dynamics

KW - Algebraic graph theory

KW - Automorphism group

KW - Controllability

KW - Equitable partitions

KW - Multi-agent systems

KW - Networked systems

UR - http://www.scopus.com/inward/record.url?scp=60349092443&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=60349092443&partnerID=8YFLogxK

U2 - 10.1137/060674971

DO - 10.1137/060674971

M3 - Article

AN - SCOPUS:60349092443

VL - 48

SP - 162

EP - 186

JO - SIAM Journal on Control and Optimization

JF - SIAM Journal on Control and Optimization

SN - 0363-0129

IS - 1

ER -