Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Graph-Theoretic Characterizations of Structural Controllability for Multi-Agent System with Switching Topology (1203.5583v1)

Published 26 Mar 2012 in cs.MA and cs.SY

Abstract: This paper considers the controllability problem for multi-agent systems. In particular, the structural controllability of multi-agent systems 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 contributions of the paper are graph-theoretic characterizations of the structural controllability for multi-agent systems. It turns out that the multi-agent system with switching topology is structurally controllable if and only if the union graph G of the underlying communication topologies is connected (single leader) or leader-follower connected (multi-leader). Finally, the paper concludes with several illustrative examples and discussions of the results and future work.

Citations (27)

Summary

We haven't generated a summary for this paper yet.