Journal
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
Volume 57, Issue 10, Pages 2639-2643Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2012.2214451
Keywords
Aperiodic sampled information; consensus; impulsive algorithms; multi-agent networks
Funding
- National Natural Science Foundation of China [60834002, 60973012, 61073025, 61073026]
- 973 National Basic Research Program of China [2011CB013300, 2011CB013301]
- Research Grants Council of Hong Kong [CityU-113209]
Ask authors/readers for more resources
In this technical note, an impulsive consensus algorithm is proposed for second-order continuous-time multi-agent networks with switching topology. The communication among agents occurs at sampling instants based on position only measurements. By using the property of stochastic matrices and algebraic graph theory, some sufficient conditions are obtained to ensure the consensus of the controlled multi-agent network if the communication graph has a spanning tree jointly. A numerical example is given to illustrate the effectiveness of the proposed algorithm.
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