Computer Science ›› 2020, Vol. 47 ›› Issue (1): 212-218.doi: 10.11896/jsjkx.181001898

• Artificial Intelligence • Previous Articles     Next Articles

Time-variant Neurocomputing with Finite-value Terminal Recurrent Neural Networks

SUN Ming-xuan,WENG Ding-en,ZHANG Yu   

  1. (College of Information Engineering,Zhejiang University of Technology,Hangzhou 310023,China)
  • Received:2018-10-11 Published:2020-01-19
  • About author:SUN Ming-xuan,born in 1961,Ph.D,professor,Ph.D supervisor.His main research interests include learning systems and neural computing.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (61573320).

Abstract: Conventional computing methods,by using recurrent neural networks,ensure the asymptotic convergence of the computing error such that the error converges to zero and the exact solution can be obtained as time approaches infinity.In this paper,a novel model of terminal recurrent neural networks was presented to address online computation problems arising from time-varying matrices.Such kind of network model is of the characteristics of the limited values of the right-hand side function and the finite settling time.Firstly,the shortcoming of asymptotically convergent network models in solving time-varying computational problems is analyzed,and the necessity of introducing the terminal network models is given.Then,the dynamics of the terminal network is characterized with the derivation for the expression of the settling time.For solving the problems of inverse and genera-lized inverses of time-varying matrices,an error function is defined,a terminal recurrent neural network is constructed based on the error function,so that the accurate solution can be achieved.For the path planning of industrial manipulators,the end effector tracks the closed trajectory by applying the terminal neural network,the joint angle returns to the initial position,and the repetitive motion is conducted in the presence of arbitrary initial position.MATLAB/SIMULINK is used for simulation of solving time-varying matrix computing problems and trajectory planning tasks of manipulators.By comparing the results obtained by the asymptotic network and the terminal network,it can be seen that the computing process using the terminal network converges in finite time and the computing accuracy is improved significantly.The presented solutions for different time-varying computing problems exhibit the applicability of the proposed terminal networks.

Key words: Terminal neural networks, Inverse matrix, Generalized inverses, Path planning, Industrial manipulators

CLC Number: 

  • TP18
[1]HOPFIELD J J.Neurons with graded response have collective computational properties like those of two-state neurons[J].Proceedings of the National Academy of Sciences,1984,81(10):3088-3092.
[2]KENNEDY M P,CHUA L O.Neural networks for nonlinear programming [J].IEEE Transactions on Circuits and Systems,1988,35(5):554-562.
[3]RODRIGUEZ-VAZQUEZ A,DOMINGUEZ-CASTRO R,RUEDA A,et al.Nonlinear switched capacitor neural networks for optimization problems [J].IEEE Transactions on Circuits and Systems,1990,37(3):384-398.
[4]LIU S,WANG J.A simplified dual neural network for quadratic programming with its KWTA application [J].IEEE Transactions on Neural Networks,2006,17(6):1500-1510.
[5]ROBERT H,STURGES.Analog matrix inversion (robot kinematics) [J].IEEE Journal on Robotics & Automation,2002,4(2):157-162.
[6]YEUNG K S,KUMBI F.Symbolic matrix inversion with application to electronic circuits[J].IEEE Transactions on Circuits &Systems,1988,35(2):235-238.
[7]EI-AMAWY A.A systolic architecture for fast dense matrix inversion [J].IEEE Transactions on Computers,1989,38(3):449-445.
[8]WANG Y Q,GOOI JH B.New ordering methods for space matrix inversion via diagonalization [J].IEEE Transactions on Power Systems,1997,12(3):1298-1305.
[9]ZHANG Y N,JIANG D,WANG J.A recurrent neural network for solving Sylvester equation with time-varying coefficients [J].IEEE Transactions on Neural Networks,2002,13(5):1053-1063.
[10]ZHANG Y N,GE S Z.Design and analysis of a general recurrent neural network model for time-varying matrix inversion [J].IEEE Transactions on Neural Networks,2005,16(6):1477-1490.
[11]SHI Y,QIU B,CHEN D,et al.Proposing and validation of new four-point finite-difference formula with manipulator application [J].IEEE Transactions on Industrial Informatics,2018,14(4):1323-1333.
[12]COURRIEU P.Fast computation of moore-penrose inverse matrices [J].Neural Information Processing Letters and Reviews,2005,8(2):25-29.
[13]GUO W B,HUANG T.Method of elementary transformation to compute Moore-Penrose inverse [J].Applied Mathematics and Computation,2010,216(5):1614-1617.
[14]WANG J.Recurrent neural network for computing pseudoinverses of rank-deficient matrices [J].Siam Journal on Scientific Computing,1997,18(5):1479-1493.
[15]WU G,WANG J,HOOTMAN J.A recurrent neural network for computing pseudoinverse matrices [J].Mathematical and Computer Modelling,1994,20(1):13-21.
[16]LI S,LI Y M,WANG Z.A class of finite-Time dual neural networks for solving quadratic programming problems and its k-winners-take-all application [J].Neural Networks,2013,39(39):27-39.
[17]LI S,LI Y M.Nonlinearly activated neural network for solving time-varying complex Sylvester equation [J].IEEE Transactions on Cybernetics,2014,44(8):1397-1407.
[18]SUN M X,YU X F,KONG Y.Terminal neural computing:finite-time convergence and the related application [J].Journal of Zhejiang University of Technology,2015,43(3):311-317.
[19]XIAO L,LIAO B,LI S,et al.Design and analysis of FTZNN ap- plied to the real-time solution of a nonstationary Lyapunov equation and tracking control of a wheeled mobile manipulator [J].IEEE Transactions on Industrial Informatics,2018,14(1):98-105.
[20]XIAO L,LIAO B L,LI S,et al.Nonlinear recurrent neural networks for finite-time solution of general time-varying linear matrix equations [J].Neural Networks,2018,98:102-113.
[21]HOLLERBACH J,SUH K.Redundancy resolution of manipulators through torque optimization [J].IEEE Journal of Robotics and Automation,1987,3(4):308-316.
[22]TCHON K,JAKUBIAK J.A repeatable inverse kinematics algorithm with linear invariant subspaces for mobile manipulators[J].IEEE Transactions on Systems Man and Cybernetics Part B,2005,35(5):1051-1057.
[23]ZHANG Y N,WANG J,XIA Y S.A dual neural network for redundancy resolution of kinematically redundant manipulators subject to joint limits and joint velocity limits [J].IEEE Tran-sactions on Neural Networks,2003,14(3):658-667.
[24]GUO D S,ZHANG Y N.Acceleration-level inequality-based MAN scheme for obstacle avoidance of redundant robot manipu-lators[J].IEEE Transactions on Industrial Electronics,2014,61(12):6903-6914.
[25]LI S,ZHANG Y N,LONG J.Kinematic control of redundant manipulators using neural networks [J].IEEE Transactions on Neural Networks and Learning Systems,2017,28(10):2243-2254.
[26]JIN L,ZHANG Y,LI S.Integration-enhanced zhang neural network for real-time-varying matrix inversion in the presence of various kinds of noises [J].IEEE Transactions on Neural Networks and Learning Systems,2016,27(12):2615-2627.
[27]LI S,WANG H Q,RAFIQUE U M.A novelrecurrent neural network for manipulator control with improved noise tolerance [J].IEEE Transactions on Neural Networks and Learning Systems,2018,29(5):1908-1918.
[1] LIU Xiao-zhen,LIU Jing-sen. Distribution Routing Problem Based on Cuckoo Search Algorithm with Directional Mutation [J]. Computer Science, 2019, 46(7): 165-171.
[2] ZHONG Mei-su, YANG Yong-sheng, ZHOU Ya-min. Free-conflict AGV Path Planning in Automated Terminals Based on Speed Control [J]. Computer Science, 2019, 46(7): 308-314.
[3] YANG Ying, YANG Wu-de, WU Hua-rui, MIAO Yi-sheng. Mobile Sink Based Data Collection Strategy for Farmland WSN [J]. Computer Science, 2019, 46(4): 106-111.
[4] CHAI Hui-min, FANG Min, LV Shao-nan. Local Path Planning of Mobile Robot Based on Situation Assessment Technology [J]. Computer Science, 2019, 46(4): 210-215.
[5] CHENG Hao-hao, YANG Sen, QI Xiao-hui. Online Obstacle Avoidance and Path Planning of Quadrotor Oriented to Urban Environment [J]. Computer Science, 2019, 46(4): 241-246.
[6] XI Feng-fei, ZENG Xi, JI Shi-ming, CHEN Guo-da, CAI Chao-peng. Path Planning of Mobile Robot Based on PG-RRT Algorithm [J]. Computer Science, 2019, 46(4): 247-253.
[7] SUN Yi-bin, YANG Hui-zhen. Path Planning Based on Pulse Coupled Neural Networks with Directed Constraint [J]. Computer Science, 2019, 46(11A): 28-32.
[8] XU Ji-ning, ZENG Jie. Dynamic Target Following Based on Reinforcement Learning of Robot-car [J]. Computer Science, 2019, 46(11A): 94-97.
[9] LI Shan-shan, LIU Fu-jiang, LIN Wei-hua. Path Planning Method of Large-scale Fire Based on Multiple Starting Points and Multiple Rescue Points [J]. Computer Science, 2019, 46(11A): 134-137.
[10] KONG Ying, SUN Ming-xuan. Repeatable Motion Planning of Redundant Manipulators Based on Terminal Neural Networks [J]. Computer Science, 2018, 45(12): 201-205.
[11] LIU Jun, XU Ping-ping, WU Gui-lu, PENG Jie. PSO-ACO Fusion Algorithm Based on Optimal Path Planning in Indoor Environment [J]. Computer Science, 2018, 45(11A): 97-100.
[12] KONG Ying, SUN Ming-xuan. Terminal Neural Network Algorithm for Solution of Time-varying Sylvester Matrix Equations [J]. Computer Science, 2018, 45(10): 207-211, 239.
[13] LIU Jie, ZHAO Hai-fang and ZHOU De-lian. Improved Quantum Behaved Particle Swarm Optimization Algorithm for Mobile Robot Path Planning [J]. Computer Science, 2017, 44(Z11): 123-128.
[14] TAI Ying-peng, XING Ke-xin, LIN Ye-gui and ZHANG Wen-an. Research of Path Planning in Multi-AGV System [J]. Computer Science, 2017, 44(Z11): 84-87.
[15] JIA Chun-xue, LUO Qi and GONG Yang-yang. Obstacle Avoidance Path Planning for Irregular Obstacles [J]. Computer Science, 2017, 44(9): 290-295.
Full text



[1] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[2] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[3] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111, 142 .
[4] PANG Bo, JIN Qian-kun, HENIGULI·Wu Mai Er and QI Xing-bin. Routing Scheme Based on Network Slicing and ILP Model in SDN[J]. Computer Science, 2018, 45(4): 143 -147 .
[5] LIANG Jun-bin, ZHOU Xiang, WANG Tian and LI Tao-shen. Research Progress on Data Collection in Mobile Low-duty-cycle Wireless Sensor Networks[J]. Computer Science, 2018, 45(4): 19 -24, 52 .
[6] YANG Pei-an, WU Yang, SU Li-ya, LIU Bao-xu. Overview of Threat Intelligence Sharing Technologies in Cyberspace[J]. Computer Science, 2018, 45(6): 9 -18,26 .
[7] HU Qing-cheng, ZHANG Yong, XING Chun-xiao. K-clique Heuristic Algorithm for Influence Maximization in Social Network[J]. Computer Science, 2018, 45(6): 32 -35 .
[8] ZHOU Chun-jie,ZHANG Zhi-wang,TANG Wen-jing. System and Methods of Passenger Demand Prediction on Bus Network[J]. Computer Science, 2018, 45(6A): 527 -535 .
[9] ZHANG Pan-pan, PENG Chang-gen, HAO Chen-yan. Privacy Protection Model and Privacy Metric Methods Based on Privacy Preference[J]. Computer Science, 2018, 45(6): 130 -134 .
[10] WANG Qian, YU Lai-hang, CAO Yan, ZHANG Lei, QIN Jie, YE Hai-qin. Blind Watermarking Algorithm for Digital Image Based on Fibonacci Scrambling in Wavelet Domain[J]. Computer Science, 2018, 45(6): 135 -140 .