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
Finite time quantized average consensus with transmission stopping guarantees and no quantization error
Department of Electrical and Computer Engineering, Division of Systems Engineering, Boston University, Boston, US.
Department of Electrical and Computer Engineering, University of Cyprus, 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
2024 (English)In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 163, article id 111522Article in journal (Refereed) Published
Abstract [en]

Networked control systems, which are composed of spatially distributed sensors and actuators that communicate through wireless networks, are emerging as a fundamental infrastructure technology in 5G and IoT technologies. In order to increase flexibility and reduce deployment and maintenance costs, their operation needs to guarantee (i) efficient communication between nodes and (ii) preservation of available energy. Motivated by these requirements, we present and analyze a novel distributed average consensus algorithm, which (i) operates exclusively on quantized values (in order to guarantee efficient communication and data storage), (ii) relies on event-driven updates (in order to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage), and (iii) allows each node to cease transmissions once the exact average of the initial quantized values has been reached (in order to preserve its stored energy). We characterize the properties of the proposed algorithm and show that its execution, on any time-invariant and strongly connected digraph, allows all nodes to reach in finite time a common consensus value that is equal to the exact average (represented as the ratio of two quantized values). Then, we present upper bounds on (i) the number of transmissions and computations each node has to perform during the execution of the algorithm, and (ii) the memory and energy requirements of each node in order for the algorithm to be executed. Finally, we provide examples that demonstrate the operation, performance, and potential advantages of our proposed algorithm.

Place, publisher, year, edition, pages
Elsevier BV , 2024. Vol. 163, article id 111522
Keywords [en]
Digraphs, Event-triggered distributed algorithms, Multi-agent systems, Quantization, Quantized average consensus
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-343663DOI: 10.1016/j.automatica.2024.111522Scopus ID: 2-s2.0-85184838548OAI: oai:DiVA.org:kth-343663DiVA, id: diva2:1839855
Note

QC 20240222

Available from: 2024-02-22 Created: 2024-02-22 Last updated: 2024-02-22Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Johansson, Karl H.

Search in DiVA

By author/editor
Johansson, 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: 52 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