4.8 Article

A Recurrent Neural Network With Explicitly Definable Convergence Time for Solving Time-Variant Linear Matrix Equations

Journal

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS
Volume 14, Issue 12, Pages 5289-5298

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TII.2018.2817203

Keywords

Activation function; fixed-time convergence; time-variant linear matrix equation; zeroing neural network

Ask authors/readers for more resources

Time-variant linear matrix equations (TVLMEs) are ubiquitous in engineering. To solve TVLMEs. various zeroing neural network (ZNN) models have been developed. These ZNNs globally converge to the solution of TVLMEs either in infinity long time or in finite time. However, even the convergence time of a finite-time convergent ZNN is implicit and closely dependent on the initial condition of a problem. This may reduce its applicability to time-critical applications in practice. To overcome this problem, this paper for the first time accelerates a ZNN to fixed-time convergence using a novel activation function. The convergence time of the proposed ZNN can be antecedently defined as an explicit parameter. Theoretically, its fixed-time convergence and robustness properties are rigorously proved. Comparative numerical results substantiate the superior convergence and robustness performance of the fixed-time convergent ZNN for TVLMEs solving. Additionally, the fixed-time convergent ZNN is applied to motion planning of a redundant robotic arm.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available