Random Iteration-Varying Lengths for Linear Systems

  • Dong Shen


This chapter proposes convergence analysis of ILC for discrete-time linear systems with randomly iteration-varying lengths. No prior information is required on the probability distribution of randomly iteration-varying lengths. The conventional P-type update law is adopted with Arimoto-like gains and causal gains. The convergence both in almost sure and mean square senses is proved by direct math calculations.


  1. 1.
    Li, X., Xu, J.-X., Huang, D.: An iterative learning control approach for linear systems with randomly varying trial lengths. IEEE Trans. Autom. Control 59(7), 1954–1960 (2014)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Schmid, R.: Comments on “Robust optimal design and convergence properties analysis of iterative learning control approaches” and “On the P-type and Newton-type ILC schemes for dynamic systems with non-affine input factors”. Automatica 43(9), 1666–1669 (2007)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Shen, D., Zhang, W., Wang, Y., Chien, C.-J.: On almost sure and mean square convergence of P-type ilc under randomly varying iteration lengths. Automatica 63(1), 359–365 (2016)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.College of Information Science and TechnologyBeijing University of Chemical TechnologyBeijingChina

Personalised recommendations