Search

This paper addresses convergence issue of two networked iterative learning control (NILC) schemes for a class of discrete-time nonlinear systems with random packet dropout occurred in input and output channels and modelled as 0-1 Bernoulli-type random variable. In the two NILC schemes, the dropped control input of the current iteration is substituted by the synchronous input used at the previous iteration, whilst for the dropped system output, the first replacement strategy is to replace it by the synchronous pre-given desired trajectory and the second one is to substitute it by the synchronous output used at the previous iteration. By the stochastic analysis technique, we analyse the convergence properties of two NILC schemes. It is shown that under appropriate constraints on learning gain and packet dropout probabilities, the tracking errors driven by the two schemes are convergent to zero in the expectation sense along iteration direction, respectively. Finally, illustrative simulations are carried out to manifest the validity and effectiveness of the results. [ABSTRACT FROM AUTHOR]

In this paper, a novel high-order optimal terminal iterative learning control (high-order OTILC) is proposed via a data-driven approach for nonlinear discrete-time systems with unknown orders in the input and output. The objective is to track the desired values at the endpoint of the operation cycle. The terminal tracking errors over more than one previous iterations are used to enhance the high-order OTILC's performance with faster convergence. From rigor of the analysis, the monotonic convergence of the terminal tracking error is proved along the iteration direction. More importantly, the condition for a high-order OTILC to outperform the low-order ones is first established by this work. The learning gain is not fixed but iteratively updated by using the input and output (I/O) data, which enhances the flexibility of the proposed controller for modifications and expansions. The proposed method is data-driven in which no explicit models are used except for the input and output data. The applications to a highly nonlinear continuous stirred tank reactor and a highly nonlinear fed-batch fermentater demonstrate the effectiveness of the proposed high-order OTILC design. [ABSTRACT FROM AUTHOR]

This note proposes ILC for discrete-time affine nonlinear systems with randomly iteration varying lengths. No prior information on the probability distribution of random iteration length is required prior for controller design. The conventional P-type update law is used with a modified tracking error because of randomly iteration varying lengths. A novel technical lemma is proposed for the strict convergence analysis in pointwise sense. An illustrative example verifies the theoretical results. [ABSTRACT FROM AUTHOR]

This paper proposes a non-model based approach to iterative learning control (ILC) via extremum seeking. Single-input–single-output discrete-time nonlinear systems are considered, where the objective is to recursively construct an input such that the corresponding system output tracks a prescribed reference trajectory as closely as possible on finite horizon. The problem is formulated in terms of extremum seeking control, which is amenable to a range of local and global optimisation methods. Contrary to the existing ILC literature, the formulation allows the initial condition of each iteration to be incorporated as an optimisation variable to improve tracking. Sufficient conditions for convergence to the reference trajectory are provided. The main feature of this approach is that it does not rely on knowledge about the system’s model to perform iterative learning control, in contrast to most results in the literature. [ABSTRACT FROM AUTHOR]

This note proposes convergence analysis of iterative learning control (ILC) for discrete-time linear systems with randomly varying iteration lengths. No prior information is required on the probability distribution of randomly varying iteration lengths. The conventional P-type update law is adopted with Arimoto-like gain and/or causal gain. The convergence both in almost sure and mean square senses is proved by direct math calculating. Numerical simulations verifies the theoretical analysis. [ABSTRACT FROM AUTHOR]

This work is focused on the iterative learning control (ILC) design for linear discrete-time systems with iteration-varying factors, including reference, initial state, and exogenous disturbances. First, multiple high-order internal models (HOIMs) are given for various iteration-varying factors. The reference is generated by an HOIM, and the initial state and the exogenous disturbances ultimately satisfy HOIMs but do not strictly follow HOIMs in finite iteration interval. Then, a new ILC scheme, a special high-order ILC (HO-ILC), is constructed according to an augmented HOIM that is the aggregation of all HOIMs. For simplicity, the case with only iteration-varying reference is first considered, where the asymptotic stability and monotone convergence based ILC design methods are both presented by using the 2-D analysis approach. Next, more iteration-varying factors are further considered. In this situation, the HOIM-based ILC is transformed into a controller design problem of a 2-D Roesser model with non-zero boundary states and disturbances, where the 2-D H ∞ performance is studied. In consequence, an ILC design criterion is presented to achieve perfect tracking and 2-D H ∞ performance. For comparison, the monotone convergence based ILC design method is extended to the situation with more iteration-varying factors. Utilizing information provided by the multiple HOIMs, it is verified that HO-ILC outperforms low-order ILC (LO-ILC) in presence of iteration-varying factors. Meanwhile, the 2-D H ∞ based ILC is shown to be superior to the monotone convergence based ILC. Finally, a microscale robotic deposition system with iteration-varying factors is given to illustrate the advantage of the proposed 2-D H ∞ based ILC. [ABSTRACT FROM AUTHOR]

The iterative learning control is constructed for discrete-time stochastic systems with random measurement losses modelled by a stochastic sequence. A simple P-type update law is used and the almost sure convergence is strictly proved for both linear case and nonlinear case based on stochastic approximation. Illustrative examples show the effectiveness of the proposed approach. [ABSTRACT FROM PUBLISHER]

The subject of this article is the modelling of the influence of non-minimum phase discrete-time system dynamics on the performance of norm optimal iterative learning control (NOILC) algorithms with the intent of explaining the observed phenomenon and predicting its primary characteristics. It is established that performance in the presence of one or more non-minimum phase plant zeros typically has two phases. These consist of an initial fast monotonic reduction of the L2 error norm (mean square error) followed by a very slow asymptotic convergence. Although the norm of the tracking error does eventually converge to zero, the practical implications over a finite number of trials is apparent convergence to a non-zero error. The source of this slow convergence is identified using the singular value distribution of the system's all pass component. A predictive model of the onset of slow convergence behaviour is developed as a set of linear constraints and shown to be valid when the iteration time interval is sufficiently long. The results provide a good prediction of the magnitude of error norm where slow convergence begins. Formulae for this norm and associated error time series are obtained for single-input single-output systems with several non-minimum phase zeros outside the unit circle using Lagrangian techniques. Numerical simulations are given to confirm the validity of the analysis. [ABSTRACT FROM AUTHOR]

Abstract: In iterative learning control schemes for linear discrete time systems, conditions to guarantee the monotonic convergence of the tracking error norms are derived. By using the Markov parameters, it is shown in the time-domain that there exists a non-increasing function such that when the properly chosen constant learning gain is multiplied by this function, the convergence of the tracking error norms is monotonic, without resort to high-gain feedback. [Copyright &y& Elsevier]