IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v53y2022i12p2664-2678.html
   My bibliography  Save this article

An LMI approach to robust iterative learning control with initial state learning

Author

Listed:
  • Mojtaba Ayatinia
  • Mehdi Forouzanfar
  • Amin Ramezani

Abstract

This paper presents a new robust convergence condition of iterative learning control with initial state learning (ILC-ISL) for linear multivariable discrete-time systems in the presence of iteration-varying uncertainty. This method is based on linear matrix inequality (LMI) and provides fixed learning gains during time and iteration. Since the convergence of the ILC algorithm may change due to uncertainty in the parameters of a system, and the ILC algorithm is incapable of dealing with iteration-related challenges, it is a major challenge to reject the effect of iteration varying uncertainty. Besides, in the basic ILC algorithm, the initial state is constant in each iteration and consequently always leads to a tracking error. In this paper, first, a convergence condition of the ILC-ISL algorithm is designed based on closed-loop system stability in the iteration domain, and second, a new robust convergence condition is achieved by the LMI approach. Finally, the effectiveness of the proposed robust convergence scheme is evaluated through a numerical example and a mechanical system, respectively.

Suggested Citation

  • Mojtaba Ayatinia & Mehdi Forouzanfar & Amin Ramezani, 2022. "An LMI approach to robust iterative learning control with initial state learning," International Journal of Systems Science, Taylor & Francis Journals, vol. 53(12), pages 2664-2678, September.
  • Handle: RePEc:taf:tsysxx:v:53:y:2022:i:12:p:2664-2678
    DOI: 10.1080/00207721.2022.2058107
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2022.2058107
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2022.2058107?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:53:y:2022:i:12:p:2664-2678. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.