By Topic

Consensus of Multi-Agent Networks With Aperiodic Sampled Communication Via Impulsive Algorithms Using Position-Only Measurements

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zhi-Wei Liu ; Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan, P. R. China ; Zhi-Hong Guan ; Xuemin Shen ; Gang Feng

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.

Published in:

IEEE Transactions on Automatic Control  (Volume:57 ,  Issue: 10 )