Selective learning with a forgetting factor for robotic motion control

Abstract

A class of learning control algorithms with a forgetting factor 1> alpha >0 and without differentiation of velocity signals is proposed, which updates the input by u/sub k+1/=(1- alpha ) u/sub k/+ alpha u/sub 0/+ Phi e/sub k/, where u/sub k/ and e/sub k/ stand for command input and velocity error at kth exercise, respectively. The robustness of this learning control with respect to reinitialization errors, fluctuation of dynamics, and measurement noise is studied. It is shown that the exponential passivity of displacement robot dynamics plays a crucial role in the uniform boundedness of transient behaviors and the convergence in the progress of learning. A method called selective learning, which updates u/sub 0/ in the long-term memory by selecting the best command among the past several trials, is proposed. It is claimed that this method accelerates the speed of convergence.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>