Abstract
This paper contributes to the convergence analysis of iterative learning control for linear systems under general data dropouts at both measurement and actuator sides. By using a simple compensation mechanism for the dropped data, the sample path behavior along the iteration axis is analyzed and formulated as a Markov chain first. Based on the Markov chain, the recursion of the input error is reformulated as a switching system, and then a novel convergence proof is established in the almost sure sense under mild design conditions. Illustrative examples are provided to verify the theoretical results.
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 callDisclaimer: 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.
