By Topic

Maximum Allowable Loss Probability for Consensus of Multi-Agent Systems Over Random Weighted Lossy Networks

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
$31 $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

2 Author(s)
Ya Zhang ; Sch. of Autom., Southeast Univ., Nanjing, China ; Yu-Ping Tian

This note studies the consensus seeking problem for a team of general linear dynamical agents that communicate via a weighted random lossy network. Linear state feedback consensus protocols are applied and both the weights and feedback gain are treated as control parameters in the protocol. It is shown that the weights and the link loss probabilities of a network have non-negligible effects on the consensus seeking ability of multi-agent systems. Firstly, a weight condition characterized by the eigenvalues of the weighted Laplacian matrix is given for systems over ideal communication networks without packet losses. Secondly, based on stochastic stability analysis a maximum allowable loss probability bound is proposed for systems over random lossy networks. As long as the link loss probabilities of the network are less than this bound and the mean topology has spanning trees, there exist linear protocols solving the mean-square consensus problem of the system.

Published in:

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