Algebraic Graph Theory and Cooperative Control Consensus

15Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cooperative control studies the dynamics of multi-agent dynamical systems linked to each other by a communication graph. The graph represents the allowed information flow between the agents. The objective of cooperative control is to devise control protocols for the individual agents that guarantee synchronized behavior of the states of all the agents in some prescribed sense. In cooperative systems, any control protocol must be distributed in the sense that it respects the prescribed graph topology. That is, the control protocol for each agent is allowed to depend only on information about that agent and its neighbors in the graph. The communication restrictions imposed by graph topologies can severely limit what can be accomplished by local distributed control protocols at each agent. In fact, the graph topological properties complicate the design of synchronization controllers and result in intriguing behaviors of multi-agent systems on graphs that do not occur in single-agent, centralized, or decentralized feedback control systems.

Author supplied keywords

Cite

CITATION STYLE

APA

Lewis, F. L., Zhang, H., Hengster-Movric, K., & Das, A. (2014). Algebraic Graph Theory and Cooperative Control Consensus. In Communications and Control Engineering (pp. 23–71). Springer International Publishing. https://doi.org/10.1007/978-1-4471-5574-4_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free