Deutsch
 
Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

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

Urheber*innen

Peng,  Shanshan
External Organizations;

Lu,  Jianquan
External Organizations;

Wang,  Yishu
External Organizations;

/persons/resource/Juergen.Kurths

Kurths,  Jürgen
Potsdam Institute for Climate Impact Research;

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte in PIKpublic verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

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


Zitierlink: https://publications.pik-potsdam.de/pubman/item/item_32054
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.