A numerical method for determining monotonicity and convergence rate in iterative learning control

Kira L. Barton, Douglas A. Bristow, Andrew G Alleyne

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)219-226
Number of pages8
JournalInternational Journal of Control
Volume83
Issue number2
DOIs
StatePublished - Feb 1 2010

    Fingerprint

Keywords

  • Convergence rate
  • Implicitly restarting Lanczos method
  • Iterative learning control
  • Monotonic convergence

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications

Cite this