login

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

IEEE Transactions on Automatic ControlPublished 21 August 2012
Zhi‐Wei Liu, Zhi‐Hong Guan, Xuemin Shen, Gang Feng
Citations233
SJR quartileQ1
SJR score3.80
SNIP2.59

TL;DR

An impulsive consensus algorithm is proposed for second-order continuous-time multi-agent networks with switching topology by using the property of stochastic matrices and algebraic graph theory to ensure the consensus of the controlled multi- agent network if the communication graph has a spanning tree jointly.

Abstract

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.

Keywords

Computer Science