kth.sePublications KTH
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
A Window-Based Periodic Event-Triggered Consensus Scheme for Multiagent Systems
Univ Stuttgart, Inst Syst Theory & Automat Control, D-70569 Stuttgart, Germany..
Univ Stuttgart, Inst Syst Theory & Automat Control, D-70569 Stuttgart, Germany..
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control). Univ Oxford, Dept Comp Sci, Oxford OX1 3QD, England..ORCID iD: 0000-0001-6046-7129
Univ Stuttgart, Inst Syst Theory & Automat Control, D-70569 Stuttgart, Germany..
Show others and affiliations
2024 (English)In: IEEE Transactions on Control of Network Systems, E-ISSN 2325-5870, Vol. 11, no 1, p. 414-426Article in journal (Refereed) Published
Abstract [en]

In this article, we consider the periodic event-triggered consensus problem for single-integrator multiagent systems. In existing approaches, consensus is typically achieved by trigger schemes enforcing a monotone decrease of a Lyapunov function. Such trigger schemes may, however, result in more transmissions than are actually required to ensure consensus or meet certain performance specifications. This is because a monotone decrease may be a rather conservative condition for a given Lyapunov function in an event-triggered setting. To overcome the conservativity, we propose a novel window-based trigger scheme, which allows us to leverage existing trigger schemes from the literature to derive less conservative ones. This is achieved by taking the past system behavior into account and allowing a temporary increase of the Lyapunov function as long as a decreasing tendency is still guaranteed. For that, information from previous time steps within certain time windows is considered. We provide an explicit bound on the evolution of the Lyapunov function that is the same for the window-based scheme and the (monotone) original trigger schemes. To illustrate the benefits of the window-based scheme, we validate its efficacy through a comprehensive simulation study and demonstrate that the scheme typically reduces the average update rate of the underlying communication structure in comparison to the original trigger schemes.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2024. Vol. 11, no 1, p. 414-426
Keywords [en]
Lyapunov methods, Eigenvalues and eigenfunctions, Behavioral sciences, Upper bound, Convergence, Symmetric matrices, Network systems, Communication networks, event-triggered consensus, networked control systems, networks of autonomous agents
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-345949DOI: 10.1109/TCNS.2023.3285863ISI: 001188324100020Scopus ID: 2-s2.0-85162645216OAI: oai:DiVA.org:kth-345949DiVA, id: diva2:1855623
Note

QC 20240502

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

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Yu, PianDimarogonas, Dimos V.

Search in DiVA

By author/editor
Yu, PianDimarogonas, Dimos V.
By organisation
Decision and Control Systems (Automatic Control)
In the same journal
IEEE Transactions on Control of Network Systems
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 87 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