Almost sure average consensus of multi-agent systems with time-varying topologies and stochastic communication noises

  • Tao Li*
  • , Ji Feng Zhang
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

This paper is concerned with the average-consensus problem of first-order discrete-time multi-agent networks with time-varying topologies. Each agent can only receive its neighbors' state information corrupted by stochastic communication noises. To attenuate the noises, a distributed stochastic approximation type protocol is used. By using probability limit theory and algebraic graph theory, sufficient conditions are given to ensure consensus to be achieved asymptotically. Especially, if the network switches between jointly-containing-spanning-tree instantaneously balanced graphs, then the designed protocol can guarantee that each individual state converges to a common random variable almost surely. The expectation of this common variable is right the average of the initial states of the whole system.

Original languageEnglish
Title of host publicationProceedings of the 29th Chinese Control Conference, CCC'10
Pages4488-4493
Number of pages6
StatePublished - 2010
Externally publishedYes
Event29th Chinese Control Conference, CCC'10 - Beijing, China
Duration: 29 Jul 201031 Jul 2010

Publication series

NameProceedings of the 29th Chinese Control Conference, CCC'10

Conference

Conference29th Chinese Control Conference, CCC'10
Country/TerritoryChina
CityBeijing
Period29/07/1031/07/10

Keywords

  • Almost sure consensus
  • Average-consensus
  • Communication noise
  • Distribution coordination
  • Multi-agent system

Fingerprint

Dive into the research topics of 'Almost sure average consensus of multi-agent systems with time-varying topologies and stochastic communication noises'. Together they form a unique fingerprint.

Cite this