Deutsch
 
Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
  Twisting-based finite-time consensus for Euler-Lagrange systems with an event-triggered strategy

Jin, X., Wei, D., He, W., Kocarev, L., Tang, Y., Kurths, J. (2020): Twisting-based finite-time consensus for Euler-Lagrange systems with an event-triggered strategy. - IEEE Transactions on Network Science and Engineering, 7, 3, 1007-1018.
https://doi.org/10.1109/TNSE.2019.2900264

Item is

Dateien

einblenden: Dateien
ausblenden: Dateien
:
24716.pdf (Verlagsversion), 2MB
 
Datei-Permalink:
-
Name:
24716.pdf
Beschreibung:
-
Sichtbarkeit:
Privat
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Jin, Xin1, Autor
Wei, Du1, Autor
He, Wangli1, Autor
Kocarev, Ljupco1, Autor
Tang, Yang1, Autor
Kurths, Jürgen2, Autor              
Affiliations:
1External Organizations, ou_persistent22              
2Potsdam Institute for Climate Impact Research, ou_persistent13              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: In this paper, a twisting-based consensus algorithm is put forward to deal with the event-triggered finite-time consensus for networked Lagrangian systems with directed graphs. First, a fully distributed event-triggered finite-time protocol is considered, for which we can show that each agent can achieve the consensus after a settling time. In order to remove the requirement of continuous monitoring, a pull-based triggering mechanism is employed. Simultaneously, the Zeno-behavior can be excluded under a finite-time dynamic condition. Then, due to the advantages of non-chattering behaviors and finite-time convergence, a twisting-based consensus algorithm based on homogeneous techniques is developed to drive the Euler-Lagrange systems to the consensus value in a settling time. By means of Pólya's theorem and Sum of Squares tools, a polynomial Lyapunov function is constructed to verify our criteria. At last, we give a numerical example for 2-DOF prototype manipulators to verify the validity of the theoretical results.

Details

einblenden:
ausblenden:
Sprache(n):
 Datum: 2020-02-19
 Publikationsstatus: Final veröffentlicht
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: DOI: 10.1109/TNSE.2019.2900264
MDB-ID: No data to archive
PIKDOMAIN: RD4 - Complexity Science
Research topic keyword: Complex Networks
Research topic keyword: Nonlinear Dynamics
Model / method: Machine Learning
Organisational keyword: RD4 - Complexity Science
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: IEEE Transactions on Network Science and Engineering
Genre der Quelle: Zeitschrift, SCI, Scopus
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 7 (3) Artikelnummer: - Start- / Endseite: 1007 - 1018 Identifikator: Anderer: Institute of Electrical and Electronics Engineers (IEEE)
Anderer: 2327-4697
CoNE: https://publications.pik-potsdam.de/cone/journals/resource/IEEE-transactions-network-sience-engineering