Probabilistic consensus in Markovian multi-agent networks

Paolo Bolzern, Davide Cerotti, Patrizio Colaneri, Marco Gribaudo

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

Abstract

This paper addresses the probabilistic consensus problem in a network of Markovian agents. The dynamics of each agent ismodeled as a finite-state Markov chain, with transition rates that are affected by the communication with the neighbors, so inducing an emulation effect. Consensus is reached when all the agent probability vectors converge to a common steady-state probability vector. The main result of the paper is the proof of consensus for communication networks described by either a complete graph or a star-topology graph. These results are also important in a network control perspective, as some parameters of the network model could be used as tuning knobs to steer the steady-state consensus wherever desired.

Original languageEnglish
Title of host publication2014 European Control Conference, ECC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages558-563
Number of pages6
ISBN (Electronic)9783952426913
DOIs
Publication statusPublished - 22 Jul 2014
Externally publishedYes
Event13th European Control Conference, ECC 2014 - Strasbourg, France
Duration: 24 Jun 201427 Jun 2014

Publication series

Name2014 European Control Conference, ECC 2014

Conference

Conference13th European Control Conference, ECC 2014
Country/TerritoryFrance
CityStrasbourg
Period24/06/1427/06/14

Fingerprint

Dive into the research topics of 'Probabilistic consensus in Markovian multi-agent networks'. Together they form a unique fingerprint.

Cite this