Skip to main navigation Skip to search Skip to main content

Rotating consensus of the multi-agent system under a directed graph

  • Harbin Institute of Technology Shenzhen

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

Abstract

This paper investigates the problems of the rotating consensus for a first-order multi-agent system under a directed graph. We propose the distributed algorithms for the agents so that agents can revolve around a common center by using local relative information. Two kinds of rotating consensus problems are considered, namely, the rotating radius consensus probelm and the rotating displacement consensus problem. With the help of the graph theory and the Lyapunov theory, it is proved that the multi-agent system reaches relevant desired rotating consensus. Finally, simulation examples are provided to illustrate the correctness and effectiveness of proposed algorithms.

Original languageEnglish
Title of host publicationProceedings of the 37th Chinese Control Conference, CCC 2018
EditorsXin Chen, Qianchuan Zhao
PublisherIEEE Computer Society
Pages7177-7182
Number of pages6
ISBN (Electronic)9789881563941
DOIs
StatePublished - 5 Oct 2018
Externally publishedYes
Event37th Chinese Control Conference, CCC 2018 - Wuhan, China
Duration: 25 Jul 201827 Jul 2018

Publication series

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

Conference

Conference37th Chinese Control Conference, CCC 2018
Country/TerritoryChina
CityWuhan
Period25/07/1827/07/18

Keywords

  • Distributed control
  • Multi-agent system
  • Rotating consensus

Fingerprint

Dive into the research topics of 'Rotating consensus of the multi-agent system under a directed graph'. Together they form a unique fingerprint.

Cite this