English
 
Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  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

Files

show Files
hide Files
:
Peng_2025_1-s2.0-S1007570425001029-main.pdf (Publisher version), 2MB
 
File Permalink:
-
Name:
Peng_2025_1-s2.0-S1007570425001029-main.pdf
Description:
-
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Peng, Shanshan1, Author
Lu, Jianquan1, Author
Wang, Yishu1, Author
Kurths, Jürgen2, Author              
Affiliations:
1External Organizations, ou_persistent22              
2Potsdam Institute for Climate Impact Research, ou_persistent13              

Content

show
hide
Free keywords: -
 Abstract: 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

show
hide
Language(s): eng - English
 Dates: 2025-02-26
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: 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
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Communications in Nonlinear Science and Numerical Simulation
Source Genre: Journal, SCI, Scopus, p3
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 145 Sequence Number: 108691 Start / End Page: - Identifier: CoNE: https://publications.pik-potsdam.de/cone/journals/resource/201610061
Publisher: Elsevier