Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • 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, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik. 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..
Vise andre og tillknytning
2024 (engelsk)Inngår i: IEEE Transactions on Control of Network Systems, E-ISSN 2325-5870, Vol. 11, nr 1, s. 414-426Artikkel i tidsskrift (Fagfellevurdert) 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.

sted, utgiver, år, opplag, sider
Institute of Electrical and Electronics Engineers (IEEE) , 2024. Vol. 11, nr 1, s. 414-426
Emneord [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
HSV kategori
Identifikatorer
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
Merknad

QC 20240502

Tilgjengelig fra: 2024-05-02 Laget: 2024-05-02 Sist oppdatert: 2024-05-02bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Yu, PianDimarogonas, Dimos V.

Søk i DiVA

Av forfatter/redaktør
Yu, PianDimarogonas, Dimos V.
Av organisasjonen
I samme tidsskrift
IEEE Transactions on Control of Network Systems

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 96 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf