Design of Robust Trackers and Unknown Nonlinear Perturbation Estimators for a Class of Nonlinear Systems: HTRDNA Algorithm for Tracker Optimization

: A robust linear quadratic analog tracker (LQAT) consisting of proportional-integral-derivative (PID) controller, sliding mode control (SMC), and perturbation estimator is proposed for a class of nonlinear systems with unknown nonlinear perturbation and direct feed-through term. Since the derivative type (D-type) controller is very sensitive to the state varying, a new D-type controller design algorithm is developed to avoid an unreasonable large value of the controller gain. Moreover, the boundary of D-type controller is discussed. To cope with the unknown perturbation e ﬀ ect, SMC is utilized. Based on the fast response of SMC controlled systems, the proposed perturbation estimator can estimate unknown nonlinear perturbation and improve the tracking performance. Furthermore, in order to tune the PID controller gains in the designed tracker, the nonlinear perturbation is eliminated by the SMC-based perturbation estimator ﬁrst, then a hybrid Taguchi real coded DNA (HTRDNA) algorithm is newly proposed for the PID controller optimization. Compared with traditional DNA, a new HTRDNA is developed to improve the convergence performance and e ﬀ ectiveness. Numerical simulations are given to demonstrate the performance of the proposed method.


Introduction
As well known, the PID controller is one of the popular control strategies and widely adopted to control engineering due to its simple structure and robust feature [1][2][3]. Hence, the PID controller has been widely implemented in many industrial applications. For tuning the PID controller gains, the traditional method Ziegler-Nichols rule is developed, but it is difficult to adjust the optimal or near optimal PID controller gains when the controlled system is with nonlinearity and high order dimension [3,4]. Paper [5] proposes the closed-loop controlled system by using a state-derivative feedback controller, and it illustrates the difficulty of calculating the controller based on the state-feedback control approach; hence, this paper transforms the single input single output (SISO) system into Frobenius canonical form and the pole-placement method is employed to cope with the state-derivative feedback control problem. Research work [6] processes the state-derivative feedback swarm optimization (PSO) [3,4,30], DNA algorithm [31,32], and genetic algorithm (GA) [33][34][35][36][37][38] are stochastic searching methods for solving optimal problems. For example, some works in [33][34][35][36][37][38] based on the GA method integrated their research to the proposed controller and parameters optimization; in papers [31,32], the DNA algorithm is proposed for the PID controller optimization, and the difference between GA and DNA algorithms is the mutation operator which is not only with the same mutation operator but also consists of enzyme and virus, whereby the different PID structure can exchange their information. On the other hand, the Taguchi method is a low cost and high effective method for quality engineering [39,40]. Compared with full factorial experiments, the Taguchi method is a simple experimental design method that is less experiment. It emphasizes and focuses on the improvement of product quality not through testing but through design. Some papers apply the Taguchi method to improve the performance of GA [33,34]. Paper [33] mentions that the hybrid Taguchi-genetic algorithm (HTGA) has a quick convergent. Among the above methods, the DNA algorithm is a multiple functional method which is not only adjusted to the parameters but also changed the PID structure to find the optimal or near-optimal solution. Thus, this paper utilizes the advantage of Taguchi method to enhance the efficiency for our proposed algorithm.
Based on the above description, this paper aims to design a robust LQAT consisting of PID controller, SMC, and perturbation estimator for a class of nonlinear systems with unknown nonlinear perturbation, and the proposed HTRDNA algorithm is designed for the PID controller optimization. To avoid unreasonable gain value in the controller, a simple algorithm for D-type controller design is studied. Due to the SMC fast response, the perturbation estimator is proposed based on SMC. Since the undesirable nonlinear perturbation is eliminated by the SMC-based perturbation estimator first, it becomes easy to optimize the PID controller with the new design procedure of HTRDNA algorithm proposed in this paper.
This paper is organized as follows. Section 2 presents the whole derivation for the robust tracker design. Section 3 proposes the design procedure of HTRDNA algorithm. The illustrative examples demonstrate the feasibility and validity of the proposed approaches in Section 4 and a conclusion is given in Section 5.
Notations: w T is used to denote the transpose for the matrix w, w † denotes the matrix generalized inverse for the matrix w and w denotes the Euclidean norm of the matrix w or vector w. | w | represents the absolute value of w. I n is the n × n identity matrix. sign(s) is the sign function of s, if s > 0, sign(s) = 1; if s < 0, sign(s) = −1; if s = 0, sign(s) = 0.

Robust Tracker and Perturbation Estimator Design
For a class of nonlinear systems with a direct feed-through term, the robust tracker and perturbation estimator are proposed. In real engineering systems, there are many controlled systems with nonlinear vector and disturbances such as the chaotic systems and robotic systems. To cope with these undesired perturbations, the SMC-based perturbation estimator is proposed. Now, consider a class of nonlinear time-invariant system described by .
where A ∈ n×n , B ∈ n×m , C ∈ p×n , and D ∈ p×m denote the system matrices. The pair (A, B) is controllable. In order to deal with the LQAT problem, the condition m ≥ p has to satisfy. x(t) ∈ n is the state vector, u(t) ∈ m is the control input, g(x, t) ∈ m is the system nonlinear vector, and y(t) ∈ p is the measurable output of the system. d(x, t) ∈ m is the unknown nonlinear perturbation at time t.
Notices that the proposed approach still works for the special case where y(t) = Cx(t) (such as chaotic systems). Moreover, u(t) = u * (t) + K D .
x(t) where the gain K D is D-type controller gain. In [5,8], the closed-loop controlled system of D-type controller is discussed. Therefore, the linear transformation can be founded. To merge the derivative term .
x(t) in (1), theoretically it can be written to After being transformed, (1) can be rewritten to the following state space equation . where To avoid the D-type controller K D with unreasonable values, the gain should be discussed and selected properly. In order to keep the original system feature, let the matrix M be M = I n − BK D ≥ αI n > 0 where parameter α is positive definite so that the transformed system can remain its stability. Therefore, a simple D-type controller algorithm is proposed. Since the rank of BK D is m so that I n − BK D only m poles can be placed, some methods can be utilized to deal with this problem such as pole-placement and LMI approach. To implement minimal parameters, one solution of K D can be obtained by then, the matrix M is equivalent to which implies To find out the range of α, we take 2 norm for both sides of (8) and the parameter α has the range 0 < α ≤ 1. Moreover, for the requirement of the transformed matrix M being invertible. In (7)-(9), we assume that the rank of B is m, and BB † is positive definite so that K D should be a reasonable matrix with 0 < α ≤ 1. From Equation (9), the system matrix B and B † can be described in the singular value decomposition (SVD) form as where U r ∈ n×r is a unitary matrix, r ∈ r×r is the matrix with r singular values, and V r ∈ r×m is a unitary matrix. One has BB † = U r r V T r V r −1 r U T r = U r I r U T r = 1. For the above calculation, the inverse of matrix M exists, thus, we can ensure that the transformed matrix is invertible for the linear transformation in our proposed method.

Remark 1.
If the D-type controller (6) satisfies the above design algorithm, then invertible matrix M can be computed. Since the D-type controller is sensitive to the system states varying, the gain should be selected properly. If the gain K D is with the high gain property, then the K p and K I gains (to be appear later) will be unreasonable large. Therefore, a simple D-type controller algorithm is important.
To construct an augmented matrix with PI-type controller. Let to be the new state variable in the modified state space equation, where denotes the tracking error and r(t) is the reference trajectory. In light of the new state variable, the system in (4) and (5) can be arranged to the new state-space equation described as . where . We give a sliding surface as where the equivalent control u * eq (t) in the sliding manifold . s(t) = 0 is obtained by We lack of the information of perturbation d g (x, t); hence, the underdetermined estimation of d g (x, t) named byd g (t) will be design first, then the PI-type controller gain K and control law u(t) will be discussed in detail later, respectively. Lemma 1. In the works [15,21], the authors indicate that the perturbation is assumed to be slowly time-varying; therefore, the derivative of perturbation equal is (near) to zero. Generally, it is reasonable to suppose that when the perturbation is slowly time-varying and changes slightly relative to the observer dynamics with high gain property.
Give the perturbation estimator aŝ where k o is the positive parameter for the perturbation estimator. In the control law (15), the nonlinear perturbation d g (x, t) is unknown so that the control law cannot be achieved. Therefore, the perturbation estimator (17) can be utilized to replace the unknown nonlinear perturbation d g (x, t). Now, the SMC controller u ± (t) and SMC-based control law can be designed by where γ and σ denote arbitrary nonnegative value so that the trajectories of SMC converge to the sliding manifold and the unknown nonlinear perturbation is estimated consequently.
Theorem 1. The estimation in (17) leads to the error between the external perturbation and the estimated perturbation converge to zero closely, which implies Proof. See Appendix A.

Remark 2.
To avoid the undesired chattering phenomenon in the SMC, the sign function can be replaced by a smooth and continuous saturation function [41].
where δ i is an arbitrary small positive constant. If δ i equals to zero, the saturation function sat(s(t)) is equivalent to the sign function sign(s(t)). While the controlled system with direct feed-though term, the undesired chattering phenomenon affects the controlled system output directly. Hence, the saturation function should be smooth enough; in other words, the parameter δ i should be selected properly. Therefore, the undesired chattering phenomenon can be avoided, especially if the controlled system has direct feed-though term.
According to Theorem 1, the sliding manifold is reached and substituting (19) and (20) into (11) and (12), one has . where where the matrix I n is an identity matrix.
In order to track the reference trajectory, the linear quadratic method is applied to the tracker design. The PI controller gain K can be described as where R c = R + D pid1 T QD pid1 , N = C pid T QD pid1 , K P ∈ m×n , and K I ∈ m×p . To design the controller gain K consisting of K P and K I , we temporarily do not take the perturbation estimatord g (x, t) and the control law u(t) into consideration in (22) and (23). Both thed g (x, t) and u(t) will be discussed based on the final-value theorem in detail.
Let the quadratic performance index for the output tracking problem be defined as where t f denotes the final time, as well as Q = 10 q I p ∈ p×p with q ≥ 0 and R = I m ∈ m×m are the appropriate weighting matrices. Consider the performance index in (25), to calculate the lower value for the controlled system output y(t); hence, we obtain r(t) = 0 (r(τ) = 0) first, then utilize the final-value theorem to minimize the performance index [11]. Thus, consider Lemma 2 and (25), the algebraic Riccati equation is given by Solving the matrix P from the algebraic Riccati equation then the control gain K can be constructed. Notice that the PI gains in K are determined based on the linear model A pid , B pid1 , C pid , D pid1 first, then take the perturbation estimatord g (t) into consideration to determine the control law u(t) in (22) and (23), based on the final-value theorem which will be discussed in detail later.
Finally, it is desirable to determine the u(t) term in (19). Since Lemma 2 is utilized, then the traditional LQAT cannot be adopted to design the control law u(t). Therefore, the final-value theorem can be utilized to find out the control law u(t). Since, the PI controller gain K has been chosen, the sliding mode is reached andd(t) is convergence then the control law u(t) can be calculated by the final-value theorem.
Theorem 2. The u(t) term is determined based on the integration-term-free augmented system in (22) and (23), Finally, based on Theorem 2, the desire control law can be described as x .
Remark 3. If the α equals to 1, the PID-type controller reduces to the PI-type controller. The control law in (27) is utilized to minimize the tracking performance in (25). Therefore, the controlled system output y(t) can track the reference trajectory r(t) and the tracking error can be minimized.

DNA Algorithm
The following statements demonstrate the detailed information of DNA algorithm [31,32]

operators.
A. Definition of cost function: This step defines a cost function to calculate the cost value of each individual, retain excellent chromosomes, and eliminate adverse chromosomes.
B. Reproduction: Similar to cell division, reproduction is focused on survival of the fittest. Hence, the worse chromosomes will decrease in every generation. Roulette wheel selection is one common technique to implement the proportional selection. Another way to reproduce the better population is the tournament selection. Compared with the roulette wheel selection, the tournament selection only requires the better cost values of the chromosome.
C. Crossover: After reproduction, the chromosomes mate with each other to execute the crossover operator. Crossover exchanges information between two individuals and generates two offspring. The crossover probability p c can be decided to our demand where p c > 0. D. Mutation: In natural biological system, creatures mutate by themselves in order to adapt to the external environment. Each chromosome undergoes mutation with a fixed probability p m where p m > 0. Generally, p m is set to be much lower than p c in order to prevent from being unable to converge.
E. Enzyme/Virus: Enzyme and virus operators are similar to mutation operator, but the most different part is to change structure of the chromosome instead of value of the chromosome. Enzyme operator loses part of segments in chromosome; on the other hand, the virus operator increases an additional part of chromosome. Each chromosome undergoes enzyme and virus with positive probabilities p e and p v , respectively.
F. Termination criteria: This step provides two methods to establish a termination criterion. One is the pre-specified iteration number. Another one is reaching the tolerable error representing the algorithm that converges to the optimal solution or approaching optimal solution.

Taguchi Method
Taguchi method is a powerful and functional tool in optimization for quality [33,34,39,40]. Taguchi method uses less combination of experiments to obtain the useful information and searches the tendency of optimization to prevent from the cause of sensitive variation. The primary tools of the Taguchi method are the orthogonal array and the signal-to-noise ratio (SNR).
A. Orthogonal array: An orthogonal array can use fewer experiments than full factorial experiments. The normal expression of two-level orthogonal arrays is where N t = 2 kt denotes number of experimental runs, kt denotes a positive integer which is greater than one, 2 denotes number of levels for each factor, and N t − 1 denotes number of columns in the orthogonal array. B. SNR: Two criteria are used to determine SNR, i.e., smaller is better or larger is better. In the case of the smaller is better characteristic, let two sets of data be described by [z 1 , z 2 , . . . , z n s ] and [z 1 , z 2 , . . . , z n s ]. The mean squared deviations from the target value of the quality characteristic are described by and In order to shift the mean squared deviation to a suitable situation, utilize the transformation and describe the ratio in decibels and After calculating, the SNRs will be compared to decide the better level. Therefore, we can determine the better levels for each factor in less experiment. In the case of larger is better characteristic can refer to the literature [34].

Hybrid Taguchi and Real Coded DNA Algorithm
In this section, we are going to take advantage of DNA algorithm and Taguchi method in real coded scheme and combine with the controller design mentioned previously to select a suitable tracking controller. The detailed steps are described in Figure 1 and illustrated in the following statements.
Step 1: Coding strategy: Define a set of chromosomes including the PID gain matrices K P , K I , K D in the block vector form as follows C = K P K I K D .
The previously mentioned controllers can be composed of P controller, PI controller, PD controller, and PID controller. Therefore, definitions of various controller variables are C i P = K i P 0 0 , where i denotes the i th chromosome in the whole group.
Step 2: Initialization: Before we search a solution to approximate the optimal solution, we need to generate T chromosomes for the population, which is called primitive group. To determine the different gain values in every chromosome, we select the parameters α in [0.3, 1] and q in [0, q] (for example q = 2) randomly to create four optimal chromosomes for each type controller, and select a gain matrix β I ∈ m×m randomly to multiply the optimal chromosomes for other chromosomes until the population is reached. Each component of β I is given a range by [0, 1]. Generally, the size of the primitive group depends on the problem complexity; in other words, the more complicated the problem, the larger the primitive group we need. In the experiment, we generate T /4 chromosomes for each type of controller.
Step 3: Reproduction: Tournament selection can be adopted to find the lower cost value for the next population.
Step 4: Crossover: The offspring chromosome has the partial characteristic from the parents after crossover. Refer to [31,34,35], a real coded crossover operator is defined and rewritten as follows where C parent1 and C parent2 represent different chromosomes. The parameter β c is randomly selected and defined in a range [0, 1]. The crossover operator is allowed to mate with identical type controllers in the mating pool. For instance, a PI-type controller parameter C i PI only mates with the same feature chromosome.
Step 5: Choosing a proper orthogonal array: Determine the number of factors and levels to construct a suitable orthogonal array L 4 (2 3 ) for the problem demand. In the simulation, we choose three factors to make an experiment and the factors are the PID parameters. A two-level orthogonal array is studied.
Step 6: Selecting chromosomes and Taguchi experiments: This step can do ρ runs to generate ρ better chromosomes into every generation. Select a best chromosome and randomly choose another chromosome from the population. Both chromosomes are obtained to execute Taguchi method and find the better solution. In each generation, both chromosomes can be the same type of controllers or different type controllers. For example, both chromosomes C 1 (P 1 , I 1 , D 1 ) and C 2 (P 2 , I 2 , D 2 ) are the levels to be selected and each PID parameter is the factor in the orthogonal array. In this paper, the orthogonal array selects L 4 (2 3 ). The P 1 , I 1 and D 1 are represented level 1 and the P 2 , I 2 and D 2 are represented level 2. Calculate the SNR of each experiment in the orthogonal array, then calculate the effect of the various factors. The tracking performance is obtained and the small one is best.
The formulation of SNR can be rewritten as ρ κj = 1 2 2 i s =1 J c jis where κ represents the number of factor, j represents the number of level (J c to be defined later), and the smaller one can be obtained. After the orthogonal array experiment, the smaller SNRs are obtained to find the best factors and the best chromosome can be found by each level. For example, level 1 is obtained in the factor P such that P 1 is selected; level 2 is obtained in the factor I, such that I 2 can be selected; level 1 is obtained in the factor D such that D 1 is selected. Based on the above description, the best chromosome is C BT (P 1 , I 2 , D 1 ).
Step 7: Mutation: Real coded changes its value by extending or shortening the scalar. Refer to [31,34,35], we can re-implement the mutation operator as the following where β m is randomly selected in a range [−1 , 1]. By doing this way, it changes both the scalar and the direction to achieve mutation operator.
Step 8: Enzyme/Virus: Select two chromosomes from the population. Enzyme and virus operators can provide us with a suitable controller type. Two different type chromosomes from the pool of {P, PI, PD, PID} are randomly selected. For instance, the former operator can transform PID controller to P controller, PI controller or PD controller; the latter operator transforms P controller to PI controller, PD controller, or PID controller.
Step 9: Calculating cost value: In order to evolve the population, the cost function is employed to evaluate the value of each chromosome and the minimum one is the best chromosome. We define the cost function as where e y (τ) = e y 1 (τ), e y 2 (τ), · · · , e y p (τ) T denotes the error between the output and the pre-specified trajectory, u(τ) = u 1 (τ), u 2 (τ), · · · , u m (τ) T denotes the control force, and J c denotes the cost value.
Step 10: Stopping criterion: If the stopping criterion is reached, then the algorithm is terminated. Otherwise, return to Step 3 and continue to Step 10.

Illustrative Examples
In this section, two numerical simulations are given to illustrate the proposed fixed (optimal-based robust tracker) and flexible (HTRDNA-based robust tracker) trackers, respectively.

Fixed PID-Type Controller
To verify effectiveness of the proposed PID-based robust tracker, the following example is considered. Consider the nonlinear, Chen's chaotic system described as or in the general form . Let the output be represented by the general form We set the matrix pair {Q, R} = 10 3 I 2 , I 2 for the controller design, k o = 350, h = 5 and α = 0.8 to yield where K P ∈ 2×3 and K I ∈ 2×2 . The sliding surface and fixed PID-type controller are given in (13) and (27), respectively. Figures 2-4 demonstrate the tracking performance between the controlled system output y(t) and the pre-specify trajectory r(t). The sliding surface is shown in Figure 5. The estimation error between perturbation estimator and perturbation is shown in Figure 6. Figures 2-6 demonstrate a satisfied performance based on the proposed robust tracker for the system with unknown perturbation.

Flexible PID-Type Controller Based on the HTRDNA
To improve the tracking performance of the proposed PID-based robust tracker, the proposed HTRDNA is adopted. Consider the same Chen's chaotic system given in Section 5.1. For searching the best cost value during the iterative process, we define the cost function as where e y (τ) = e y 1 (τ), e y 2 (τ), · · · , e y p (τ) T denotes the error between the output and the pre-specified trajectory, u(τ) = u 1 (τ), u 2 (τ), · · · , u m (τ) T denotes the control force, J c denotes the cost value.
Here, we hope to apply the HTRDNA algorithm to seek for the best one from four kinds of PID-type controllers. The parameters are chosen as follows: The maximum iteration number is 100, probability of crossover p c = 0.5, probability of mutation p m = 0.01, probability of enzyme p e = 0.01, probability of virus p v = 0.01, the orthogonal array select L 4 (2 3 ), the weighting w 1 = 1 and w 2 = 10 −3 . The resultant controller selected based on the HTRDNA algorithm is the PID-type controller and its parameters are The sliding surface and fixed PID-type controller are given in (13) and (27), respectively. Figures 7-11 demonstrate a quite satisfied tracking performance based on the proposed method. According to Figures 3 and 8, the proposed HTRDNA algorithm can improve the error performance by considering the performance index in (40). Figures 4 and 9 show the control input without undesired chartering phenomenon by using the proposed control law (27). Compare Figure 4 with Figure 9, Figure 9 shows that the control input is constrained by the performance index in (40). Figures 6 and 11 show that the error of perturbation estimation is converged. The simulation results demonstrate the validity of the proposed perturbation estimator method. Furthermore, based on the cost function (40), Figure 12 shows that the proposed flexible PID-type controller outperforms the fixed PID-type controller. In addition, Figure 12 shows that the proposed HTRDNA algorithm outperforms the real code DNA (RDNA) algorithm. Consider the performance index (40) to Section 5.1, the cost value is 0.2129. After HTRDNA algorithm optimization, the cost value is 0.1793. Compare Section 5.1 with Section 5.2, the proposed HTRDNA algorithm can optimize the controller and improve the tracking performance. Based on the above description, the newly proposed HTRDNA algorithm can improve the performance for the proposed controller.  (40), Figure 12 shows that the proposed flexible PID-type controller outperforms the fixed PID-type controller. In addition, Figure 12 shows that the proposed HTRDNA algorithm outperforms the real code DNA (RDNA) algorithm. Consider the performance index (40) to Section 5.1, the cost value is 0.2129. After HTRDNA algorithm optimization, the cost value is 0.1793. Compare Section 5.1 with Section 5.2, the proposed HTRDNA algorithm can optimize the controller and improve the tracking performance. Based on the above description, the newly proposed HTRDNA algorithm can improve the performance for the proposed controller.

Conclusions
A robust tracker design for a class of nonlinear controlled systems with/without direct feedthrough term and unknown nonlinear perturbation is proposed in this paper. Based on LQAT, by taking linear transformation and augmented state, a simple approach for the PID-type controller with SMC and perturbation estimator is proposed. The designed perturbation estimator is employed to eliminate the unknown nonlinear perturbation so that the better performance can be achieved. To improve the efficiency of real coded DNA algorithm, this paper utilizes the advantage of the Taguchi method to real coded DNA algorithm so that the HTRDNA algorithm is newly proposed for the PID controller optimization. Due to the SMC with fast response, SMC is employed to cope with the nonlinear perturbation and then HTRDNA algorithm can be utilized to tune the PID controller type and its parameters. Simulation results demonstrate the validity of our proposed method.

Conclusions
A robust tracker design for a class of nonlinear controlled systems with/without direct feed-through term and unknown nonlinear perturbation is proposed in this paper. Based on LQAT, by taking linear transformation and augmented state, a simple approach for the PID-type controller with SMC and perturbation estimator is proposed. The designed perturbation estimator is employed to eliminate the unknown nonlinear perturbation so that the better performance can be achieved. To improve the efficiency of real coded DNA algorithm, this paper utilizes the advantage of the Taguchi method to real coded DNA algorithm so that the HTRDNA algorithm is newly proposed for the PID controller optimization. Due to the SMC with fast response, SMC is employed to cope with the nonlinear perturbation and then HTRDNA algorithm can be utilized to tune the PID controller type and its parameters. Simulation results demonstrate the validity of our proposed method.

Conflicts of Interest:
The authors declare no conflict of interest.
Substituting (16) and (A2) into the differentiation of (20) yields .d If the gain k o is selected to be a positive value, the error of (20) can converge and approximate to zero. In other words, the estimated perturbation can approximate to the unknown perturbation at the steady state.

(A5)
Equations (A3)-(A5) show that the sliding mode states can reach the defined sliding manifold in finite time with the given parameters γ > 0 and σ > 0; therefore, (17) can estimate the unknown external perturbation and eliminate its impact directly. In addition, whend g (t) equals or closes to zero, the controller in (19) can achieve a desired tracking performance.

Appendix B
Proof of Theorem A2. Consider a linear time-invariant system with the PI-type controller and underdetermined u(t) term described by .
Take the Laplace transform of the tracking error to obtain the following equations where U s and R s are the steady-state values of u(t) and r(t), respectively, during any time period, if u(t) and r(t) change slightly relative to the high gain property controlled system dynamics. Using the final-value theorem to (A8), one has lim s→0 sE y (s) = lim , we can infer that it is sufficient to derive the controller u(t) in (22) and (23) by applying the final-value theorem without the integral term. According to Theorem 1 and Theorem 2, SMC is reached and the perturbation is estimated by the perturbation estimator. Then, take Laplace transforms of (22) and (23) whereD g s is the steady-state values ofd g (t), during any time period, ifd g (t) changes slightly relative to the high gain property controlled system dynamics. Applying the final-value theorem to the tracking error and forcing it to be zero yields lim s→0 sE y (s) = lim s→0 s(Y(s) − R s ) = C pidc (−A pidc ) −1 B pid + D pid1 U s − DD g s − R s = 0, so that in general, one has u(t) = C pidc (−A pidc ) −1 B + D pid1 † r(t) + Dd g (t) , where A pidc = A pid − B pid K P ,