Abstract

This paper proposes two novel improved iterative learning control (ILC) schemes for systems with randomly varying trial lengths. Different from the existing works on ILC with variable trial lengths that advocate to replace the missing control information by zero, the proposed learning algorithms are equipped with a searching mechanism to collect useful but avoid redundant past tracking information, which could expedite the learning speed. The searching mechanism is realized by the newly defined stochastic variables and an iteratively-moving-average operator. The convergence of the proposed learning schemes is strictly proved based on the contraction mapping methodology. Two illustrative examples are provided to show the superiorities of the proposed approaches.

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.