Cart (Loading....) | Create Account
Close category search window

Optimal selection of the forgetting matrix into an iterative learning control algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Saab, S.S. ; Dept. of Electr. & Comput. Eng., Lebanese American Univ., Byblos, Lebanon

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 iterative learning control (ILC) for linear discrete-time varying systems with arbitrary relative degree. This note 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.

Published in:

Automatic Control, IEEE Transactions on  (Volume:50 ,  Issue: 12 )

Date of Publication:

Dec. 2005

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.