A graph-theoretic characterization of structural controllability for multi-agent system with switching topology

@article{Liu2009AGC,
  title={A graph-theoretic characterization of structural controllability for multi-agent system with switching topology},
  author={Xiaomeng Liu and Hai Lin and Ben M. Chen},
  journal={Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference},
  year={2009},
  pages={7012-7017}
}
This paper considers the controllability problem for multi-agent systems. In particular, the structural controllability of multi-agent systems with a single leader under switching topologies is investigated. The structural controllability of multi-agent systems is a generalization of the traditional controllability concept for dynamical systems, and purely based on the communication topologies among agents. The main contribution of the paper is a graph-theoretic characterization of the… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
7 Citations
21 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 21 references

On the controllability of nearest neighbor interconnections

  • H. Tanner
  • Proc. of 43rd IEEE Conference on Decision and…
  • 2004
Highly Influential
5 Excerpts

A graph theory based characterization of controllability for nearest neighbour interconnections with fixed topology

  • Z. Ji, H. Lin, T. H. Lee
  • Proc. of the 47rd IEEE Conference on Decision and…
  • 2008
2 Excerpts

Averageconsensus problems in networks of agents with delayed communications

  • G. Ferrari-Trecate
  • Automatica
  • 2008

Controllability of a Leader – Follower Dynamic Network With Switching Topology

  • H. Lin
  • IEEE Trans . Autom . Control
  • 2008

Similar Papers

Loading similar papers…