Name
Abstract | ||
|---|---|---|
The bipartite consensus problem of multiple twotime scales agents over the signed digraph, where both cooperative and competitive interactions exist among the agents, is considered with a new distributed protocol. Sufficient conditions for bipartite consensus is presented in terms of easily checkable algebraic Riccati equation (ARE). Compared with the existing result on consensus of multiple two-time scales agents, the communication topology here is more generic. Moreover, the upper bound of the singular perturbation parameter is also presented. Simulation examples are given to illustrate the effectiveness of the proposed results. |
Year | Venue | Field |
|---|---|---|
2016 | 2016 14TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION (ICARCV) | Consensus,Discrete mathematics,Combinatorics,Computer science,Upper and lower bounds,Bipartite graph,Symmetric matrix,Singular perturbation,Algebraic Riccati equation,Digraph |
DocType | ISSN | Citations |
Conference | 2474-2953 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wu Yang | 1 | 1 | 0.69 |
| Yan-Wu Wang | 2 | 25 | 3.68 |
| Jiang-Wen Xiao | 3 | 13 | 3.67 |
| Wu-Hua Chen | 4 | 869 | 58.24 |