DocumentCode
175573
Title
Global convergence of a class of nonlinear dynamical networks
Author
Ao Dun ; Di Liang ; Haijing Liu
Author_Institution
Electron. Inf. & Control Eng., Beijing Univ. of Technol., Beijing, China
fYear
2014
fDate
May 31 2014-June 2 2014
Firstpage
576
Lastpage
580
Abstract
This paper considers the global convergence of a class of nonlinear dynamical networks, and the subsystems are discrete time pendulum-like systems. Different from most of the existing results, two kinds of interconnections are considered in view of the fact that the subsystems of networks may have more than one kind of interconnection between each other. The Kalman-Yakubovich-Popov (KYP) lemma and the Schur complement formula are applied to get novel criteria, which have the forms of linear matrix inequalities (LMIs). The Kronecker product is presented which can be used to handle a class of LMI problems. The test of the global convergence of a network of pendulum-like systems is separated into the test of the global convergence of several independent pendulum-like systems. Furthermore, a controller design method based on LMIs is provided. Finally, a numerical example is presented to illustrate the efficiency and applicability of the proposed methods.
Keywords
control system synthesis; convergence; discrete time systems; linear matrix inequalities; nonlinear dynamical systems; KYP lemma; Kalman-Yakubovich-Popov lemma; Kronecker product; LMI; Schur complement formula; controller design method; discrete time pendulum-like system; global convergence; independent pendulum-like system; linear matrix inequality; nonlinear dynamical networks; Complex networks; Control systems; Convergence; Eigenvalues and eigenfunctions; Frequency-domain analysis; Linear matrix inequalities; Synchronization; Global convergence; KYP lemma; Kronecker product; Nonlinear networks; Pendulum-like systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference (2014 CCDC), The 26th Chinese
Conference_Location
Changsha
Print_ISBN
978-1-4799-3707-3
Type
conf
DOI
10.1109/CCDC.2014.6852232
Filename
6852232
Link To Document