Skip to main navigation Skip to search Skip to main content

Consensus of multi-agent systems under a class of randomly time-varying networks

  • Peking University

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

Abstract

Consensus of multi-agent systems under random networks has attracted considerable attention. In previous literatures, it is often assumed that the agents communicate through Markov switching networks. However, in some engineering applications, the available network information is the expectation of the Laplacian matrix and the time-varying networks are not proper to be regarded as Markov switching. To solve this problem, we develop a method to cope with the mean square consensus of multi-agent systems. Based on the properties of expectation of Laplacian matrix, we present the design of relevant parameters and establish some conditions to guarantee the mean square consensus. Numerical simulations are also given to validate our approach.

Original languageEnglish
Title of host publicationProceedings of the 36th Chinese Control Conference, CCC 2017
EditorsTao Liu, Qianchuan Zhao
PublisherIEEE Computer Society
Pages8096-8100
Number of pages5
ISBN (Electronic)9789881563934
DOIs
StatePublished - 7 Sep 2017
Externally publishedYes
Event36th Chinese Control Conference, CCC 2017 - Dalian, China
Duration: 26 Jul 201728 Jul 2017

Publication series

NameChinese Control Conference, CCC
ISSN (Print)1934-1768
ISSN (Electronic)2161-2927

Conference

Conference36th Chinese Control Conference, CCC 2017
Country/TerritoryChina
CityDalian
Period26/07/1728/07/17

Keywords

  • consensus
  • multi-agent systems
  • randomly time-varying networks

Fingerprint

Dive into the research topics of 'Consensus of multi-agent systems under a class of randomly time-varying networks'. Together they form a unique fingerprint.

Cite this