A Linear Push-Pull Average Consensus Algorithm for Delay-Prone Networks

Evagoras Makridis, Themistoklis Charalambous

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

12 Downloads (Pure)

Abstract

In this paper, we address the average consensus problem of multi-agent systems for possibly unbalanced and delay-prone networks with directional information flow. We propose a linear distributed algorithm (referred to as RP-PAC) that handles asynchronous updates and time-varying heterogeneous information delays. Our proposed distributed algorithm utilizes a surplus-consensus mechanism and information regarding the number of incoming and outgoing links to guarantee state averaging, despite the imbalanced and delayed information flow in directional networks. The convergence of the RPPAC algorithm is examined using key properties of the backward product of time-varying matrices that correspond to different snapshots of the directional augmented network.

Original languageEnglish
Title of host publication2024 European Control Conference, ECC 2024
PublisherIEEE
Pages743-749
Number of pages7
ISBN (Electronic)978-3-9071-4410-7
DOIs
Publication statusPublished - 2024
MoE publication typeA4 Conference publication
EventEuropean Control Conference - Stockholm, Sweden
Duration: 25 Jun 202428 Jun 2024

Publication series

Name2024 European Control Conference, ECC 2024

Conference

ConferenceEuropean Control Conference
Abbreviated titleECC
Country/TerritorySweden
CityStockholm
Period25/06/202428/06/2024

Keywords

  • average consensus
  • directed graphs
  • distributed algorithms
  • push-pull consensus
  • time-varying heterogeneous delays

Fingerprint

Dive into the research topics of 'A Linear Push-Pull Average Consensus Algorithm for Delay-Prone Networks'. Together they form a unique fingerprint.

Cite this