Abstract
In this paper, fixed-time convergent RNNs with logarithmic settling time are proposed for solving time-variant quadratic programming (QP), where the domain of attraction of the RNN models can be reasonably estimated a priori. Two novel activation functions are designed, and the exact expressions of the settling time functions for each given initial condition are given; and upper bounds of the settling times for any given initial condition can be obtained. In addition, the generic activation functions are constructed and analyzed to achieve logarithmic fixed-time settling. The RNNs based on the generic activation function are designed, which have a faster convergence rate and a fixed-time convergence property. By estimating the bound of the settling time function under given initial conditions in the bounded region, the semi-global fixed-time convergence of the RNN model is in turn established. It is shown that the predefined-time convergence of modified RNN models can be assured by adopting the inverse of the bound. Simulation results verify effectiveness of the proposed computing schemes for the time-variant QP problem solving and the repetitive motion planning of a redundant manipulator.








Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Data availability
The datasets generated during and analyzed during the current study are available from the corresponding author on reasonable request.
References
Hopfield JJ (1984) Neurons with graded response have collective computational properties like those of two-state neurons. Proc Natl Acad Sci 81(10):3088–3092
Maa C, Shanblatt M (1992) Linear and quadratic programming neural network analysis. IEEE Trans Neural Netw 3(4):580–594
Bouzerdoum A, Pattison TR (1993) Neural network for quadratic optimization with bound constraints. IEEE Trans Neural Netw 4(2):293–304
Hu X, Zhang B (2009) A new recurrent neural network for solving convex quadratic programming problems with an application to the k-winners-take-all problem. IEEE Trans Neural Netw 20(4):654–664
Jin L, Wei L, Li S (2022) Gradient-based differential neural-solution to time-dependent nonlinear optimization. IEEE Trans Autom Control 68(1):620–627
Whitney DE (1969) Resolved motion rate control of manipulators and human prostheses. IEEE Trans Man Mach Syst 10(2):47–53
Klein CA, Kee KB (1989) The nature of drift in pseudoinverse control of kinematically redundant manipulators. IEEE Trans Robot Autom 5(2):231–234
Zhang Y, Wang J, Xia Y (2003) A dual neural network for redundancy resolution of kinematically redundant manipulators subject to joint limits and joint velocity limits. IEEE Trans Neural Netw 14(3):658–667
Zhang Y, Yi C (2011) Zhang neural networks and neural-dynamic method. Nova Science Publishers, New York
Liu Q, Wang J (2011) Finite-time convergent recurrent neural network with a hard-limiting activation function for constrained optimization with piecewise-linear objective functions. IEEE Trans Neural Netw 22(4):601–613
Li S, Chen S, Liu B (2013) Accelerating a recurrent neural network to finite-time convergence for solving time-varying Sylvester equation by using a sign-bi-power activation function. Neural Process Lett 37(2):189–205
Guo D, Zhang Y (2014) Li-function activated ZNN with finite-time convergence applied to redundant-manipulator kinematic control via time-varying Jacobian matrix pseudoinversion. Appl Soft Comput 24:158–168
Miao P, Shen Y, Huang Y, Wang Y (2015) Solving time-varying quadratic programs based on finite-time Zhang neural networks and their application to robot tracking. Neural Comput Appl 26(3):693–703
Jin L, Li S, Wang H, Zhang Z (2018) Nonconvex projection activated zeroing neurodynamic models for time-varying matrix pseudoinversion with accelerated finite-time convergence. Appl Soft Comput 62:840–850
Jin J, Zhao L, Li M, Yu F, Xi Z (2020) Improved zeroing neural networks for finite time solving nonlinear equations. Neural Comput Appl 32:4151–4160
Ma Z, Yu S, Han Y, Guo D (2021) Zeroing neural network for bound-constrained time-varying nonlinear equation solving and its application to mobile robot manipulators. Neural Comput Appl 33:14231–14245
Xiao L (2019) A finite-time convergent Zhang neural network and its application to real-time matrix square root finding. Neural Comput Appl 31:S793–S800
Sun M, Li X, Zhong G (2023) Semi-global fixed/predefined-time RNN models with comprehensive comparisons for time-variant neural computing. Neural Comput Appl 35:1675–1693
Zhang ZJ, Yan Z, Fu T (2018) Varying-parameter RNN activated by finite-time functions for solving joint-drift problems of redundant robot manipulators. IEEE Trans Ind Inf 14(12):5359–5367
Zhang ZJ, Kong LD, Zheng L (2019) Power-type varying-parameter RNN for solving TVQP problems: design, analysis, and applications. IEEE Trans Neural Netw Learn Syst 30(8):2419–2433
Li W (2018) A recurrent neural network with explicitly definable convergence time for solving time-variant linear matrix equations. IEEE Trans Ind Inf 14(12):5289–5298
Jin L, Zhang Y, Li S, Zhang Y (2017) Noise-tolerant ZNN models for solving time-varying zero-finding problems: a control-theoretic approach. IEEE Trans Autom Control 62(2):992–997
Li W, Su Z, Tan Z (2019) A variable-gain finite-time convergent recurrent neural network for time-variant quadratic programming with unknown noises endured. IEEE Trans Ind Inf 15(9):5330–5340
Xiao L, Dai J, Jin L et al (2021) A noise-enduring and finite-time zeroing neural network for equality-constrained time-varying nonlinear optimization. IEEE Trans Syst Man Cybern Syst 51(8):4729–4740
Sun M, Zhang Y, Wu Y, He XX (2022) On a finitely-activated terminal RNN approach to time-variant problem solving. IEEE Trans Neural Netw Learn Syst 33(12):7289–7302
Polyakov A (2012) Nonlinear feedback design for fixed-time stabilization of linear control systems. IEEE Trans Autom Control 57(8):2106–2110
Sun M (2020) Two-phase attractors for finite-duration consensus of multi- agent systems. IEEE Trans Syst Man Cybern Syst 50(5):1757–1765
Sun M, Li H, Li W (2021) On finite-duration convergent attracting laws. IEEE Trans Syst Man Cybern Syst 51(8):5017–5029
Sanchez-Torres JD, Sanchez EN, Loukianov AG (2015) Predefined-time stability of dynamical systems with sliding modes. Proceedings of American Control Conference Chicago, IL, pp 5842–5846
Jimenez-Rodriguez E, Muoz-Vazquez AJ, Sanchez-Torres JD et al (2020) A Lyapunov-like characterization of predefined-time stability. IEEE Trans Autom Control 65(11):4922–4927
Xiao L, Zhang Y, Hu Z et al (2019) Performance benefits of robust nonlinear zeroing neural network for finding accurate solution of Lyapunov equation in presence of various noises. IEEE Trans Ind Inf 15(9):5161–5171
Xiao L, Cao Y, Dai J et al (2021) Finite-Time and predefined-time convergence design for zeroing neural network: theorem, method, and verification. IEEE Trans Ind Inf 17(7):4724–4732
Li W (2020) Predefined-Time convergent neural solution to cyclical motion planning of redundant robots under physical constraints. IEEE Trans Ind Electron 67(12):10732–10743
Jimenez-Rodriguez E, Sanchez-Torres JD, Loukianov AG (2017) Semi-global predefined-time stable systems. In: Proceedings of 14th international conference on electrical engineering,computing science and automatic control, Mexico City, Mexico
Jimenez-Rodriguez E, Sanchez-Torres JD, Loukianov AG (2018) Semi-global predefined-time stable vector systems. In: Proceedings of IEEE conference on decision and control, Miami Beach, FL, pp 4809–4814
Andrews G, Askey R, Roy R (1999) Special functions. Cambridge University Press, Cambridge
Funding
This work was supported by the National Natural Science Foundation of China under Grant 62073291.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Li, X., Wang, L., Zhong, G. et al. Fixed-time convergent RNNs with logarithmic settling time for time-variant quadratic programming solving with application to repetitive motion planning. Neural Comput & Applic 36, 445–460 (2024). https://doi.org/10.1007/s00521-023-09016-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-023-09016-8