Event-triggered consensus for discrete-time linear multi-agent systems under general directed graphs

Dapeng Yang, Xiangdong Liu

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

7 Citations (Scopus)

Abstract

This paper considers the decentralized event-triggered consensus problem for discrete-time linear multi-agent systems. The communication topology among agents is assumed to be a general directed graph containing a spanning tree. We propose an event-based consensus control algorithm rendering the states of agents reach consensus. The triggering condition is decentralized only based on the agent's own information. Compared to the traditional consensus control law which needs communication at every iteration, the proposed event-triggered consensus algorithm in this paper can reduce the communication load greatly. Simulation is given to illustrate the theoretical results.

Original languageEnglish
Title of host publicationProceeding of the 11th World Congress on Intelligent Control and Automation, WCICA 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2693-2698
Number of pages6
EditionMarch
ISBN (Electronic)9781479958252
DOIs
Publication statusPublished - 2 Mar 2015
Event2014 11th World Congress on Intelligent Control and Automation, WCICA 2014 - Shenyang, China
Duration: 29 Jun 20144 Jul 2014

Publication series

NameProceedings of the World Congress on Intelligent Control and Automation (WCICA)
NumberMarch
Volume2015-March

Conference

Conference2014 11th World Congress on Intelligent Control and Automation, WCICA 2014
Country/TerritoryChina
CityShenyang
Period29/06/144/07/14

Keywords

  • Consensus control
  • Decentralized event-triggering
  • Directed graph
  • General discrete-time system
  • Multi-agent systems

Fingerprint

Dive into the research topics of 'Event-triggered consensus for discrete-time linear multi-agent systems under general directed graphs'. Together they form a unique fingerprint.

Cite this