Multivariable norm optimal iterative learning control with auxiliary optimisation

The paper describes a substantial extension of norm optimal iterative learning control (NOILC) that permits tracking of a class of finite dimensional reference signals whilst simultaneously converging to the solution of a constrained quadratic optimisation problem. The theory is presented in a general functional analytical framework using operators between chosen real Hilbert spaces. This is applied to solve problems in continuous time where tracking is only required at selected intermediate points of the time interval but, simultaneously, the solution is required to minimise a specified quadratic objective function of the input signals and chosen auxiliary (state) variables. Applications to the discrete time case, including the case of multi-rate sampling, are also summarised. The algorithms are motivated by practical need and provide a methodology for reducing undesirable effects such as payload spillage, vibration tendencies and actuator wear whilst maintaining the desired tracking accuracy necessary for task completion. Solutions in terms of NOILC methodologies involving both feedforward and feedback components offer the possibilities of greater robustness than purely feedforward actions. Results describing the inherent robustness of the feedforward implementation are presented and the work is illustrated by experimental results from a robotic manipulator.     

Multivariable norm optimal and parameter optimal iterative learning control: a unified formulation

This article investigates the two paradigms of norm optimal iterative learning control (NOILC) and parameter optimal iterative learning control (POILC) for multivariable (MIMO) ?-input, m-output linear discrete-time systems. The main result is a proof that, despite their algebraic and conceptual differences, they can be unified using linear quadratic multi-parameter optimisation techniques. In particular, whilst POILC has been naturally regarded as an approximation to NOILC, it is shown that the NOILC control law can be generated from a suitable choice of control law parameterisation and objective function in a multi-parameter MIMO POILC problem. The form of this equivalence is used to propose a new general approach to the construction of POILC problems for MIMO systems that approximates the solution of a given NOILC problem. An infinite number of such approximations exist. This great diversity is illustrated by the derivation of new convergent algorithms based on time interval and gradient partition that extend previously published work.     

非线性离散时间系统的最优终端迭代学习控制

仅利用系统的终端输出误差而不是整个输出轨迹,提出了一种最优终端迭代学习控制方法.控制信号可直接通过终点的误差信息进行更新.主要创新点在于控制器的设计和分析只利用系统量测的I/O数据而不需要关于系统模型的任何信息,并可实现沿迭代轴的单调收敛.在此意义上,所提出的控制器是数据驱动的无模型控制方法.严格的数学分析和仿真结果均表明了所提出方法的适用性和有效性.     

Modelling of non-minimum phase effects in discrete-time norm optimal iterative learning control

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 L ₂ 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.     

An open-closed-loop iterative learning control approach for nonlinear switched systems with application to freeway traffic control

For nonlinear switched discrete-time systems with input constraints, this paper presents an open-closed-loop iterative learning control (ILC) approach, which includes a feedforward ILC part and a feedback control part. Under a given switching rule, the mathematical induction is used to prove the convergence of ILC tracking error in each subsystem. It is demonstrated that the convergence of ILC tracking error is dependent on the feedforward control gain, but the feedback control can speed up the convergence process of ILC by a suitable selection of feedback control gain. A switched freeway traffic system is used to illustrate the effectiveness of the proposed ILC law.     

An iterative approach to the optimal co-design of linear control systems

This paper investigates the optimal co-design of both physical plants and control policies for a class of continuous-time linear control systems. The optimal co-design of a specific linear control system is commonly formulated as a nonlinear non-convex optimisation problem (NNOP), and solved by using iterative techniques, where the plant parameters and the control policy are updated iteratively and alternately. This paper proposes a novel iterative approach to solve the NNOP, where the plant parameters are updated by solving a standard semi-definite programming problem, with non-convexity no longer involved. The proposed system design is generally less conservative in terms of the system performance compared to the conventional system-equivalence-based design, albeit the range of applicability is slightly reduced. A practical optimisation algorithm is proposed to compute a sub-optimal solution ensuring the system stability, and the convergence of the algorithm is established. The effectiveness of the proposed algorithm is illustrated by its application to the optimal co-design of a physical load positioning system.     

An optimal method for nonlinear iterative learning control systems with constraint and model uncertainty

Clonal selection algorithm is improved and proposed as a method to implement nonlinear optimal iterative learning control algorithm. In the method, more priori information was coded in a clonal selection algorithm to decrease the size of the search space and to deal with constraint on input. Another clonal selection algorithm is used as a model modifying device to cope with uncertainty in the plant model. Finally, simulations show that the convergence speed is satisfactory regardless of the nature of the plant and whether or not the plant model is precise.     

A computationally efficient norm optimal iterative learning control approach for LTV systems

This paper proposes a computationally efficient iterative learning control (ILC) approach termed non-lifted norm optimal ILC (N-NOILC). The objective is to remove the computational complexity issues of previous 2-norm optimal ILC approaches, which are based on lifted system techniques, while retaining the iteration domain convergence properties. The computational complexity needed to implement the proposed method scales linearly with the trial length. Therefore, the approach can be implemented on controlled processes having long trial durations and high sampling rates. Robustness is accomplished by adding a penalty term on the control input in the cost function. Simulations are presented to verify and validate the features of the proposed method.     

An iterative learning control design approach for networked control systems with data dropouts

In network‐based iterative learning control (ILC) systems, data dropout often occurs during data packet transfers from the remote plant to the ILC controller. This paper considers the problem of controller design for such ILC processes. Packet missing is modeled by stochastic variables satisfying the Bernoulli random binary distribution, which renders such an ILC system to be a stochastic one. Then, the design of ILC law is transformed into the stabilization of a 2‐D stochastic system described by the Roesser model. A sufficient condition for mean‐square asymptotic stability is established by means of a linear matrix inequality technique, and formulas can be given for the control law design simultaneously. This result is further extended to more general cases where the system matrices also contain uncertain parameters. The effectiveness and merits of the proposed method are illustrated by a numerical example. Copyright © 2015 John Wiley & Sons, Ltd.     

An optimal stochastic multivariable PID controller: a direct output tracking approach

This paper deals with the design of an optimal stochastic controller possessing tracking capability of any reference output trajectory in the presence of measurement noise. We consider multi-input multi-output linear time-invariant systems and a proportional-integral-derivative (PID) controller. The system under consideration needs not be stable. A recursive algorithm providing optimal time-varying PID gains is proposed for the case where the number of inputs is larger than or equal to the number of outputs. The development of the proposed algorithm aims for per-time-sample minimisation of the mean-square output error in the presence of erroneous initial conditions, measurement noise, and process noise. Necessary and sufficient conditions are provided for the convergence of the output error covariance. In addition, convergence results are presented for discretised continuous-time plants. Simulation results are included to illustrate the performance capabilities of the proposed algorithm. Performance comparison with an optimal stochastic iterative learning control scheme, an optimal PID controller, an adaptive PID controller, and a recent optimal stochastic PID controller are also included.     

Basis functions and parameter optimisation in high-order iterative learning control

In this paper a new parameter-optimal high-order Iterative Learning Control (ILC) algorithms is proposed to extend the work of Owens and Feng [Parameter optimisation in iterative learning control. International Journal of Control 14(11), 1059-1069]. If the original plant is positive, this new algorithm will result in convergent learning where the convergence is monotonic to zero tracking error. If the original plant is not positive, it can be shown that by adding a suitable set of basis functions into the algorithm, the tracking error will again converge monotonically to zero. This provides a considerable improvement to earlier work on parameter-optimal ILC as it opens up the possibility of globally convergent algorithms for any linear plant G. The number of parameters needed to ensure convergence could, however, become large. The paper shows that the use of low-order parameterisations is capable of achieving much of the benefit achieved in the ‘ideal’ case.     

Accelerated norm-optimal iterative learning control algorithms using successive projection

This article proposes a novel technique for accelerating the convergence of the previously published norm-optimal iterative learning control (NOILC) methodology. The basis of the results is a formal proof of an observation made by D.H. Owens, namely that the NOILC algorithm is equivalent to a successive projection algorithm between linear varieties in a suitable product Hilbert space. This leads to two proposed accelerated algorithms together with well-defined convergence properties. The results show that the proposed accelerated algorithms are capable of ensuring monotonic error norm reductions and can outperform NOILC by more rapid reductions in error norm from iteration to iteration. In particular, examples indicate that the approach can improve the performance of NOILC for the problematic case of non-minimum phase systems. Realisation of the algorithms is discussed and numerical simulations are provided for comparative purposes and to demonstrate the numerical performance and effectiveness of the proposed methods.     

Further results on iterative learning control with convergence conditions for linear time-variant discrete systems

This article is concerned with some further results on iterative learning control (ILC) algorithms with convergence conditions for linear time-variant discrete systems. By converting two-Dimensional (2-D) ILC process of the linear time-variant discrete systems into 1-D linear time-invariant discrete systems, this article presents convergent ILC algorithms with necessary and sufficient conditions for two classes of linear time-variant discrete systems. Main results in (Li, X.-D., Ho, J.K.L., and Chow, T.W.S. (2005), ‘Iterative Learning Control for Linear Time-variant Discrete Systems Based on 2-D System Theory’, IEE Proceedings, Control Theory and Applications, 152, 13–18 and Huang, S.N., Tan, K.K., and Lee, T.H. (2002), ‘Necessary and Sufficient Condition for Convergence of Iterative Learning Algorithm’, Automatica 38, 1257–1260) are extended and generalised.     

Formation control for multi‐agent systems through an iterative learning design approach

This paper deals with formation control problems for multi‐agent systems by using iterative learning control (ILC) design approaches. Distributed formation ILC algorithms are presented to enable all agents in directed graphs to achieve the desired relative formations perfectly over a finite‐time interval. It is shown that not only asymptotic stability but also monotonic convergence of multi‐agent formation ILC can be accomplished, and the convergence conditions in terms of linear matrix inequalities can be simultaneously established. The derived results are also applicable to multi‐agent systems that are subject to stochastic disturbances and model uncertainties. Furthermore, the feasibility of convergence conditions and the effect of communication delays are discussed for the proposed multi‐agent formation ILC algorithms. Simulation results are given for uncertain multi‐agent systems to verify the theoretical study. Copyright © 2012 John Wiley & Sons, Ltd.     

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.     

Parameter-optimal iterative learning control using polynomial representations of the inverse plant

Based on the observation that iterative learning control (ILC) can be based on the inverse plant but that the approach can be degraded by modelling errors, particularly at high frequencies, this article investigates the construction and properties of a multi-parameter parameter-optimal ILC algorithm that uses an approximate polynomial representation of the inverse with natural high-frequency attenuation. In its simplest form, the algorithm replicates the original work of Owens and Feng but, more generally, it is capable of producing significant improvements to the observed convergence rate. As the number of parameters increases, convergence rates approach that of the ideal plant inverse algorithm. Introducing compensation into the algorithm provides a formal link to previously published gradient and norm-optimal ILC algorithms and indicates that the polynomial approach can be regarded as approximations to those control laws. Simulation examples verify the theoretical performance predictions.     

Latent variable iterative learning model predictive control for multivariable control of batch processes

A latent variable iterative learning model predictive control (LV-ILMPC) method is presented for trajectory tracking in batch processes. Different from the iterative learning model predictive control (ILMPC) model built from the original variable space, LV-ILMPC develops a latent variable model based on dynamic partial least squares (DyPLS) to capture the dominant features of each batch. In each latent variable space, we use a state–space model to describe the dynamic characteristics of the internal model, and an LV-ILMPC controller is designed. Each LV-ILMPC controller tracks the set points of the current batch projection in the corresponding latent variable space, and the optimal control law is determined and the persistent process disturbances is rejected along both time and batch horizons. The proposed LV-ILMPC formulation is based on general LV-MPC and incorporates an iterative learning function into LV-MPC. In addition, the real physical input that drives the process can be reconstructed from the latent variable space. Therefore, this algorithm is particularly suitable for multiple-input, multiple-output (MIMO) systems with strong coupling and serious collinearity. Three studies are used to illustrate the effectiveness of the proposed LV-ILMPC .     

Consensus control of leader-following nonlinear multi-agent systems with distributed adaptive iterative learning control

This paper addresses the consensus problem of leader-following nonlinear multi-agent systems with iterative learning control. The assumption that only a small portion of following agents can receive the information of leader agent is considered. To approximate the nonlinear dynamics of a given system, the radial basis function neural network is introduced. Then, a distributed adaptive iterative learning control protocol with an auxiliary control term is designed, where the estimates of nonlinear dynamics are applied in control protocol design and three adaptive laws are presented. Furthermore, the convergence of the proposed control protocol is analysed by Lyapunov stability theory. Finally, a simulation example is provided to demonstrate the validity of theoretical results.     

不确定性机器人系统自适应鲁棒迭代学习控制

利用Lyapunov方法, 提出了一种不确定性机器人系统的自适应鲁棒迭代学习控制策略, 整个系统在迭代域里是全局渐近稳定的. 所考虑的机器人系统同时包含了结构和非结构不确定性. 在设计时, 系统的不确定性被分解成可重复性和非重复性两部分, 并考虑了系统的标称模型. 在所提出的控制策略中, 自适应策略用来估算做法确定性的界, 界的修正与迭代学习控制量一样的迭代域得以实现的. 计算机仿真表明本文提出的控制策略是有效的.