Abstract
In this article, to solve a time-varying quadratic programming with equation constraint, a new time-specified zeroing neural network (TSZNN) is proposed and analyzed. Unlike the existing methods such as the Zhang neural network with different activation functions and a finite-time neural network, the TSZNN model is incorporated into a terminal attractor, and the convergent error can be guaranteed to reduce to zero in advance (instead of the finite-time property). The main advantage of the TSZNN model is that it is independent of the initial state of the systematic dynamics, which is much astonishing to the finite convergence relying on the initial conditions and comprehensively modifies the convergent performance. Mathematical analyses substantiate the prespecified convergence of the TSZNN model and high convergent precision under the situation of various convergent time settings. The prespecified convergence of the TSZNN model for a quadratic programming problem has been mathematically proved under different convergent constant settings. In addition, simulation applications conducted on a repeatable trajectory planning of the redundant manipulator are studied to demonstrate the validity of the proposed TSZNN model.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.