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

Robust high-order iterative learning control approach for two-dimensional linear discrete time-varying Fornasini–Marchesini systems with iteration-dependent reference trajectory

Author

Listed:
  • Kai Wan

Abstract

This paper first investigates robust tracking problem of a high-order iterative learning control (HOILC) algorithm for two classes of two-dimensional linear discrete time-varying Fornasini–Marchesini systems (2-D LDTVFMS) and 2-D LDTVFMS with input delays with iteration-dependent reference trajectory described by a high-order internal model (HOIM) operator, boundary states and disturbances. An extended high-order linear discrete inequality is proposed to guarantee the ILC tracking error of 2-D LDTVFMS converge robustly to a bounded range, the bound of which is relied on iteration-dependent uncertainties from reference trajectory, boundary states and disturbances. A simulation example on a practical thermal process is used to validate the effectiveness and feasibility of the proposed HOILC law. Additionally, it is verified by theory analysis and simulation that no matter how the ILC controller gain is selected, the convergence condition in Theorem 2 of Wan and Li [(2021). High-order internal model based iterative learning control for 2-D linear FMMI systems with iteration-varying trajectory tracking. IEEE Transactions on Systems Man and Cybernetics: Systems, 51, 1462–1472] is not satisfied. Using the proposed HOILC law, perfect tracking result in Theorem 2 of Wan and Li (2021) can be obtained.

Suggested Citation

  • Kai Wan, 2022. "Robust high-order iterative learning control approach for two-dimensional linear discrete time-varying Fornasini–Marchesini systems with iteration-dependent reference trajectory," International Journal of Systems Science, Taylor & Francis Journals, vol. 53(5), pages 1068-1089, April.
  • Handle: RePEc:taf:tsysxx:v:53:y:2022:i:5:p:1068-1089
    DOI: 10.1080/00207721.2021.1988188
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2021.1988188?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:5:p:1068-1089. 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.