Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (4)
  • Open Access

    ARTICLE

    Improved High Order Model-Free Adaptive Iterative Learning Control with Disturbance Compensation and Enhanced Convergence

    Zhiguo Wang*, Fangqing Gao, Fei Liu

    CMES-Computer Modeling in Engineering & Sciences, Vol.134, No.1, pp. 343-355, 2023, DOI:10.32604/cmes.2022.020569 - 24 August 2022

    Abstract In this paper, an improved high-order model-free adaptive iterative control (IHOMFAILC) method for a class of nonlinear discrete-time systems is proposed based on the compact format dynamic linearization method. This method adds the differential of tracking error in the criteria function to compensate for the effect of the random disturbance. Meanwhile, a high-order estimation algorithm is used to estimate the value of pseudo partial derivative (PPD), that is, the current value of PPD is updated by that of previous iterations. Thus the rapid convergence of the maximum tracking error is not limited by the initial More >

  • Open Access

    ARTICLE

    Accelerated Iterative Learning Control for Linear Discrete Systems with Parametric Perturbation and Measurement Noise

    Xiaoxin Yang1, Saleem Riaz2,*

    CMES-Computer Modeling in Engineering & Sciences, Vol.132, No.2, pp. 605-626, 2022, DOI:10.32604/cmes.2022.020412 - 15 June 2022

    Abstract An iterative learning control algorithm based on error backward association and control parameter correction has been proposed for a class of linear discrete time-invariant systems with repeated operation characteristics, parameter disturbance, and measurement noise taking PD type example. Firstly, the concrete form of the accelerated learning law is presented, based on the detailed description of how the control factor is obtained in the algorithm. Secondly, with the help of the vector method, the convergence of the algorithm for the strict mathematical proof, combined with the theory of spectral radius, sucient conditions for the convergence of More >

  • Open Access

    ARTICLE

    Iterative Semi-Supervised Learning Using Softmax Probability

    Heewon Chung, Jinseok Lee*

    CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 5607-5628, 2022, DOI:10.32604/cmc.2022.028154 - 21 April 2022

    Abstract For the classification problem in practice, one of the challenging issues is to obtain enough labeled data for training. Moreover, even if such labeled data has been sufficiently accumulated, most datasets often exhibit long-tailed distribution with heavy class imbalance, which results in a biased model towards a majority class. To alleviate such class imbalance, semi-supervised learning methods using additional unlabeled data have been considered. However, as a matter of course, the accuracy is much lower than that from supervised learning. In this study, under the assumption that additional unlabeled data is available, we propose the More >

  • Open Access

    ARTICLE

    Robustness Convergence for Iterative Learning Tracking Control Applied to Repetitfs Systems

    Ben Attia Selma*, Ouerfelli Houssem Eddine, Salhi Salah

    Intelligent Automation & Soft Computing, Vol.32, No.2, pp. 795-810, 2022, DOI:10.32604/iasc.2022.020435 - 17 November 2021

    Abstract This study addressed sufficient conditions for the robust monotonic convergence of repetitive discrete-time linear parameter varying systems, with the parameter variation rate bound. The learning law under consideration is an anticipatory iterative learning control. Of particular interest in this study is that the iterations can eliminate the influence of disturbances. Based on a simple quadratic performance function, a sufficient condition for the proposed learning algorithm is presented in terms of linear matrix inequality (LMI) by imposing a polytopic structure on the Lyapunov matrix. The set of LMIs to be determined considers the bounds on the More >

Displaying 1-10 on page 1 of 4. Per Page