Consensus in directed networks of agents with nonlinear dynamics

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

331 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Article number5710398
Pages (from-to)1436-1441
Journal / PublicationIEEE Transactions on Automatic Control
Volume56
Issue number6
Publication statusPublished - Jun 2011

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.

Research Area(s)

  • Algebraic graph theory, complex network, consensus, Lyapunov function, synchronization