Pinning consensus analysis of multi-agent networks with arbitrary topology
Creators
- 1. State Key Laboratory of Power Transmission Equipment and System Security and New Technology, College of Computer Science, Chongqing University, Chongqing 400044 (China)
- 2. School of Software Engineering, Chongqing University, Chongqing 400044 (China)
Description
In this paper the pinning consensus of multi-agent networks with arbitrary topology is investigated. Based on the properties of M-matrix, some criteria of pinning consensus are established for the continuous multi-agent network and the results show that the pinning consensus of the dynamical system depends on the smallest real part of the eigenvalue of the matrix which is composed of the Laplacian matrix of the multi-agent network and the pinning control gains. Meanwhile, the relevant work for the discrete-time system is studied and the corresponding criterion is also obtained. Particularly, the fundamental problem of pinning consensus, that is, what kind of node should be pinned, is investigated and the positive answers to this question are presented. Finally, the correctness of our theoretical findings is demonstrated by some numerical simulated examples. (general)
Availability note (English)
Available from http://dx.doi.org/10.1088/1674-1056/22/9/090202Additional details
Identifiers
Publishing Information
- Journal Title
- Chinese Physics. B
- Journal Volume
- 22
- Journal Issue
- 9
- Journal Page Range
- [7 p.]
- ISSN
- 1674-1056
INIS
- Country of Publication
- China
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 45034138
- Subject category
- S71: CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS;
- Descriptors DEI
- COMPUTERIZED SIMULATION; EIGENVALUES; LAPLACIAN; MATRICES; NETWORK ANALYSIS; TOPOLOGY
- Descriptors DEC
- MATHEMATICAL OPERATORS; MATHEMATICS; SIMULATION