IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-09063-4_4.html
   My bibliography  Save this book chapter

On Quadratic Programming Based Iterative Learning Control for Systems with Actuator Saturation Constraints

In: Modeling, Simulation and Optimization of Complex Processes - HPSC 2012

Author

Listed:
  • Fei Gao

    (Columbia University
    Tsinghua University)

  • Richard W. Longman

    (Columbia University, Department of Mechanical Engineering)

Abstract

When feedback control systems are given a commanded desired trajectory to perform, they produce a somewhat different trajectory. The concept of bandwidth is used to indicate what frequency components of the trajectory are executed reasonably well. Iterative Learning Control (ILC) iteratively changes the command, aiming to make the control system output match the desired output. The theory of linear ILC is reasonably well developed, but in hardware applications the nonlinear effects from hitting actuator saturation limits during the process of convergence of ILC could be detrimental to performance. Building on previous work by the authors and coworkers, this paper investigates the conversion of effective ILC laws into a quadratic cost optimization. And then it develops the modeling needed to impose actuator saturation constraints during the ILC learning process producing Quadratic Programming based ILC, or QP-ILC. The benefits and the need for ILC laws that acknowledge saturation constraints are investigated.

Suggested Citation

  • Fei Gao & Richard W. Longman, 2014. "On Quadratic Programming Based Iterative Learning Control for Systems with Actuator Saturation Constraints," Springer Books, in: Hans Georg Bock & Xuan Phu Hoang & Rolf Rannacher & Johannes P. Schlöder (ed.), Modeling, Simulation and Optimization of Complex Processes - HPSC 2012, edition 127, pages 37-49, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-09063-4_4
    DOI: 10.1007/978-3-319-09063-4_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-3-319-09063-4_4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.