A varying-gain recurrent neural-network with super exponential convergence rate for solving nonlinear time-varying systems

被引:9
作者
Zhang, Zhijun [1 ]
Yang, Xiaolu [2 ]
Deng, Xianzhi [1 ]
Li, Lingao [1 ]
机构
[1] South China Univ Technol, Sch Automat Sci & Engn, Guangzhou, Guangdong, Peoples R China
[2] South China Univ Technol, Sch Elect & Informat, Guangzhou, Guangdong, Peoples R China
关键词
Nonlinear time-varying systems; Neural networks; Variable elements; Numerical methods; Super exponential convergence; ONLINE SOLUTION; OPTIMIZATION; EQUATIONS; TRACKING;
D O I
10.1016/j.neucom.2019.04.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In order to solve a nonlinear time-varying system, a novel varying-gain recurrent neural network (termed as VG-RNN) is proposed and analyzed. To achieve a fast convergent performance, a vector-based unbounded error function is first defined. Second, a varying-gain neural dynamic approach is employed to design the recurrent neural network formula. Being different from the traditional constant-gain recurrent neural networks with fixed design parameters such as the gradient-based neural network (termed as GNN) and the zeroing neural network (termed as ZNN), the gain coefficient of the proposed VG-RNN is time-varying, which can change with time evolves. Otherwise, compared to the previous numerical methods on solving nonlinear time-varying systems, the solution obtained by VG-RNN is more precise. Third, rigorous mathematics analysis proves the super exponential convergence and accuracy of the proposed VG-RNN. Numerical experiments demonstrate the high accuracy, effectiveness and superiority of the VG-RNN compared with the conventional neural networks for solving nonlinear time-varying systems. Furthermore, we hope to apply the theory proposed in this paper to practical nonlinear time-varying automatic control systems, such as robots with nonlinear time-varying systems. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:10 / 18
页数:9
相关论文
共 26 条
[1]   Two Approaches for the Stabilization of Nonlinear KdV Equation With Boundary Time-Delay Feedback [J].
Baudouin, Lucie ;
Crepeau, Emmanuelle ;
Valein, Julie .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2019, 64 (04) :1403-1414
[2]   A non-penalty recurrent neural network for solving a class of constrained optimization problems [J].
Hosseini, Alireza .
NEURAL NETWORKS, 2016, 73 :10-25
[3]   A new solution procedure for a nonlinear infinite beam equation of motion [J].
Jang, T. S. .
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2016, 39 :321-331
[4]   Dynamic task allocation in multi-robot coordination for moving target tracking: A distributed approach [J].
Jin, Long ;
Li, Shuai ;
Hung Manh La ;
Zhang, Xin ;
Hu, Bin .
AUTOMATICA, 2019, 100 :75-81
[5]   Neural Dynamics for Cooperative Control of Redundant Robot Manipulators [J].
Jin, Long ;
Li, Shuai ;
Luo, Xin ;
Li, Yangming ;
Qin, Bin .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2018, 14 (09) :3812-3821
[6]   Homotopy perturbation transform method for nonlinear equations using He's polynomials [J].
Khan, Yasir ;
Wu, Qingbiao .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2011, 61 (08) :1963-1967
[7]   A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization [J].
Liu, Qingshan ;
Guo, Zhishan ;
Wang, Jun .
NEURAL NETWORKS, 2012, 26 :99-109
[8]   Fuzzy Approximation-Based Adaptive Backstepping Optimal Control for a Class of Nonlinear Discrete-Time Systems With Dead-Zone [J].
Liu, Yan-Jun ;
Gao, Ying ;
Tong, Shaocheng ;
Li, Yongming .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2016, 24 (01) :16-28
[9]   Enhanced discrete-time Zhang neural network for time-variant matrix inversion in the presence of bias noises [J].
Mao, Mingzhi ;
Li, Jian ;
Jin, Long ;
Li, Shuai ;
Zhang, Yunong .
NEUROCOMPUTING, 2016, 207 :220-230
[10]   Finding all roots of 2 x 2 nonlinear algebraic systems using back-propagation neural networks [J].
Margaris, Athanasios ;
Goulianas, Konstantinos .
NEURAL COMPUTING & APPLICATIONS, 2012, 21 (05) :891-904