Deutsch
 
Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
  Prescribed-time tracking synchronization of Kuramoto oscillator networks with directed graphs via sine function-based control protocol

Peng, S., Lu, J., Wang, Y., Kurths, J. (2025 online): Prescribed-time tracking synchronization of Kuramoto oscillator networks with directed graphs via sine function-based control protocol. - Communications in Nonlinear Science and Numerical Simulation, 145, 108691.
https://doi.org/10.1016/j.cnsns.2025.108691

Item is

Dateien

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

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Peng, Shanshan1, Autor
Lu, Jianquan1, Autor
Wang, Yishu1, Autor
Kurths, Jürgen2, Autor              
Affiliations:
1External Organizations, ou_persistent22              
2Potsdam Institute for Climate Impact Research, ou_persistent13              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: This paper investigates the prescribed-time tracking synchronization (PTS) of Kuramoto oscillator networks (KONs) with directed graphs. Existing control protocols for achieving KONs’ synchronization within a finite time are based on linear or power functions of phase differences, but they ignore the -periodicity of phase oscillators. This leads to desynchronization and dramatic phase changes, increasing system load, failure rates, and control costs. To overcome these drawbacks, we propose a sine function-based protocol, incorporating the periodicity of oscillators, to achieve tracking synchronization within a prescribed time. Then a new cosine-based error variable is introduced to characterize the degree of tracking synchronization. By leveraging the error variable and constructing an ingenious Lyapunov function, we establish relaxed criteria for achieving PTS of KONs with the proposed protocol. The condition of the graph containing a directed spanning tree is the weakest, and the initial phases can be almost global. Moreover, we demonstrate the boundedness of the protocol. Finally, numerical simulations validate our results’ effectiveness and superiority compared in others.

Details

einblenden:
ausblenden:
Sprache(n): eng - Englisch
 Datum: 2025-02-26
 Publikationsstatus: Online veröffentlicht
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: DOI: 10.1016/j.cnsns.2025.108691
MDB-ID: No data to archive
PIKDOMAIN: RD4 - Complexity Science
Organisational keyword: RD4 - Complexity Science
Research topic keyword: Complex Networks
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Communications in Nonlinear Science and Numerical Simulation
Genre der Quelle: Zeitschrift, SCI, Scopus, p3
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 145 Artikelnummer: 108691 Start- / Endseite: - Identifikator: CoNE: https://publications.pik-potsdam.de/cone/journals/resource/201610061
Publisher: Elsevier