Abstract
This technical note studies the consensus problem for cooperative agents with nonlinear dynamics in a directed network. Both local and global consensus are defined and investigated. Techniques for studying the synchronization in such complex networks are exploited to establish various sufficient conditions for reaching consensus. The local consensus problem is first studied via a combination of the tools of complex analysis, local consensus manifold approach, and Lyapunov methods. A generalized algebraic connectivity is then proposed to study the global consensus problem in strongly connected networks and also in a broad class of networks containing spanning trees, for which ideas from algebraic graph theory, matrix theory, and Lyapunov methods are utilized. © 2006 IEEE.
| Original language | English |
|---|---|
| Article number | 5710398 |
| Pages (from-to) | 1436-1441 |
| Journal | IEEE Transactions on Automatic Control |
| Volume | 56 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - Jun 2011 |
Research Keywords
- Algebraic graph theory
- complex network
- consensus
- Lyapunov function
- synchronization
ESI Highly Cited Papers
- Highly Cited Paper 2020
- Highly Cited Paper 2021
- Highly Cited Paper 2019
- Highly Cited Paper 2022
Fingerprint
Dive into the research topics of 'Consensus in directed networks of agents with nonlinear dynamics'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver