Journal
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS
Volume 27, Issue 4, Pages 762-770Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNNLS.2015.2424225
Keywords
Antagonistic interactions; cooperative interactions; distributed protocols; finite-time consensus; multiagent systems
Categories
Funding
- National Basic Research Program of China (973 Program) [2012CB821200, 2012CB821201]
- National Natural Science Foundation of China (NSFC) [61473010, 61134005, 61221061, 61327807, 61320106006]
- Fundamental Research Funds for Central Universities
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
