Optimizing synchronizability in networks of coupled systems

Jafarizadeh, S; Tofigh, F; Lipman, J; Abolhasan, M

Optimizing synchronizability in networks of coupled systems

Jafarizadeh, S Tofigh, F

Lipman, J

Abolhasan, M

Permalink

Publisher:: PERGAMON-ELSEVIER SCIENCE LTD
Publication Type:: Journal Article
Citation:: Automatica, 2020, 112
Issue Date:: 2020-02-01

Closed Access

	Filename	Description	Size
	1-s2.0-S0005109819305746-main.pdf	Published version	789.84 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Jafarizadeh, S
dc.contributor.author	Tofigh, F https://orcid.org/0000-0003-1802-488X
dc.contributor.author	Lipman, J https://orcid.org/0000-0003-2877-1168
dc.contributor.author	Abolhasan, M https://orcid.org/0000-0002-4282-6666
dc.date.accessioned	2021-03-24T19:25:12Z
dc.date.available	2021-03-24T19:25:12Z
dc.date.issued	2020-02-01
dc.identifier.citation	Automatica, 2020, 112
dc.identifier.issn	0005-1098
dc.identifier.issn	1873-2836
dc.identifier.uri	http://hdl.handle.net/10453/147506
dc.description.abstract	© 2019 Elsevier Ltd Of collective behaviors in networks of coupled systems, synchronization is of central importance and an extensively studied area. This is due to the fact that it is essential for the proper functioning of a wide variety of natural and engineered systems. Traditionally, uniform coupling strength has been the default choice and the synchronizability measure has been employed for analysis and enhancement of synchronizability. The main drawback of optimizing the synchronizability measure is that it can reach the Pareto frontier but not necessarily a unique point on the Pareto frontier. Additionally, the shortcoming of uniform coupling strength is that it can reach Pareto frontier in specific topologies including edge-transitive graphs. To achieve a unique optimal answer on the Pareto frontier, this paper takes a different approach and addresses the synchronizability in networks of coupled dynamical systems with nonuniform coupling strength and optimizing the synchronizability via maximizing the minimum distance between the nonzero eigenvalues of the Laplacian and the acceptable boundaries for the stability of the system. Furthermore, two solution methods, namely the concave–convex fractional programming and the Semidefinite Programming (SDP) formulations of the problem have been provided. The proposed solution methods have been compared over different topologies and branches of an arbitrary network, where the SDP based approach has shown to be less restricted and more suitable for a wider range of topologies.
dc.language	English
dc.publisher	PERGAMON-ELSEVIER SCIENCE LTD
dc.relation.ispartof	Automatica
dc.relation.isbasedon	10.1016/j.automatica.2019.108711
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	01 Mathematical Sciences, 08 Information and Computing Sciences, 09 Engineering
dc.subject.classification	Industrial Engineering & Automation
dc.title	Optimizing synchronizability in networks of coupled systems
dc.type	Journal Article
utslib.citation.volume	112
utslib.for	0906 Electrical and Electronic Engineering
utslib.for	01 Mathematical Sciences
utslib.for	08 Information and Computing Sciences
utslib.for	09 Engineering
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access	*
dc.date.updated	2021-03-24T19:25:11Z
pubs.publication-status	Published
pubs.volume	112

Abstract:

© 2019 Elsevier Ltd Of collective behaviors in networks of coupled systems, synchronization is of central importance and an extensively studied area. This is due to the fact that it is essential for the proper functioning of a wide variety of natural and engineered systems. Traditionally, uniform coupling strength has been the default choice and the synchronizability measure has been employed for analysis and enhancement of synchronizability. The main drawback of optimizing the synchronizability measure is that it can reach the Pareto frontier but not necessarily a unique point on the Pareto frontier. Additionally, the shortcoming of uniform coupling strength is that it can reach Pareto frontier in specific topologies including edge-transitive graphs. To achieve a unique optimal answer on the Pareto frontier, this paper takes a different approach and addresses the synchronizability in networks of coupled dynamical systems with nonuniform coupling strength and optimizing the synchronizability via maximizing the minimum distance between the nonzero eigenvalues of the Laplacian and the acceptable boundaries for the stability of the system. Furthermore, two solution methods, namely the concave–convex fractional programming and the Semidefinite Programming (SDP) formulations of the problem have been provided. The proposed solution methods have been compared over different topologies and branches of an arbitrary network, where the SDP based approach has shown to be less restricted and more suitable for a wider range of topologies.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/147506