kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Non-oscillating quantized average consensus over dynamic directed topologies
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control). (Digital Futures)ORCID iD: 0000-0002-8737-1984
Univ Cyprus, Dept Elect & Comp Engn, Nicosia, Cyprus..
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control). (Digital Futures)ORCID iD: 0000-0001-9940-5929
2022 (English)In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 146, article id 110621Article in journal (Refereed) Published
Abstract [en]

In this paper we study the distributed average consensus problem in multi-agent systems with dynamically-changing directed communication links that are subject to quantized information flow. We present and analyze a distributed averaging algorithm which operates exclusively with quantized values (i.e., the information stored, processed and exchanged between neighboring agents is subject to deterministic uniform quantization) and relies on event-driven updates (e.g., to reduce energy con-sumption, communication bandwidth, network congestion, and/or processor usage). We characterize the properties of the proposed distributed algorithm over dynamic directed communication topologies subject to some connectivity conditions and we show that its execution allows each agent to reach, in finite time, a fixed state that is equal (within one quantization level) to the average of the initial states. The main idea of the proposed algorithm is that each agent (i) models its initial state as two quantized fractions which have numerators equal to the agent's initial state and denominators equal to one, and (ii) transmits one fraction randomly while it keeps the other stored. Then, every time an agent receives one or more fractions, it averages their numerators with the numerator of the fraction it stored, and then transmits them to randomly selected out-neighbors. Finally, we provide examples to illustrate the operation, performance, and potential advantages of the proposed algorithm. We compare against various quantized average consensus algorithms and show that our algorithm's convergence speed is among the fastest in the current literature.

Place, publisher, year, edition, pages
Elsevier BV , 2022. Vol. 146, article id 110621
Keywords [en]
Quantized average consensus, Distributed algorithms, Quantization, Digraphs, Multi -agent systems, Event-triggered
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-321267DOI: 10.1016/j.automatica.2022.110621ISI: 000870698100013Scopus ID: 2-s2.0-85139181931OAI: oai:DiVA.org:kth-321267DiVA, id: diva2:1710122
Conference
21st IFAC World Congress (IFAC), JUL 12-17, 2020, Berlin, GERMANY
Note

QC 20221111

Available from: 2022-11-11 Created: 2022-11-11 Last updated: 2022-11-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Rikos, ApostolosJohansson, Karl H.

Search in DiVA

By author/editor
Rikos, ApostolosJohansson, Karl H.
By organisation
Decision and Control Systems (Automatic Control)
In the same journal
Automatica
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 16 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf