Abstract
In this article, the average consensus problem in directed networks of agents with both switching topology and coupling delay is investigated. First, based on a specific orthogonal transformation of the Laplacian matrix, an important proposition for verifying the positive definiteness of a class of quadratic forms is provided, which is of independent interest in matrix theory. And the relation between weakly connected and strongly connected digraphs is also investigated. Then, it is proved that all the agents reach the average consensus asymptotically for appropriate time delay if the communication topology keeps weakly connected and balanced. Finally, a numerical example is given to demonstrate the effectiveness and advantage of the new result.
Original language | English |
---|---|
Pages (from-to) | 1947-1956 |
Number of pages | 10 |
Journal | International Journal of Systems Science |
Volume | 42 |
Issue number | 12 |
DOIs | |
Publication status | Published - 2011 |
Keywords
- forms, quadratic
- intelligent agents (computer software)
- laplacian matrices
- matrices
- multiagent systems
- number theory
- spanning trees (graph theory)
- topology