一种新型的迭代学习控制器设计研究

针对一般连续系统的迭代学习控制问题进行了讨论,通过对常用的P型迭代学习控制算法的分析,在分析比较P型、PD型迭代学习控制律存在问题的基础上,提出了一种新型的迭代学习控制算法,利用误差信号以及相邻两次误差的差值信号对系统控制律进行逐次修正,既能避免PD型迭代算法由于微分作用而出现的不良影响,又可以充分地利用了系统已保存的有效信息,从而实现良好的跟踪效果以及较快的跟踪收敛速度,最后通过对一非线性连续系统的仿真,结果验证了算法相对于传统P算法的有效性与优越性.     

离散非线性系统的迭代学习轨迹跟踪鲁棒算法优化及应用

针对一类存在随机输入状态扰动、输出扰动及系统初值与给定期望值不严格一致的离散非线性重复系统,提出了一种P型开闭环鲁棒迭代学习轨迹跟踪控制算法．基于λ范数理论证明了算法的严格鲁棒稳定性,并通过多目标函数性能指标优化P型开闭环迭代学习控制律的增益矩阵参数,保证了优化算法下系统输出期望轨迹跟踪误差的单调收敛性,达到提高学习算法收敛速度和跟踪精度的目的．最后应用于二维运动移动机器人的实例仿真,验证了本文算法的可行性和有效性．     

时滞非线性系统的采样迭代学习控制

针对一类输入时滞非线性系统, 提出了一种采样迭代学习控制算法, 该算法不含跟踪误差的微分信号, 给出了学习算法收敛的充分条件, 当不存在初始误差、不确定扰动时, 算法在采样点处能实现对期望输出信号的完全跟踪, 否则, 跟踪误差一致有界, 仿真结果表明了该算法的有效性.     

非线性抛物型偏差分系统迭代学习控制

本文研究了一类时空离散的非线性抛物型偏差分系统的迭代学习控制问题.首先,针对系统含有不确定系数与非线性特点,设计了开环P型迭代学习控制算法;然后,建立了输出跟踪误差沿迭代轴收敛的充分条件,并利用离散Gronwall不等式、λ范数以及压缩映射原理,详细给出了收敛性分析证明.最后通过仿真实例说明了算法的有效性.     

非线性系统迭代跟踪控制的批次遗忘学习算法

针对P型迭代学习算法对初始偏差和输出误差扰动敏感,以及PD型迭代学习算法容易放大系统噪声,降低系统鲁棒性的问题,研究了具有任意有界扰动及期望输出的重复运行非线性时变系统的PD型迭代学习跟踪控制算法.利用迭代学习过程记忆的期望轨迹、期望控制以及跟踪误差,给出基于变批次遗忘因子的学习控制器设计,并借助λ范数理论和Bellman-Gronwall不等式,讨论保证闭环跟踪系统批次误差有界的学习增益存在的充分必要条件,及分析控制算法的一致收敛性.本算法改善了系统的鲁棒性和动态特性,单关节机械臂的跟踪控制仿真验证了方法的有效性.     

Lebesgue-p范数意义下区间可调节的变增益加速迭代学习控制

为加快迭代学习控制律的收敛速度,针对线性时不变(LTI)系统,以PD-型学习律为例,提出一种区间可调节的具有指数加速的迭代学习控制算法.首先,根据每次学习效果确定下一次迭代需要修正的区间并在该区间内修正控制律增益;然后,在Lebesgue-p范数意义下分析所提出算法的收敛性并给出其收敛条件;最后,通过理论分析表明,收敛速度主要取决于被控对象、控制律增益、修正指数和学习区间的大小.在相同仿真条件下,与传统算法相比,所提出算法具有更快的收敛速度.     

即时学习算法在非线性系统迭代学习控制中的应用

运用即时学习算法来解决一类非线性系统的迭代学习控制初值问题。对于任何类型的迭代学习控制算法，即时学习算法都能有效地估计初始控制量，减小了初始输出误差，加快了算法的收敛速度，使得经过有限次迭代后系统输出能严格跟踪理想信号。对机器人系统的仿真结果表明了该方法的有效性。     

具有迭代初始误差的高相对度线性离散系统的迭代学习控制

本文针对具有迭代初始误差的高相对度线性多变量离散系统,提出了一种P型的迭代学习控制算法.通过将迭代学习控制系统的二维运动过程描述为一维的线性离散系统,证明了该迭代学习控制算法的收敛性及其收敛的充要条件.该迭代学习控制算法通过对系统前次重复运动过程中的输入和跟踪误差信号进行学习,来不断地调整输入量,使得系统在经过一定次数的学习以后,在初始时间点以外的实际输出趋于期望输出.数值仿真结果表明了所提出算法的有效性.     

工业过程抗非重复性干扰改进的迭代学习控制

对于实际工业过程系统中存在的非重复性干扰,传统的PD型迭代学习控制不能很好地加以抑制.为此,提出加权PD型指数变增益加速闭环迭代学习控制算法.通过采集非重复性扰动信号,将其转化为设定值阶跃变化的序列,并采用改进的加权PD型指数变增益闭环算法,消除非重复性干扰,从而获得更为理想的系统输出,使控制系统的动态性能得到改善.算法研究表明,当迭代次数趋于无穷时,跟踪误差一致收敛到零.系统仿真验证了所提控制算法的有效性.     

一类输出饱和系统的学习控制算法研究

传感器饱和是控制系统中较为常见的一种物理约束. 本文针对一类含饱和输出的受限系统, 提出了两种学习控制算法. 具体而言, 首先, 对于重复运行的被控系统, 设计了开环P型迭代学习控制器, 实现在有限时间区间内对期望轨迹的完全跟踪, 并在λ范数意义下分析了算法的收敛性, 给出了含饱和输出的迭代学习控制系统的收敛条件. 进而, 针对期望轨迹为周期信号的被控系统, 提出了闭环P型重复学习控制算法, 并分析了这类系统的收敛性条件. 最后, 通过一个仿真实例验证了本文所提算法的有效性.     

Closed-loop P-type Iterative Learning Control of Uncertain Linear Distributed Parameter Systems

An iterative learning control problem for a class of uncertain linear parabolic distributed parameter systems is discussed, which covers many processes such as heat and mass transfer, convection diffusion and transport. Under condition of allowing system state initially to have error in the iterative process a closed-loop P-type iterative learning algorithm is presented, and the sufficient condition of tracking error convergence in L2 norm is given. Next, the convergence of the tracking error in L2 and W1,2 space is proved by using Gronwall-Bellman inequality and Sobolev inequality. In the end, a numerical example is given to illustrate the effectiveness of the proposed method.      

HIGH-ORDER ILC WITH INITIAL STATE LEARNING FOR DISCRETE-TIME DELAYED SYSTEMS

This article addresses an iterative learning control (ILC) design for a class of linear discrete-time systems with multiple time delays. In order to improve the tracking performance, we introduce a P-type high-order iterative learning algorithm that makes use of information from several previous iterations. An initial state learning scheme is proposed to eliminate the effect of the initialization error on the final tracking error. Furthermore, we establish a sufficient condition to ensure asymptotic convergence. A simulation example is also provided to illustrate the effectiveness of the proposed result.     

Integrated predictive iterative learning control based on updating reference trajectory for point-to-point tracking

A novel control technique is proposed by combining iterative learning control (ILC) and model predictive control (MPC) with updating-reference trajectory for point-to-point tracking problem of batch process. In this paper, a batch-to-batch updating-reference trajectory, which passes through the desired points, is firstly designed as the tracking trajectory within a batch. The updating control law consists of P-type ILC part and MPC part, in which P-type ILC part can improve the performance by learning from previous executions and MPC part is used to suppress the model perturbations and external disturbances. Convergence properties of the integrated predictive iterative learning control (IPILC) are analyzed theoretically, and the sufficient convergence conditions of output tracking error are also derived for a class of linear systems. Comparing with other point-to-point tracking control algorithms, the proposed algorithm can perform better in robustness. Furthermore, updating-reference relaxes the constraints for system outputs, and it may lead to faster convergence and more extensive range of application than those of fixed-reference control algorithms. Simulation results on typical systems show the effectiveness of the proposed algorithm.     

Optimal selection of the forgetting matrix into an iterative learning control algorithm

A recursive optimal algorithm, based on minimizing the input error covariance matrix, is derived to generate the optimal forgetting matrix and the learning gain matrix of a P-type iterative learning control (ILC) for linear discrete-time varying systems with arbitrary relative degree. This note shows that a forgetting matrix is neither needed for boundedness of trajectories nor for output tracking. In particular, it is shown that, in the presence of random disturbances, the optimal forgetting matrix is zero for all learning iterations. In addition, the resultant optimal learning gain guarantees boundedness of trajectories as well as uniform output tracking in presence of measurement noise for arbitrary relative degree.     

Iterative learning control for position tracking of a pneumatic actuated X–Y table

The iterative learning control (ILC) obtains the unknown information from repeated control operations. Meanwhile, the tracking error from previous stages is used as the correction factor for the next control action. Therefore, the ILC controller can make the system tracking error converge to a small region within a limited number of iterations. This study builds a proportional-valve-controlled pneumatic X–Y table system for performing position tracking control experiments. The experiments involve implementing the ILC controllers and comparing the results. The P-type updating law with delay parameters is used for both the x- and y-axes in the repetitive trajectory tracking control. Experimental results demonstrate that the ILC controller can effectively control the system and track the desired circular trajectory at different speeds. The control parameters are varied to investigate their effects on the ILC convergence.     

Stochastic P-type/D-type iterative learning control algorithms

This paper presents stochastic algorithms that compute optimal and sub-optimal learning gains for a P-type iterative learning control algorithm (ILC) for a class of discrete-time-varying linear systems. The optimal algorithm is based on minimizing the trace of the input error covariance matrix. The state disturbance, reinitialization errors and measurement errors are considered to be zero-mean white processes. It is shown that if the product of the input-output coupling matrices C ( t + 1 ) B ( t ) is full column rank, then the input error covariance matrix converges to zero in presence of uncorrelated disturbances. Another sub-optimal P-type algorithm, which does not require the knowledge of the state matrix, is also presented. It is shown that the convergence of the input error covariance matrices corresponding to the optimal and sub-optimal P-type and D-type algorithms are equivalent, and all converge to zero at a rate inversely proportional to the number of learning iterations. A transient-response performance comparison, in the domain of learning iterations, for the optimal and sub-optimal P- and D-type algorithms is investigated. A numerical example is added to illustrate the results.