Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • 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
Dynamic Event-Triggered and Self-Triggered Control for Multi-agent Systems
KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik.
Beijing Inst Technol, Sch Automat, Beijing 100081, Peoples R China..
KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik. KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Centrum för autonoma system, CAS. KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, ACCESS Linnaeus Centre.ORCID-id: 0000-0001-7309-8086
KTH, Skolan för elektroteknik och datavetenskap (EECS), Reglerteknik. KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, ACCESS Linnaeus Centre.ORCID-id: 0000-0001-9940-5929
2019 (engelsk)Inngår i: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 64, nr 8, s. 3300-3307Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

We propose two novel dynamic event-triggered control laws to solve the average consensus problem for first-order continuous-time multiagent systems over undirected graphs. Compared with the most existing triggering laws, the proposed laws involve internal dynamic variables, which play an essential role in guaranteeing that the triggering time sequence does not exhibit Zeno behavior. Moreover, some existing triggering laws are special cases of ours. For the proposed self-triggered algorithm, continuous agent listening is avoided as each agent predicts its next triggering time and broadcasts it to its neighbors at the current triggering time. Thus, each agent only needs to sense and broadcast at its triggering times, and to listen to and receive incoming information from its neighbors at their triggering times. It is proved that the proposed triggering laws make the state of each agent converge exponentially to the average of the agents' initial states if and only if the underlying graph is connected. Numerical simulations are provided to illustrate the effectiveness of the theoretical results.

sted, utgiver, år, opplag, sider
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2019. Vol. 64, nr 8, s. 3300-3307
Emneord [en]
Consensus, dynamic event-triggered control, multiagent systems, self-triggered control
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-257567DOI: 10.1109/TAC.2018.2874703ISI: 000478694300016Scopus ID: 2-s2.0-85054510419OAI: oai:DiVA.org:kth-257567DiVA, id: diva2:1353478
Merknad

QC 20190923

Tilgjengelig fra: 2019-09-23 Laget: 2019-09-23 Sist oppdatert: 2019-09-23bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Yi, XinleiDimarogonas, Dimos V.Johansson, Karl H.

Søk i DiVA

Av forfatter/redaktør
Yi, XinleiDimarogonas, Dimos V.Johansson, Karl H.
Av organisasjonen
I samme tidsskrift
IEEE Transactions on Automatic Control

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

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

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • 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