2017 American Control Conference (ACC) 2017
DOI: 10.23919/acc.2017.7963781
|View full text |Cite
|
Sign up to set email alerts
|

Neural network based repetitive learning control of robot manipulators

Abstract: Control of robot manipulators performing periodic tasks is considered in this work. The control problem is complicated by presence of uncertainties in the robot manipulator's dynamic model. To address this restriction, a model free repetitive learning controller design is aimed. To reduce the heavy control effort, a neural network based compensation term is fused with the repetitive learning controller. The convergence of the tracking error to the origin is ensured via Lyapunov based techniques. Numerical simu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 19 publications
0
8
0
Order By: Relevance
“…Such joint position reference signals, which are "periodic" with a time-varying increasing period T ranging in the compact set [2.5, 3.5] seconds, are used to experimentally test the online period identification capabilities of the recursive algorithm (4), (5) in the learning context of (2), (6).…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Such joint position reference signals, which are "periodic" with a time-varying increasing period T ranging in the compact set [2.5, 3.5] seconds, are used to experimentally test the online period identification capabilities of the recursive algorithm (4), (5) in the learning context of (2), (6).…”
Section: Resultsmentioning
confidence: 99%
“…Theorem 1. Consider the robot dynamics (1) and the learning control (2), (6) in conjunction with the period identifier (4)- (5). For sufficiently smallT(0) and̃(0): (1) the uncertain period T is exponentially estimated; (2) the error vector [q(t) Tq (t) T ] T is exponentially attracted into a ball (with center as the origin) whose radius can be made arbitrarily small by increasing the smallest among the learning gains k Li , i = 1, … , n; (3) the error vector [q(t) Tq (t) T ] T asymptotically tends to zero.…”
Section: Main Contributionmentioning
confidence: 99%
See 2 more Smart Citations
“…Nevertheless, it is time-consuming and computationally complex. Furthermore, limited data information may lead to bad control performance [16][17][18].…”
Section: Introductionmentioning
confidence: 99%