2014
DOI: 10.1007/s00521-014-1744-4
|View full text |Cite
|
Sign up to set email alerts
|

Solving time-varying quadratic programs based on finite-time Zhang neural networks and their application to robot tracking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
36
1

Year Published

2016
2016
2022
2022

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 109 publications
(38 citation statements)
references
References 30 publications
1
36
1
Order By: Relevance
“…Differing from the time-invariant problems, time-dependent problems are much more difficult to be addressed for the fact that the problems involved, the system coefficients as well as the solutions are all time-dependent [8]- [11]. The conventional time-invariant methods and models generating the related time-invariant solutions would be invalidation due to the inevitable delay (or to say, the lagging behind) errors [12], [13]. Note that the conventional time-invariant methods commonly generate solutions at current moment based on the present known information.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Differing from the time-invariant problems, time-dependent problems are much more difficult to be addressed for the fact that the problems involved, the system coefficients as well as the solutions are all time-dependent [8]- [11]. The conventional time-invariant methods and models generating the related time-invariant solutions would be invalidation due to the inevitable delay (or to say, the lagging behind) errors [12], [13]. Note that the conventional time-invariant methods commonly generate solutions at current moment based on the present known information.…”
Section: Introductionmentioning
confidence: 99%
“…The ZNN is able to selectively define a scalar valued, vector valued, or even matrix valued indefinite error function, which fully utilize the time-derivative information for handling the time-dependent problems [42]- [44]. Conventional solutions via ZNN models have achieved preliminary efficiency on time-dependent nonlinear optimization, and many systems and models on the basis of ZNNs have been generalized and developed [12], [21], [35], [45]- [47]. For instances, as an early attempt, Jin and Zhang [47] introduced an effective discrete time ZNN model to handle the time-dependent nonlinear optimization problems without consideration of inequality constraint or equality constraint.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This estimation error can be reduced to zero by applying recurrent neural networks [33] that have restrictions for real time implementation since the estimation error does not converge to zero in finite time [35]. The estimation error can, however, converge to zero in a finite time if sign-bi-power or Li activation functions are used [35,36], but the estimated upper bound of the convergence time is conservative [37]. In this paper, an analytical solution to a time-varying Sylvester equation is obtained for the special case that time-varying coefficients of the Sylvester equation have affine structures.…”
Section: Introductionmentioning
confidence: 99%
“…However, the neural networks proposed in [23] only deal with convex optimization problems. In this paper, in order to overcome these problems, we design a finite-time recurrent neural network based on the authors' previous work [24,25,26]…”
Section: Introductionmentioning
confidence: 99%