Optimal Selection of the Forgetting Matrix into an Iterative Learning Control Algorithm

  • Samer S. Saab
  • Published 2005 in
    Proceedings of the 2005 IEEE International…

Abstract

A recursive optimal algorithm, based on minimizing the input error covariance matrix, is derived to generate the optimal forgetting matrix and the learning gain matrix of a P-type ILC for linear discrete-time varying systems with arbitrary relative degree. This paper shows that a forgetting matrix is neither needed for boundedness of trajectories nor for output tracking. In particular, it is shown that, in the presence of random disturbances, the optimal forgetting matrix is zero for all learning iterations. In addition, the resultant optimal learning gain guarantees boundedness of trajectories as well as uniform output tracking in presence of measurement noise for arbitrary relative degree

DOI: 10.1109/TAC.2005.860232

Cite this paper

@article{Saab2005OptimalSO, title={Optimal Selection of the Forgetting Matrix into an Iterative Learning Control Algorithm}, author={Samer S. Saab}, journal={Proceedings of the 2005 IEEE International Symposium on, Mediterrean Conference on Control and Automation Intelligent Control, 2005.}, year={2005}, pages={1231-1234} }