Abstract
This paper deals with finite-time consensus problems for multiagent systems that are subject to hybrid cooperative and antagonistic interactions. Two consensus protocols are constructed by employing the nearest neighbor rule. It is shown that under the presented protocols, the states of all agents can be guaranteed to reach an agreement in a finite time regarding consensus values that are the same in modulus but may not be the same in sign. In particular, the second protocol can enable all agents to reach a finite-time consensus with a settling time that is not dependent upon the initial states of agents. Simulation results are given to demonstrate the effectiveness and finite-time convergence of the proposed consensus protocols.
| Original language | English |
|---|---|
| Article number | 7102741 |
| Pages (from-to) | 762-770 |
| Number of pages | 9 |
| Journal | IEEE Transactions on Neural Networks and Learning Systems |
| Volume | 27 |
| Issue number | 4 |
| DOIs | |
| State | Published - Apr 2016 |
Keywords
- Antagonistic interactions
- cooperative interactions
- distributed protocols
- finite-time consensus
- multiagent systems
Fingerprint
Dive into the research topics of 'Finite-Time Consensus for Multiagent Systems With Cooperative and Antagonistic Interactions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver