Nonlinear finite-time bipartite consensus protocol for multi-agent systems associated with signed graphs. (English) Zbl 1334.93017
Summary: In this paper, finite-time multi-agent consensus problems are considered under networks associated with signed graphs whose edge weights can be not only positive but also negative. A nonlinear consensus protocol is proposed to guarantee the states of all agents to converge in a finite time. If the signed graph is structurally balanced, then the final consensus states of all agents are the same in modulus but not in sign. Otherwise, if the signed graph is structurally unbalanced, then the states of all agents converge to zero. Moreover, the final consensus states of agents can be provided uniformly regarding a signed-average quantity that depends on both the initial states of agents and the topology structure of the whole multi-agent network. Numerical simulations illustrate that the protocol is effective in achieving the finite-time consensus of agents under signed graphs and can particularly solve the finite-time average consensus problem of agents when their associated graph has all positive edge weights.
MSC:
| 93A14 | Decentralized systems |
| 68T42 | Agent technology and artificial intelligence |
| 93C10 | Nonlinear systems in control theory |
| 94C15 | Applications of graph theory to circuits and networks |
Keywords:
finite-time consensus; multi-agent networks; signed graphs; structural balance; structural unbalance; average consensusReferences:
| [1] | DOI: 10.1371/journal.pone.0038135 · doi:10.1371/journal.pone.0038135 |
| [2] | DOI: 10.1109/TAC.2012.2224251 · Zbl 1369.93433 · doi:10.1109/TAC.2012.2224251 |
| [3] | DOI: 10.1137/S0363012997321358 · Zbl 0945.34039 · doi:10.1137/S0363012997321358 |
| [4] | DOI: 10.1109/TII.2012.2219061 · doi:10.1109/TII.2012.2219061 |
| [5] | DOI: 10.1016/j.automatica.2011.05.013 · Zbl 1226.93008 · doi:10.1016/j.automatica.2011.05.013 |
| [6] | DOI: 10.1073/pnas.1109521108 · doi:10.1073/pnas.1109521108 |
| [7] | DOI: 10.1080/0308108031000053611 · Zbl 1020.05044 · doi:10.1080/0308108031000053611 |
| [8] | DOI: 10.1109/TAC.2008.929392 · Zbl 1367.93434 · doi:10.1109/TAC.2008.929392 |
| [9] | DOI: 10.1109/TAC.2003.812781 · Zbl 1364.93514 · doi:10.1109/TAC.2003.812781 |
| [10] | Khalil H.K, Nonlinear systems (2002) |
| [11] | DOI: 10.1109/TMECH.2009.2014057 · doi:10.1109/TMECH.2009.2014057 |
| [12] | DOI: 10.1016/j.automatica.2011.02.045 · Zbl 1226.93014 · doi:10.1016/j.automatica.2011.02.045 |
| [13] | DOI: 10.1080/00207179.2014.944872 · Zbl 1328.93025 · doi:10.1080/00207179.2014.944872 |
| [14] | DOI: 10.1016/j.sysconle.2011.10.013 · Zbl 1250.93012 · doi:10.1016/j.sysconle.2011.10.013 |
| [15] | DOI: 10.1080/00207170903581603 · Zbl 1197.93144 · doi:10.1080/00207170903581603 |
| [16] | DOI: 10.1109/TAC.2004.841888 · Zbl 1365.93268 · doi:10.1109/TAC.2004.841888 |
| [17] | DOI: 10.1109/TAC.2009.2031203 · Zbl 1367.93405 · doi:10.1109/TAC.2009.2031203 |
| [18] | DOI: 10.1109/TAC.2004.834113 · Zbl 1365.93301 · doi:10.1109/TAC.2004.834113 |
| [19] | DOI: 10.1137/060678324 · Zbl 1182.93008 · doi:10.1137/060678324 |
| [20] | DOI: 10.1109/TAC.2005.846556 · Zbl 1365.93302 · doi:10.1109/TAC.2005.846556 |
| [21] | DOI: 10.1016/j.automatica.2011.06.012 · Zbl 1223.68022 · doi:10.1016/j.automatica.2011.06.012 |
| [22] | DOI: 10.1016/j.sysconle.2014.01.006 · Zbl 1288.93010 · doi:10.1016/j.sysconle.2014.01.006 |
| [23] | DOI: 10.1109/TAC.2010.2041610 · Zbl 1368.93391 · doi:10.1109/TAC.2010.2041610 |
| [24] | DOI: 10.1080/00207179.2012.719637 · Zbl 1278.93017 · doi:10.1080/00207179.2012.719637 |
| [25] | DOI: 10.1016/j.sysconle.2012.12.002 · Zbl 1261.93009 · doi:10.1016/j.sysconle.2012.12.002 |
| [26] | DOI: 10.1080/00207179.2014.883647 · Zbl 1317.93024 · doi:10.1080/00207179.2014.883647 |
| [27] | DOI: 10.1080/00207179.2011.622792 · Zbl 1236.93141 · doi:10.1080/00207179.2011.622792 |
| [28] | DOI: 10.1080/00207179.2013.834484 · Zbl 1317.93027 · doi:10.1080/00207179.2013.834484 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
