Robustification of iterative learning control and repetitive control by averaging

This paper describes a recently developed averaging technique to robustify iterative learning and repetitive controllers. The robustified controllers are found by minimising cost functions that are averaged over either multiple analytical time-domain models or experimental frequency-domain data. The aim is to produce a technique that is simple and general, and can be applied to any iterative learning control (ILC) or repetitive control (RC) design that involves the minimisation of a cost function. Substantial improvement in convergence to zero tracking error in the presence of model uncertainties has been observed for both ILC and RC by this averaging technique.     

非线性重复运动系统的双迭代优化学习控制

本文针对一类具有非参数不确定性和输出约束的非线性系统,提出一种双迭代优化学习控制策略,将复杂的迭代学习过程简化为两个相对简单的迭代控制器.首先引入一类饱和非线性函数不仅可以满足系统的位置约束,同时能够保证系统跟踪误差收敛于给定的邻域,然后针对每次迭代初始误差设计参考轨迹自修正策略,在每个迭代周期上设置一个固定的调整时间域,根据上次迭代的输出调整下一次迭代的参考轨迹.双迭代的控制结构可以同时更新两个迭代控制器的参数,来处理系统的非参数不确定性.进一步利用Barrier复合能量函数证明双迭代控制策略的收敛性和稳定性,并给出收敛条件.最后,通过一个算例证明了该控制策略的有效性.     

有限频域线性重复过程的动态迭代学习控制

针对不同相对度的离散线性重复过程,研究有限频域范围的动态迭代学习控制问题.对于零相对度和高相对度的控制对象,结合二维(2D)系统理论,分别设计有限频域的动态迭代学习控制器;然后,运用广义Kalman-Yakubovich-Popov(KYP)引理,以线性矩阵不等式(LMI)的形式给出控制器存在的充分条件以及控制器的增益...     

Synthesis of run-to-run repetitive control methods using finite impulse response models

This paper presents linear quadratic (LQ) repetitive control (RC) methods for processes represented by a conventional FIR model and a circulant FIR model. The latter, which represents a FIR system under the assumption of a cyclic steady state, is named as such as its input–output map is represented by a circulant matrix. Using the complete frequency resolving property of a circulant matrix, a special tuning method for the LQ weights is proposed. Performance of the proposed method is investigated through numerical examples.     

执行器故障重复过程的鲁棒迭代学习容错控制方法及应用

针对具有执行器故障和外界扰动的线性重复过程,给出一种鲁棒迭代学习容错控制策略.首先,基于二维(2D)系统理论,设计鲁棒迭代学习容错控制器,将迭代学习控制系统等效转化为2D模型;然后,利用线性矩阵不等式(LMI)技术,分析和优化控制系统在时间和迭代方向上的容错性能以及对干扰的抑制性能,同时给出系统满足这些性能的充分条件,并进一步通过求解LMI凸优化问题获得控制器参数;最后,通过对旋转控制系统的仿真结果验证了所提出算法的有效性.     

Approximate adjoint-based iterative learning control

This paper characterises stochastic convergence properties of adjoint-based (gradient-based) iterative learning control (ILC) applied to systems with load disturbances, when provided only with approximate gradient information and noisy measurements. Specifically, conditions are discussed under which the approximations will result in a scheme which converges to an optimal control input. Both the cases of time-invariant step sizes and cases of decreasing step sizes (as in stochastic approximation) are discussed. These theoretical results are supplemented with an application on a sequencing batch reactor for wastewater treatment plants, where approximate gradient information is available. It is found that for such case adjoint-based ILC outperforms inverse-based ILC and model-free P-type ILC, both in terms of convergence rate and measurement noise tolerance.     

Estimation-based norm-optimal iterative learning control

The norm-optimal iterative learning control (ilc) algorithm for linear systems is extended to an estimation-based norm-optimal ilc  algorithm where the controlled variables are not directly available as measurements. A separation lemma is presented, stating that if a stationary Kalman filter is used for linear time-invariant systems then the ilc  design is independent of the dynamics in the Kalman filter. Furthermore, the objective function in the optimisation problem is modified to incorporate the full probability density function of the error. Utilising the Kullback–Leibler divergence leads to an automatic and intuitive way of tuning the ilc  algorithm. Finally, the concept is extended to non-linear state space models using linearisation techniques, where it is assumed that the full state vector is estimated and used in the ilc  algorithm. Stability and convergence properties for the proposed scheme are also derived.     

A pseudoinverse-based iterative learning control

Learning control is a very effective approach for tracking control in processes occurring repetitively over a fixed interval of time. In this paper, an iterative learning control (ILC) algorithm is proposed to accommodate a general class of nonlinear, nonminimum-phase plants with disturbances and initialization errors. The algorithm requires the computation of an approximate inverse of the linearized plant rather than the exact inverse. An advantage of this approach is that the output of the plant need not be differentiated. A bound on the asymptotic trajectory error is exhibited via a concise proof and is shown to grow continuously with a bound on the disturbances. The structure of the controller is such that the low frequency components of the trajectory converge faster than the high frequency components     

Iterative learning control and repetitive control for engineering practice

This paper discusses linear iterative learning and repetitive control, presenting general purpose control laws with only a few parameters to tune. The method of tuning them is straightforward, making tuning easy for the practicing control engineer. The approach can then serve the same function for learning/repetitive control, as PID controllers do in classical control. Anytime one has a controller that is to perform the same tacking command repeatedly, one simply uses such a law to adjust the command given to an existing feedback controller and achieves a substantial decrease in tracking error. Experiments with the method show that decreases by a factor between 100 and 1000 in the RMS tracking error on a commercial robot, performing a high speed trajectory can easily be obtained in 8 to 12 trials for learning. It is shown that in engineering practice, the same design criteria apply to learning control as apply to repetitive control. Although the conditions for stability are very different for the two problems, one must impose a good transient condition, and once such a condition is formulated, it is likely to be the same for both learning and repetitive control.     

Data-driven optimal terminal iterative learning control

This paper presents a data-driven optimal terminal iterative learning control (TILC) approach for linear and nonlinear discrete-time systems. The iterative learning control law is updated from only terminal output tracking error instead of entire output trajectory tracking error. The only required knowledge of a controlled system is that the Markov matrices of linear systems or the partial derivatives of nonlinear systems with respect to control inputs are bounded. Rigorous analysis and convergence proof are developed with sufficient conditions for the terminal ILC design and the results are developed for both linear and nonlinear discrete-time systems. Simulation results illustrate the applicability and effectiveness of the proposed approach.     

Constrained data-driven optimal iterative learning control

A constrained optimal ILC for a class of nonlinear and non-affine systems, without requiring any explicit model information except for the input and output data, is proposed in this work. In order to address the nonlinearities, an iterative dynamic linearization method without omitting any information of the original plant is introduced in the iteration direction. The derived linearized data model is equivalent to the original nonlinear system and reflects the real-time dynamics of the controlled plant, rather than a static approximate model. By transferring all the constraints on the system output, control input, and the change rate of input signals into a linear matrix inequality, a novel constrained data-driven optimal ILC is developed by minimizing a predesigned objective function. The optimal learning gain is unfixed and updated iteratively according to the input and output measurements, which enhances the flexibility regarding modifications and expansions of the controlled plant. The results are further extended to the point-to-point control tasks where the exact tracking performance is required only at certain points and a constrained data-driven optimal point-to-point ILC is proposed by only utilizing the error measurements at the specified points only.     

Internal-model-based design of repetitive and iterative learning controllers for linear multivariable systems

Repetitive and iterative learning control are two modern control strategies for tracking systems in which the signals are periodic in nature. This paper discusses repetitive and iterative learning control from an internal model principle point of view. This allows the formulation of existence conditions for multivariable implementations of repetitive and learning control. It is shown that repetitive control can be realized by an implementation of a robust servomechanism controller that uses the appropriate internal model for periodic distrubances. The design of such controllers is discussed. Next it is shown that iterative learning control can be implemented in the format of a disturbance observer/compensator. It is shown that the resulting control structure is dual to the repetitive controller, and that both constitute an implementation of the internal model principle. Consequently, the analysis and design of repetitive and iterative learning control can be generalized to the powerful analysis and design procedure of the internal model framework, allowing to trade-off the convergence speed for periodic-disturbance cancellation versus other control objectives, such as stochastic disturbance suppression.     

基于遗传算法的模糊迭代学习控制算法

为了提高被控系统的控制精度及加快迭代域内的收敛速度,提出一种基于遗传算法的模糊PD型迭代学习控制算法。该算法通过模糊TSK模型设计迭代学习控制器,TSK模型中THEN部分的未知参数由遗传算法离线计算确定,进而产生合理的迭代学习律。针对被控系统,设计相应的迭代学习控制算法进行仿真分析,并与传统PD型迭代学习控制算法、模糊PID迭代学习控制算法相比较,进而将该算法用于双关节机械手进行仿真研究,仿真结果表明该算法的有效性。     

Disturbance aspects of iterative learning control

Disturbance aspects of iterative learning control (ILC) are considered. By using a linear framework it is possible to investigate the influence of the disturbances in the frequency domain. The effects of the design filters in the ILC algorithm on the disturbance properties can then be analyzed. The analysis is supported by simulations and experiments.     

Parameter optimization in iterative learning control

In this paper parameter optimization through a quadratic performance index is introduced as a method to establish a new iterative learning control law. With this new algorithm, monotonic convergence of the error to zero is guaranteed if the original system is a discrete-time LTI system and it satisfies a positivity condition. If the original system is not positive, two methods are derived to make the system positive. The effect of the choice of weighting parameters in the performance index on convergence rate is analysed. As a result adaptive weights are introduced as a method to improve the convergence properties of the algorithm. A high-order version of the algorithm is also derived and its convergence analysed. The theoretical findings in this paper are highlighted with simulations.     

All-pass filtering in iterative learning control

In iterative learning control (ILC), it is highly desirable to have a learning compensator with a unit-gain for all frequencies, in order to avoid noise amplification and learning speed degradation during the learning process. In this paper, we show that the realization of a unit-gain compensator is straightforward in ILC, using both forward and backward filtering. As an illustrative example, a unit-gain derivative is proposed to overcome the drawbacks of the conventional derivative. The proposed scheme is equivalent to an all-pass unit-gain phase shifter; the forward filtering uses a 0.5-order derivative and the backward filtering employs a 0.5-order integral. The all-pass phase shifter is deployed in a unit-gain D-type ILC. The advantages of the unit-gain feature are demonstrated by some experimental results on a robot manipulator.     

迭代学习在网络控制中的应用*

针对网络拥塞控制中网络拥塞本身无法建立精确的数学模型的问题,基于迭代学习控制具有结构简单及对系统精确模型不依赖等优点,首次提出了用迭代学习控制算法来解决网络拥塞,其主要目的是提高网络资源的利用率并提供给信源公平的资源分配份额。在提出算法前,首先通过分析网络模型建立了网络拥塞被控系统;然后提出了针对该被控系统的开闭环PID型迭代学习控制算法并证明了其收敛性;最后运用此算法建立了网络拥塞控制模型。通过实验和仿真表明,该算法对解决网络拥塞问题有很好的效果。     

分数线性相位超前迭代学习控制

线性相位超前迭代学习控制的超前拍数需要取整,不利于控制系统的性能达到最优.对此提出分数线性相位超前迭代学习控制.对系统的收敛条件进行频域分析,得到超前拍数,学习增益和可学习带宽的范围.通过调节超前拍数来提高系统的可学习带宽,以达到更高的跟踪精度.给出了分数线性相位超前的具体实现方法,并在此基础上对整数与分数相位超前的补偿效果进行比较.以机械臂为被控对象的仿真结果表明了分数线性相位超前更能提高系统的可学习带宽及跟踪精度.