A Numerical Method for Determining Monotonicity and Convergence Rate in Iterative Learning Control

Editor(s)

Rogers, Eric

Abstract

In iterative learning control (ILC), a lifted system representation is often used for design and analysis to determine the convergence rate of the learning algorithm. Computation of the convergence rate in the lifted setting requires construction of large N×N matrices, where N is the number of data points in an iteration. The convergence rate computation is O(N2) and is typically limited to short iteration lengths because of computational memory constraints. As an alternative approach, the implicitly restarted Arnoldi/Lanczos method (IRLM) can be used to calculate the ILC convergence rate with calculations of O(N). In this article, we show that the convergence rate calculation using IRLM can be performed using dynamic simulations rather than matrices, thereby eliminating the need for large matrix construction. In addition to faster computation, IRLM enables the calculation of the ILC convergence rate for long iteration lengths. To illustrate generality, this method is presented for multi-input multi-output, linear time-varying discrete-time systems.

Department(s)

Mechanical and Aerospace Engineering

Keywords and Phrases

Iterative Learning Control; Monotonic Convergence; Convergence Rate; Implicitly Restarting Lanczos Method

International Standard Serial Number (ISSN)

0020-7179

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2010 Taylor & Francis, All rights reserved.

Publication Date

01 Jan 2010

Link to Full Text

Share

 
COinS