Proceedings of 8th IEEE International Symposium on Intelligent Control
DOI: 10.1109/isic.1993.397709
|View full text |Cite
|
Sign up to set email alerts
|

Neural net robot controller with guaranteed tracking performance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
67
0
1

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 60 publications
(68 citation statements)
references
References 11 publications
0
67
0
1
Order By: Relevance
“…Remark 4: Therefore, by using the mean value theorem [22] and with the help of (12), (15), and (18), the smoothness of f (·) and g(·) and the activation function φ(·) can be readily used to show thatε(Y,Ẏ ) is also bounded above in , namely, ε ≤ ε m1 . Furthermore, the NN reconstruction error bounds ε m0 and ε m1 are considered to be unknown in this paper as opposed to the previous control literature [19], [20], [24], [25].…”
Section: Controller Developmentmentioning
confidence: 99%
See 2 more Smart Citations
“…Remark 4: Therefore, by using the mean value theorem [22] and with the help of (12), (15), and (18), the smoothness of f (·) and g(·) and the activation function φ(·) can be readily used to show thatε(Y,Ẏ ) is also bounded above in , namely, ε ≤ ε m1 . Furthermore, the NN reconstruction error bounds ε m0 and ε m1 are considered to be unknown in this paper as opposed to the previous control literature [19], [20], [24], [25].…”
Section: Controller Developmentmentioning
confidence: 99%
“…(25) Remark 6: In comparison with [19], since the projection algorithm is not used, the challenging task of selecting the predefined convex set is avoided. The boundedness of NN weights are proved simultaneously along with the asymptotic convergence of the tracking error in Section III-D.…”
Section: Controller Developmentmentioning
confidence: 99%
See 1 more Smart Citation
“…These are clearly unreasonable assumptions• In the 2-layer NN case V = I (i.e. linear in the parameters), it is easy to show that, using update rule (3.26), the weights W are not generally bounded unless the hidden layer output a(x) obeys a stringent persistency of excitation (PE) condition [15]. In the 3-layer (nonlinear) case, PE conditions are not easy to derive as one is faced with the observability properties of a certain bilinear system.…”
Section: )mentioning
confidence: 99%
“…Uncertainty on how to initialize the NN weights leads to the necessity for 'preliminary off-line tuning'. Some of these problems have been addressed for the 2-layer NN, where linearity in the parameters holds [15,23,25,28,29].…”
Section: Introductionmentioning
confidence: 99%