Discrete Dynamics in Nature and Society

Volume 2015 (2015), Article ID 410292, 11 pages

http://dx.doi.org/10.1155/2015/410292

## A PD-Type Iterative Learning Control for a Class of Switched Discrete-Time Systems with Model Uncertainties and External Noises

Department of Applied Mathematics, School of Mathematics and Statistics, Xi’an Jiaotong University, 28 Xianning West Road, Xi’an, Shaanxi 710049, China

Received 25 March 2015; Revised 27 May 2015; Accepted 9 June 2015

Academic Editor: Manuel De la Sen

Copyright © 2015 Xuan Yang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

A PD-type iterative learning control algorithm is applied to a class of linear discrete-time switched systems for tracking desired trajectories. The application is based on assumption that the switched systems repetitively operate over a finite time interval and the switching rules are arbitrarily prespecified. By taking advantage of the super-vector approach, a sufficient condition of the monotone convergence of the algorithm is deduced when both the model uncertainties and the external noises are absent. Then the robust monotone convergence is analyzed when the model uncertainties are present and the robustness against the bounded external noises is discussed. The analysis manifests that the proposed PD-type iterative learning control algorithm is feasible and effective when it is imposed on the linear switched systems specified by the arbitrarily preset switching rules. The attached simulations support the feasibility and the effectiveness.

#### 1. Introduction

A switched system consists of finite subsystems described by differential equations or difference equations and a switching rule which specifies a subsystem being activated during a certain time subinterval [1, 2]. In the real world, the switched systems arise in many fields such as chemical processes, power systems, switched circuits, and traffic systems [3, 4]. Thus investigation on the switched systems is necessary. It has drawn considerable attention since 1990s [5, 6]. In recent years, main efforts have been made on analyzing the dynamical behaviors of the switched systems such as stability [1, 4, 7–9], controllability, reachability [10, 11], and observability [12]. It is emphasized that the switching rules play a significant role in the process of analyzing these dynamical behaviors [2, 13]. For example, an improper switching may destabilize a switched system even if all subsystems are stable [2]. Conversely, an appropriate switching may stabilize a switched system even if its subsystems are unstable [2].

Control of the switched systems for some desirable performance is also a branch in the community of the switched systems research. There are many works on this issue. For instance, an approach for solving an optimal control problem of the switched systems has been presented in [14], where the prespecified sequences of the controlled systems are given. And, a kind of sliding mode control for the switched stochastic systems has been proposed in [15], where a sufficient condition is deduced to guarantee the mean-square exponential stability. Also, a finite time quantized control problem for the switched systems has been designed by solving an optimization problem in [16], where an average dwell time method and a mode-dependent quantized state feedback controller are employed.

Compared with the above stated issues, study on designing controllers for the switched systems to track given trajectories is relatively challenging [3, 4]. Main reason may be that the arbitrary switching rules will result in indeterminate dynamical behaviors of the controlled switched systems, which does not meet requirement of trajectory tracking problem. Moreover, in engineering practice, the dynamics of the plant model is often unknown and various uncertain disturbances are unavoidable. Fortunately, for the repetitive systems, there exists a kind of efficient control strategy named iterative learning control (ILC). ILC has witnessed flourishing development in both theoretical analysis and practical application since its invention in [17]. ILC makes use of the tracking error information from previous or current trials to compensate for the current control input so as to generate an upgraded one for the next trial. Since it requires less knowledge of the system dynamics and spends less computational effort than other types of control methods [18], ILC is especially suitable for a kind of trajectory tracking control of the repetitive systems whose a priori knowledge is unknown and initial state can be periodically reset. In view of its nature properties, the ILC strategies can be applied to the switched systems meeting above requirement to track given trajectories.

However, according to ILC’s mechanism, the activated subsystems running over a certain time subinterval in different iterations are required to be identical. This means that the dynamics of the controlled system is iteration-invariant. Thus, when the ILC strategies are used on the switched systems, a key assumption should be made that the switching rule which specifies activated subsystems at different time subintervals is also iteration-invariant. That is to say, once a switching rule is arbitrarily specified at the beginning iteration, it remains invariant during the subsequent learning process. Actually, provided that the switching rule is time-varying rather than iteration-varying, the above assumption can be easily satisfied. Using the above assumption, recent references [3, 13, 18, 19] have applied the ILC strategies to the switched systems.

In [3], a P-type ILC scheme has been applied to a class of linear discrete-time switched systems, where the convergence property is analyzed by the super-vector approach. In [13, 19], the D-type ILC algorithms have been used on a class of discrete-time linear switched systems and a kind of discrete-time nonlinear switched systems, respectively. In addition, a high-order PID-type ILC scheme for a class of nonlinear switched systems with state delay has been analyzed from the perspective of stability in [18]. It is recalled that the learning performance analysis of the above ILC algorithms for the switched systems is mainly made in the sense of -norm which is helpful for deducing preferable theoretical results. However, it has been established that, in [20], analyzing the learning performance of an ILC algorithm in the sense of -norm is defective from the perspective of application. For example, the impact of the system dynamics and the learning gains will be extremely suppressed by a sufficiently large parameter to ensure convergence. It may result in a situation that an improper choice of the parameter would spoil a fair assessment of the tracking behaviors in practice [20]. In addition, [3, 13, 18, 19] do not involve robustness analysis when the controlled switched systems are disturbed by model uncertainties or external noises. However, both uncertainties and noises are inevitable in engineering practice. So, robustness is one of important considerations in the process of controller design. Analysis of an ILC algorithm regardless of robustness is inadequate from the perspective of practical application. In view of this, the study on the ILC algorithms for the switched systems needs to be refined or to be expanded.

Motivated by the above statement, we consider a PD-type ILC scheme for a class of linear discrete-time switched systems with arbitrarily prespecified switching rules. By using the super-vector approach, a sufficient condition of the monotone convergence is firstly deduced when both the model uncertainties and the external noises are absent. Using this deduced condition, the robust monotone convergence is analyzed when the model uncertainties are present and the robustness against the bounded external noises is discussed.

The rest of the paper is organized as follows. Section 2 presents the fundamental problem with respect to the switched systems and the ILC process. Section 3 exhibits the main analysis of the proposed PD-type ILC algorithm including the monotone convergence, the robust monotone convergence, and the robustness. In order to show the feasibility and the effectiveness of the algorithm, the numerical simulations are given in Section 4 and the conclusion is drawn in Section 5.

#### 2. Fundamental Problem Description

Consider a class of uncertain linear discrete-time-invariant single-input, single-output switched systems described as follows:Here, , stands for the operation time duration of each trial, denotes sampling time instant, while , represents iteration number. is state vector, is control input signal, and is system output. The symbol represents the switching rule which is defined as with , . The switching rule is piecewise constant function with respect to discrete-time and specifies which subsystem is activated at the time subinterval . The constant matrices , , with appropriate dimensions are dynamics of the nominal system of (1). Obviously, specified by the definition of the switching rule, the matrices triplets , , are elements of the following finite set:The matrices , , and , , are uncertain system matrices and uncertain input matrices. They can be, respectively, denoted asHere, the matrices pairs and which characterize the structures of the system uncertainties and the input uncertainties are known real constant matrices with appropriate dimensions. The matrices and are unknown but satisfy that and are negative definite, where denotes an identity matrix with appropriate dimension. For description convenience, and are uniformly denoted as model uncertainties. The symbols and are load noise and measurement noise, respectively.

Given a desired trajectory , , the objective of an ILC strategy for system (1) is to generate an input sequence in a recursive mode by learning from the previous experience such that it can drive the output of system (1) to track the desired trajectory , , as precisely as possible as iteration number tends to infinity. Mathematically, the inequalityis true for a sufficiently small positive number , where is termed as the tracking error and “” stands for the supremum limit of a sequence.

In this paper, a PD-type ILC scheme is considered aswhere and denote the differential gains and the proportional gains, respectively.

The subsequent analysis of this paper is based on the following assumptions.

*Assumption 1. *Every operation starts at the same initial state; that is, , . Without loss of generality, it is assumed that .

*Assumption 2. *The desired trajectory , , is iteration-invariant.

*Assumption 3. *For an arbitrary trajectory , , there exist a desired control input signal , , and a desired state vector , , such that

Note that Assumption 3 is basic for the subsequent theoretical analysis. First of all, it is a solvable condition of the switched system (1). If this assumption is not satisfied the following discussions will be worthless. In addition, it is concluded that, from Assumption 3, there uniquely exists a desired control input to drive the output of system (1) to asymptotically follow a given desired trajectory, theoretically.

*Assumption 4. *The switching rule remains iteration-invariant once it is arbitrarily specified at the first trial.

The learning performance of the ILC law (5) will be analyzed by employing the super-vector method. It is necessary to rewrite the original systems (1) as follows.

Given , the outputs of system (1) from the time instant to at the th trial can be, respectively, derived aswhere , , and , , for expression simplicity. By denoting the super vectors assystem (7) can be equivalently represented as the following input-output response linear system:Here,is the initial output super vector andis a lifted matrix constructed by the nominal model of system (1) [21]. is a lower triangle matrix which consists of the nominal model and the model uncertainties of systems (1). That is to say, is also an uncertain matrix.

When taking Assumption 1 into account, the initial output super vector becomes . Then system (9) becomesThus, the control objective of ILC in the form of super vector can be equivalently described as searching such an input vector sequence , , that it can drive system (12) to track the desired trajectory as precisely as possible as the iteration number tends to infinity. That is, the inequalityis satisfied for a small positive number , where “” denotes the infinite norm of a vector and represents the tracking error super vector which is defined aswith a super-vector denotation of the desired trajectory .

In the framework of super vector, the updating law (5) is reformulated aswhereis the learning gain matrix which consists of the learning gains of the updating law (5). Here, is omitted, for is not defined according to the specified operation time duration . Now, the original two-dimensional ILC problem is converted into a one-dimensional linear input-output response problem [22].

#### 3. Main Results

In order to access the learning performance of the PD-type ILC scheme (15) for the case when the controlled system (12) is disturbed by the model uncertainties and the external noises, the following sufficient condition of the monotone convergence of algorithm (15) is firstly deduced when both the model uncertainties and the external noises are null.

##### 3.1. Convergence Analysis

If both the model uncertainties and the external noises are absent, the controlled system (12) becomes the nominal system denoted asWhen the updating law (15) is applied to system (17), Theorem 5 can be proven.

Theorem 5. *Suppose that ILC algorithm (15) is imposed on system (17) specified by a deterministic switching sequence , . The tracking error converges monotonically to zero in the sense of infinite norm, if there is a proper learning gain matrix such that the inequality**holds, where “” denotes the infinite norm of matrix .*

*Proof. *By the definition of the tracking error super vector, it is easy to derive thatTaking infinite norm of both sides of (19) and using norm inequality yieldBy the assumption , it is immediately deduced that , which means that the sequence monotonically decreases. Further, the inequality relation can be easily derived by recursion, which means that .

This completes the proof.

For statement convenience, it is denoted that . Obviously, the magnitude of is a quantification to assess the convergence speed. Thus, it is regarded as so-called “*learning factor*” which is specified in [20]. From the perspective of numerical analysis, the convergence speed can be improved by choosing a proper learning gain matrix to reduce the magnitude of the learning factor .

##### 3.2. Analysis of Robust Monotone Convergence

When the model uncertainties are present while the external noises are absent, system (12) becomesHere, the robust monotone convergence is defined as follows.

*Definition 6 (see [23]). *An ILC algorithm is robustly monotonically convergent with respect to a vector norm and a set of model uncertainties if, for every choice of the model uncertainty within this set and for every choice of initial control signal, the tracking error norm converges strictly monotonically to zero.

Theorem 7. *Assume that the updating law (15) is used on system (21) orchestrated by a deterministic switching sequence , , and there exists a proper learning gain matrix such that condition (18) is guaranteed. Algorithm (15) is robustly monotonically convergent in the sense of infinite norm if the uncertain matrix satisfies*

*Proof. *By the definition of the tracking error super vector, it is deduced thatTaking infinite norm of both sides of (23) and using norm inequality getDenoting and taking assumption (22) into account yieldThus it is immediately derived that , which implies that sequence monotonically decreases. By recursion, it is further deduced that inequality is true. This means that .

This completes the proof.

*3.3. Robustness Analysis*

*When the external noises are present while the model uncertainties are absent, system (12) can be reformulated asTherefore, the evolution of the tracking error vector at adjacent trials can be deduced as*

*Robustness referred to in this paper is as follows.*

*For a given desired trajectory and an appropriated beginning input , the output , , of system (26) driven by algorithm (15) asymptotically falls into a small neighborhood of the desired trajectory as the iteration number goes to infinity if the external noises and are bounded within admissible ranges. Mathematically, inequality holds for a positive number .*

*Theorem 8. Suppose that (27) is generated by applying the updating law (15) to the switched system (26) specified by a deterministic switching sequence , , and there exists a proper learning gain matrix such that assumption (18) is true. Inequalityholds if the external noises satisfy and for any , where is a positive number while and are constants.*

*Proof. *Denoting , , taking infinite norm of both sides of (27), and using norm inequality yieldThe assumptions and give that the relations , are satisfied. This means that the relations and hold.

Thus, it is further deduced that, by recursion inference,When denoting , inequality (30) is rewritten asAssumption leads to the fact that inequalityholds. That is to say, the sequence monotonically increases and has upper bound. Thus the limit exists. Taking supremum limit of both sides of (31) getsBy denoting , inequality (28) is immediately deduced.

This completes the proof.

*It is evident that, by inequality (33), the output of system (26) disturbed by the bounded external noises falls into a neighborhood of the desired trajectory when PD-type ILC algorithm (15) is used. That is, algorithm (15) is robust against the bounded external noises. Also, it is seen that the robustness of algorithm (15) can be improved by choosing a proper learning gain matrix to reduce the magnitude of if the boundaries of the external noises are constant.*

*Remark 9. *The robust analysis in Theorem 8 is based on a situation that the system uncertainties are absent. Obviously, there exists another situation where the controlled system is perturbed by both the model uncertainties and the external noises. Actually, in this case, analogous results can be deduced when the model uncertainties are time-varying and satisfy assumption (22), as the value of in Theorem 8 can be replaced by that of .

*Remark 10. *Compared with the existing ILC algorithms for the switched systems in [3, 13, 18, 19], this paper analyzes the robust monotone convergence when the model uncertainties are present and the robustness against the bounded external noises by employing super-vector method. The results are deduced under the condition that the system dynamics is periodically resettable and the switching rules are arbitrarily prespecified and iteration-invariant. Although the paper focuses on a class of time-invariant switched systems, the analysis implies that the proposed ILC algorithm may work well for linear time-varying switched systems specified by the deterministic time-dependent switching rules.

*Remark 11. *It is seen that, from the mechanism of ILC, the ILC strategy is an error-driven control strategy. The tracking error information of historical iterations is solely significant for updating the control input. This implies that the activated subsystems running over a certain time subinterval of different iterations are identical. Thus, the switching rules are required to be prespecified and iteration-invariant. Actually, the PD-type ILC algorithm in the paper is proposed on basis that the switching rules are arbitrarily prespecified and preknown. If the switching rules are nonpreset and unknown, it cannot be guaranteed that the subsystems running over the certain time subinterval of different trials are the same. Thus it is difficult to analyze the learning performance of the proposed ILC algorithm. However, if the switching rules are preset and unknown, the proposed PD-type ILC algorithm will work well. In this case, the learning performance of the algorithm can be analyzed from the perspective of stability. In the future work, this issue will be further addressed.

*Remark 12. *It is necessary to point out that the study on the ILC algorithms for the switched systems is more challenging than the study for the nonswitched systems. Firstly, as seen that a switched system consists of different subsystems specified by the switching rules, the learning process requires much more memory to store the learning gains, the potential dynamics of subsystems, and the switching rules. It would be a dimensional disaster if the system dimension is higher and the sampling number is much larger. However, the memory requirement will be solved sooner or later with advancing of the information technology. Secondly, the switching rule involved in this paper is time-dependent and prespecified. However, there exist other types of switching rules in practice, such as state-dependent switching rules, event-dependent switching rules, and autonomous switching rules [2]. How to analyze the learning performance of the ILC algorithms for the switched systems specified by these switching rules is also difficult. Now it is still a pendent question but, simultaneously, is also an interesting consideration from an application point of view.

*4. Numerical Simulations*

*To manifest the feasibility and the effectiveness of the proposed updating law (5) or (15), a simple example is considered. The controlled switched system is formulated as (1), where the operation discrete-time duration is set as (i.e., ). Assume that the switching sequence is specified as Figure 1 which shows that the controlled system consists of three subsystems.*