Abstract

SUMMARYBased on recent papers that have demonstrated that robust iterative learning control can be based on parameter optimization using either the inverse plant or gradient concepts, this paper presents a unification of these ideas for discrete‐time systems that not only retains the convergence properties and the robustness properties derived in previous papers but also permits the inclusion of filters in the input update formula and a detailed analysis of the effect of non‐minimum‐phase dynamics on algorithm performance in terms of a ‘plateauing’ or ‘flat‐lining’ effect in the error norm evolution. Although the analysis is in the time domain, the robustness conditions are expressed as frequency domain inequalities. The special case of a version of the inverse algorithm that can be used to construct a robust stable anti‐causal inverse non‐minimum‐phase plant is presented and analysed in detail. Copyright © 2012 John Wiley & Sons, Ltd.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.