2002
DOI: 10.1080/10798587.2002.10644208
|View full text |Cite
|
Sign up to set email alerts
|

Learnability and Adaptability from the Viewpoint of Passivity Analysis

Abstract: This paper attempts to give a mathematical and physical interpretation of practicebased learning (so-called 'learning control') from the passivity viewpoint for a class of linear dynamical systems with passivity and general nonlinear differential equations of robotic motion. It is shown from an axiomatic argument that the passivity of a pair of input and output plays a crucial role in the ability of learning. More precisely in case of robot dynamics it is shown that the passivity between a residual input torqu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2003
2003
2017
2017

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 30 publications
0
5
0
Order By: Relevance
“…Note that this approach does not change the result, because the triangular area included by points y 3 , y 6 , and y 10 does not add any value to vertex point values (i.e., y 10 and y 11 ) whereas if the maximum value still occurs at a vertex point after the triangular area is added, it is certain that the maximum value always occurs at a vertex point. Now, let us check the following: (4.8) which is rewritten as y = γ 1 1 x + γ 1 2 + y 1 + |γ 31 x + γ 32 |. Here, ignore y 1 , because y 1 is a constant value at all x (i.e., for all x ∈ [x, x]).…”
Section: Monotonic Convergencementioning
confidence: 99%
“…Note that this approach does not change the result, because the triangular area included by points y 3 , y 6 , and y 10 does not add any value to vertex point values (i.e., y 10 and y 11 ) whereas if the maximum value still occurs at a vertex point after the triangular area is added, it is certain that the maximum value always occurs at a vertex point. Now, let us check the following: (4.8) which is rewritten as y = γ 1 1 x + γ 1 2 + y 1 + |γ 31 x + γ 32 |. Here, ignore y 1 , because y 1 is a constant value at all x (i.e., for all x ∈ [x, x]).…”
Section: Monotonic Convergencementioning
confidence: 99%
“…In this section we illustrate these properties with simple applications to modular design. An interesting recent discussion of the application of passivity tools to recursive refinement of the control of movement can be found in Reference [41].…”
Section: Combinations Of Contracting Systemsmentioning
confidence: 99%
“…In [25], an iterative learning control that is formed on the basis of the passivity for 2-DOF robotic mechanisms with antagonistic bi-articular muscles is developed. The iterative learning control scheme is designed by resorting to the Arimoto-type iterative learning control presented in [26]. The closed-loop system's convergence is analyzed on the basis of passivity.…”
Section: Iterative Learning Control and Its Variantsmentioning
confidence: 99%