Adaptive Multi-Dimensional Taylor Network Tracking Control for a Class of Nonlinear Strict Feedback Systems

Abstract

Nonlinear systems are very common in real life, but because they are not superposed and homogeneous, there are many difficulties in controlling nonlinear systems. Therefore, an adaptive control method based on a multi-dimensional Taylor network (MTN) is proposed for a class of nonlinear systems with strict feedback so that the output of the system can track the given signal. In order to achieve the control effect, we define a new state variable and transform the strict feedback system. After transformation, the original feedback system has a standard form, and two parameters to be identified are obtained. Then, the state observer is designed, and the two parameters are identified via the approximation of the MTN. On this basis, the controller design and a system stability analysis are completed. The lemma is introduced, and the stability condition is established by using this low-pass filter to ensure that all closed-loop signals are semi-globally uniform and finally bounded and the output tracking error converges to the residual set near zero. Finally, a numerical simulation of a hydraulic system is carried out to verify the effectiveness of the proposed method. Under the three indexes, the proposed method has obvious advantages.

1. Introduction

Non-linear systems are almost ubiquitous in daily life and exist widely in various applications, such as motor [1], power [2], and electrical systems [3]. After more than half a century of development, the control of non-linear systems has made considerable progress, and various control methods and strategies have emerged, e.g., backstepping control strategies [4], neural networks [5], fuzzy-based control [6], and system identification [7].

For example, scenario-based model predictive control (MPC) approaches can mitigate the conservatism inherent in robust open-loop MPC. Reference [8] presents a method for evaluating the confidence intervals of RBNN predictions and determines the number of samples required to estimate the confidence interval for a given confidence level. The authors of [9] propose a security-model-based reinforcement learning approach to control nonlinear systems described by linear parameter variation models.

In order to improve control accuracy, these methods require feedback. For example, a state feedback Smith predictive controller was proposed for the effective temperature control of a cement rotary kiln precalcining furnace [10]. The authors of [11] present a fully distributed adaptive tracking control scheme for multi-agent systems with a strict feedback form. Generally, this type of state feedback control requires all systems’ internal state information, which is challenging to achieve in reality.

Therefore, control methods based on system output have also been proposed. These control algorithms require only the system’s output information to complete the control process. For example, the authors of [12] studied a linear–quadratic (LQ) control problem with irregular output feedback in which a noisy linear system measured the state. In [13], the authors discuss the collaborative design of output-dependent switching functions and full-order affine filters for discrete-time switched affine systems. This control method has a certain degree of versatility and has achieved good application results. However, the controlled system does not have a strict feedback form.

Strict feedback systems present a good lower triangle form, while the control systems for a flexible manipulator and some temperatures are in a strict feedback form. Commonly, the backstepping control method is used for such systems, e.g., in [14], a neural-network-based adaptive gain scheduling backward sliding mode control (NNAGS-BSMC) method is proposed for a class of non-linear systems with uncertain strict feedback. Reference [15] presents a novel tracking controller utilizing an event-triggering implementation for uncertain rigor feedback systems. Adaptive fuzzy decentralized optimal control problems for a class of large-scale non-linear systems with a strict feedback form have also been studied [16]. A backstepping method usually has specific prerequisite requirements for the system or control strategy and needs to calculate a higher differential, imposing a high calculation complexity. Such problems have been improved to a certain extent by combining some improved backstepping methods with adaptive control ideas. For example, [17] addresses the adaptive event-triggered control of non-linear continuous-time strict feedback systems. However, the overall calculation process of this method must meet trigger conditions before it is carried out, prohibiting it from meeting real-time performance requirements.

With the development of neural networks, new methods have been proposed for non-linear control problems, exploiting the appealing approximation characteristics of neural networks. For example, [18] addresses the compound learning control of a perturbed uncertain strict feedback system. In [19], the authors studied the data-based compound neural control of an uncertain strict feedback system’s online record using a backstepping framework. This algorithm provides a relatively general idea for non-linear control to a certain extent, but as neuron cardinality increases, the computational complexity increases geometrically. The multi-dimensional Taylor network is a newly proposed control structure. Due to its simple structure and convenient application, some promising results have been achieved. For example, the authors of [20] studied non-linear time-delay systems with uncertainties. However, the use of the MTN control algorithm for a strict feedback system has not been thoroughly studied.

Spurred by this, this paper proposes an output feedback control method for a strict non-linear system based on an MTN so that the system’s output can automatically track the desired signal. Our method initially transforms the original non-linear strict feedback system and redefines the state variables to obtain the new standard form. The state observer then completes the identification process of the adaptive system with the MTN’s good approximation characteristics. The adaptive control law completes the system’s tracking output based on this. Finally, a numerical simulation of a servo-hydraulic system model is carried out, verifying the effectiveness of the proposed algorithm.

The main contributions of this paper are as follows:

• The traditional MTN control method relies on the unique performance of its basic structure and is designed and used for general controlled objects. Therefore, some characteristics of the controlled object itself are not fully considered and utilized. Therefore, this paper applies the MTN to strictly nonlinear feedback systems for the first time, taking full advantage of the characteristics that different parameters of the MTN can have different outputs with the same result and that processing two sets of internal parameters at the same time can effectively improve control efficiency.
• In the control process, a set of variable representation rules is designed so that the general strict feedback system can be expressed in a standard form. On this basis, an adaptive parameter-adjustment rule based on a state observer is designed to bring the tracking error close to 0. Thanks to the simple structure of the MTN, compared with a neural network algorithm, it can effectively reduce the number of calculations.

The remainder of this paper is organized as follows. Section 2 introduces the strict feedback system and transforms the original system into a standard form. Section 3 presents the design of the state observer, while Section 4 introduces the multi-dimensional Taylor network and its basic structure. Section 5 introduces a parameter identification method based on a multi-dimensional Taylor network, and Section 6 presents the controller’s design and a stability analysis of the system. Section 7 illustrates the effectiveness of the proposed control scheme through a numerical simulation of a hydraulic control system. Finally, Section 8 concludes this paper.

2. System Model

Consider the following strictly non-linear feedback system:

$$\left\{\begin{array}{l}{\dot{x}}_1=f_1(x_1)+h_1(x_1)x_2\\ ⋮\\ {\dot{x}}_i=f_i({\mathit{x}}_i)+h_i({\mathit{x}}_i)x_{i+1}\\ ⋮\\ {\dot{x}}_n=f_n({\mathit{x}}_n)+h_n({\mathit{x}}_n)u\\ y=x_1\end{array}\right.$$

(1)

where ${\mathit{x}}_i=[x_1,x_2,\cdots ,x_i]\in R^i$, $i=1,2,\cdots ,n$ is the system state variable, $u\in R$ is the system control input, $y\in R$ is the system output, $f_i(\cdot )$, $i=1,2,\cdots ,n$ is the non-linear system mapping, $h_i(\cdot )$, $i=1,2,\cdots ,n$ is the system’s non-linear control gain function, and $h_i(\cdot )$, …, $h_i(\cdot )$ are not equal to 0.

The main task of this paper is designing an MTN-based output feedback controller for the above-mentioned strictly non-linear feedback system, affording the output of the system $y$ to track a given signal $y_d$.

Traditional control methods usually require all state variable information for such problems, that is, $x_1,x_2,\cdots ,x_n$. At the same time, the multi-step backstepping controller design suffers from error accumulation, and the process is complicated and cumbersome. Thus, this paper proposes a feedback algorithm based only on the output to simplify the control algorithm and reduce the calculation burden. In order to realize the control algorithm, the original strict feedback system needs to be transformed.

We define the state variables as

$$\left\{\begin{array}{l}{z}_1=x_1\\ \hspace{1em}⋮\\ z_i={\dot{z}}_{i-1}\hspace{1em}\hspace{1em}\hspace{1em}i=2,\cdots ,n\\ y=x_1=z_1\end{array}\right.$$

(2)

Then, there is

$$z_2={\dot{z}}_1={\dot{x}}_1$$

(3)

$$\begin{array}{l}{z}_3={\dot{z}}_2=\frac{\partial f_1}{\partial x_1}{\dot{x}}_1+\frac{\partial h_1}{\partial x_1}{\dot{x}}_1{x}_2+h_1{\dot{x}}_2\\ =\frac{\partial f_1}{\partial x_1}{\dot{x}}_1+\frac{\partial h_1}{\partial x_1}{\dot{x}}_1{x}_2+h_1(f_2+h_2{x}_3)\\ =(\frac{\partial f_1}{\partial x_1}+\frac{\partial h_1}{\partial x_1}{x}_2)(f_1+h_1{x}_2)+h_1{f}_2+h_1{h}_2{x}_3\end{array}$$

(4)

Setting $A_2=(\frac{\partial f_1}{\partial x_1}+\frac{\partial h_1}{\partial x_1}{x}_2)(f_1+h_1{x}_2)+h_1{f}_2$ and $B_2=h_1{h}_2$, we obtain

$$z_3={\dot{z}}_2=A_2+B_2{x}_3$$

(5)

By analogy, Equation (5) can be expressed as

$${\dot{z}}_i=A_i+B_i{x}_{i+1}$$

(6)

where $A_i={\displaystyle \sum _{k=1}^{i-1}(\frac{\partial A_{i-1}}{\partial x_k}+\frac{\partial B_{i-1}}{\partial x_k}{x}_i)(f_k+h_k{x}_{k+1})+B_{i-1}}{f}_i$ and $B_i=B_{i-1}{h}_i=B_{i-2}{h}_{i-1}{h}_i={\displaystyle \prod _{k=1}^i{h}_k}$.

After the above changes, the original strict-feedback non-linear system can be expressed as

$$\left\{\begin{array}{l}{\dot{z}}_1=z_2\\ {\dot{z}}_2=z_3\\ \hspace{1em}⋮\\ {\dot{z}}_{i-1}=z_{i}i=2,\cdots ,n-1\\ \hspace{1em}⋮\\ {\dot{z}}_n=A_n+B_{n}u\\ y=z_1\end{array}\right.$$

(7)

In addition, $A_n$ and $B_n$ include the unknown non-linear mappings $f_i$ and $h_i$ of the original system. Since $h_i$ in the original hypothesis is not equal to 0, it is assumed that the gain function $B_n$ is a bounded function greater than 0 and that $0<B_{\min }\le B_n\le B_{\max }$, where $B_{\min }$ and $B_{\max }$ are constants greater than 0.

After the transformation, the original strict feedback system has a general standard shape. Since $z_1=x_1$, after the transformation, the system output is unchanged, and the original control target is consistent. However, $A_n$ and $B_n$ are unknown, and except for $z_1$, the higher-order state $z_i$ is unavailable, so a state observer needs to be designed.

3. State Observer

According to [21], for the above-mentioned strict feedback system, the following state observer can be constructed to observe the high-order state of $z$.

$$\left\{\begin{array}{l}{\dot{\widehat{z}}}_1={\alpha }_1\\ {\alpha }_1=K_1{\left|y-{\widehat{z}}_1\right|}^{\frac{n}{n+1}}sign(y-{\widehat{z}}_1)+{\widehat{z}}_2\\ \hspace{1em}⋮\\ {\dot{\widehat{z}}}_i={\alpha }_i\\ {\alpha }_i=K_i{\left|{\alpha }_{i-1}-{\widehat{z}}_i\right|}^{\frac{n-i+1}{n-i+2}}sign({\alpha }_{i-1}-{\widehat{z}}_i)+{\widehat{z}}_{i+1}\hspace{1em}\hspace{1em}\hspace{1em}i=2,\cdots ,n-1\\ \hspace{1em}⋮\\ {\dot{\widehat{z}}}_n={\alpha }_n\\ {\alpha }_n=K_n{\left|{\alpha }_{n-1}-{\widehat{z}}_n\right|}^{\frac{1}{2}}sign({\alpha }_{n-1}-{\widehat{z}}_n)+{\widehat{z}}_{n+1}\\ {\dot{\widehat{z}}}_{n+1}=K_{n+1}sign({\alpha }_n-{\widehat{z}}_{n+1})\end{array}\right.$$

(8)

where $K_1,\cdots ,K_{n+1}>0$ is the observation gain and ${\widehat{z}}_1,\cdots ,{\widehat{z}}_n$ is the estimation of the state quantity $z_1,\cdots ,z_n$. It has been proven in the literature that the above observer converges in a finite time.

4. Experimental Investigation

The MTN can approximate any non-linear functions with a finite point of discontinuity. A neat structure is the merit of the MTN, whose terms are easy to adjust. For further details on the MTN, the reader is referred to [22,23,24,25,26,27,28].

Let

$$\mathbf{z}=[z_1,z_2,\dots z_n]$$

(9)

The basic structure of the MTN is illustrated in Figure 1.

In other words, there exists a set of parameter vectors $\mathit{w}=[w_1,w_2,\dots w_{N(n,t)}]$ such that the output of the MTN $O_{ut}$ can be expressed as

$$O_{ut}={\displaystyle \sum _{i=1}^{N(n,t)}{w}_i{\displaystyle \prod _{s=1}^n{z}_i^{{\lambda }_{s,i}}}}$$

(10)

where $N(n,t)$ is the total number of the expansion, $w_i$ is the weight of the product term, ${\lambda }_{s,i}$ is the power of $z_s$ in the $i$th product term, and ${\displaystyle \sum _{s=1}^n{\lambda }_{s,i}\le t}$.

Setting $\eta (\mathbf{z})={[1,z_1,z_2,\dots ,z_n,\dots ,z_1^2,z_1{z}_2,\dots ,z_n^t]}^T$, we obtain

$$O_{ut}=\mathit{w}\cdot \eta (\mathbf{z})$$

(11)

Similar to Reference [29], there is no fixed standard for the highest power of the MTN, but with an increase in the power of the MTN, the internal function will increase, and it is usually appropriate to choose three times in practice.

5. Adaptive System Identification

In order to design an ideal feedback controller, $A_n$ and $B_n$ are required; thus, system identification is involved, with traditional identification methods usually considering $A_n$ and $B_n$ separately. Due to problems in $B_n$ such as zero crossing, it is easy to cause singularity problems like system divergence. To solve this difficulty, we modify the system as follows.

We rewrite the last subsystem and obtain

$$u=\frac{1}{B_n}{\dot{z}}_n-\frac{A_n}{B_n}$$

(12)

Therefore, the system can be identified for the two unknowns $\frac{1}{B_n}$ and $\frac{A_n}{B_n}$ to avoid the singularity problem.

According to the basic structure of MTN, we obtain

$$\left\{\begin{array}{l}\frac{1}{B_n}={\mathit{w}}_1^{*}{}^{\mathrm{T}}\eta (\mathbf{z})+{\epsilon }_1\\ \frac{A_n}{B_n}={\mathit{w}}_2^{*}{}^{\mathrm{T}}\eta (\mathbf{z})+{\epsilon }_2\end{array}\right.$$

(13)

where $\eta (\mathbf{z})$ is the polynomial combination of MTN.

Since $\mathbf{z}$ is unknown, it can be replaced by $\widehat{\mathbf{z}}$ from the foregoing equation. Despite an error between them, it can be compensated through weight adjustment. ${\mathit{w}}_1^{*}$ and ${\mathit{w}}_2^{*}$ are ideal-weight MTN vectors.

Unlike traditional neural network methods, our technique requires two sets of basis vectors in which each is calculated separately, imposing a significant computational burden. Moreover, there is a suitable polynomial combination compared with the MTN, i.e., the identification effect can be achieved only by changing the parameter value.

By introducing the MTN, the system input value can be rewritten as

$$u={\mathit{w}}_1^{*}{}^{\mathrm{T}}\eta (\mathbf{z}){\dot{z}}_n-{\mathit{w}}_2^{*}{}^{\mathrm{T}}\eta (\mathbf{z})+\epsilon$$

(14)

where $\epsilon ={\epsilon }_1{\dot{z}}_n-{\epsilon }_2$ is the total error of the MTN.

In the above formula, ${\dot{z}}_n$ is unknown and can be replaced by ${\dot{\widehat{z}}}_n$, so we can obtain

$$u={\mathit{w}}_1^{*}{}^{\mathrm{T}}\eta (\widehat{\mathbf{z}}){\dot{\widehat{z}}}_n-{\mathit{w}}_2^{*}{}^{\mathrm{T}}\eta (\widehat{\mathbf{z}})+\xi$$

(15)

where $\xi =\epsilon +{\mathit{w}}_1^{*}{}^{\mathrm{T}}\eta (\widehat{\mathbf{z}}){\dot{\tilde{z}}}_n$ is the total system identification error.

Since the unknown network weights ${\mathit{w}}_1^{*}$ and ${\mathit{w}}_2^{*}$ have not been estimated, the control strategy described below is designed.

In the above calculations, only ${\widehat{z}}_n$ is estimated, while the derivative of the system ${\widehat{z}}_n$, i.e., ${\dot{\widehat{z}}}_n$, is unknown. Thus, a low-pass filter $\frac{1}{1+\theta s}$ is introduced where $\theta$ is the filter constant. Using the inverse Laplace transform and without considering the influence of the initial value, the following formula can be obtained:

$$\left\{\begin{array}{l}{\widehat{z}}_{n\theta }=\frac{{\widehat{z}}_n}{1+\theta s}\\ {\dot{\widehat{z}}}_{n\theta }=\frac{{\widehat{z}}_n-{\widehat{z}}_{n\theta }}{\theta }\end{array}\right.$$

(16)

letting the initial value of ${\widehat{z}}_{n\theta }$ be 0, i.e., ${\widehat{z}}_{n\theta }(0)=0$.

Correspondingly, the low-pass filter can be applied to other variables, and the initial value is set to 0.

Lemma 1. 

Consider the continuous function $G(x)=G_1(x)G_2(x)$, where $G_1(x)$ and $G_2(x)$ are both continuous mappings. After applying the low-pass filter, the following conclusions can be drawn:

$$G_{\theta }(x)=G_{1\theta }(x)G_{2\theta }(x)+\rho$$

(17)

where $G_{1\theta }$ and $G_{2\theta }$ are the functions of $G_1$ and $G_2$ passing through the low-pass filter and $\rho$ is the high-order truncation error.

From Lemma 1, we obtain

$${(\eta (\widehat{\mathbf{z}}){\dot{\widehat{z}}}_n)}_{\theta }=\eta {(\widehat{\mathbf{z}})}_{\theta }{\dot{\widehat{z}}}_{n\theta }+\rho$$

(18)

Substituting the previous formula, we obtain

$$u_{\theta }={\mathit{W}}_{}^{*}{}^{\mathrm{T}}{\Psi }_{\theta }+\lambda$$

(19)

where $\lambda =\rho +{\xi }_{\theta }$ is the lumped error, ${\mathit{W}}_{}^{*}={[{\mathit{w}}_1^{*\mathrm{T}},{\mathit{w}}_2^{*\mathrm{T}}]}_{}^{\mathrm{T}}$ is the generalized weight vector, and ${\Psi }_{\theta }=[\frac{\eta {(\widehat{\mathbf{z}})}_{\theta }({\widehat{z}}_n-{\widehat{z}}_{n\theta })}{\theta },-\eta {(\widehat{\mathbf{z}})}_{\theta }]$ is the generalized control vector of input $u$.

6. Adaptive Control Law Design

By adjusting $\widehat{\mathit{W}}$ to make it infinitely close to ${\mathit{W}}_{}^{*}$, we finally achieve the control purpose. To this end, we designed an error-based adaptive adjustment rate that is $\tilde{\mathit{W}}={\mathit{W}}_{}^{*}-\widehat{\mathit{W}}$.

Parameter definition:

$$F=\frac{\beta {\Psi }_{\theta }}{{\Psi }_{\theta }^{\mathrm{T}}{\Psi }_{\theta }+\gamma }$$

(20)

where $\beta$ and $\gamma$ are positive constants.

We design two auxiliary variables, $P\in R^{2N\times 2N}$ and $Q\in R^{2N\times 1}$, based on $F$:

$$\left\{\begin{array}{l}\dot{P}=-\beta P+F{\Psi }_{\theta }^{\mathrm{T}}\hspace{1em}\hspace{1em}\hspace{1em}P\left(0\right)=0\\ \dot{Q}=-\beta Q+F{u}_{\theta }^{\mathrm{T}}\hspace{1em}\hspace{1em}\hspace{1em}Q\left(0\right)=0\end{array}\right.$$

(21)

Since both $\beta$ and $\gamma$ are greater than 0, it can be guaranteed that $P$ and $Q$ are both bounded.

We calculate the above formula to obtain

$$Q=P{\mathit{W}}_{}^{*}-{\displaystyle {\int }_0^t{e}^{\beta (\tau -t)}F\lambda d\tau }$$

(22)

By setting $\delta ={\displaystyle {\int }_0^t{e}^{\beta (\tau -t)}F\lambda d\tau }$, we obtain

$$Q=P{\mathit{W}}_{}^{*}-\delta$$

(23)

where the norm of $\delta$ is a bounded function, that is, $‖\delta ‖\le {\delta }_{\max }$.

The error vector is defined as

$$S=P\widehat{\mathit{W}}-Q$$

(24)

By subtracting the above two formulas, we obtain

$$S=\delta -P\tilde{\mathit{W}}$$

(25)

Then, after the low-pass filter, the auxiliary variables $F$, $P$, and $Q$ are calculated and $S$ is obtained. An adaptive rate based on $S$ can be designed as

$$\Delta \widehat{\mathit{W}}=-\lambda \cdot S$$

(26)

where $\lambda >0$ is an adaptive adjustment step.

Theorem 1. 

If the above-mentioned adaptive rate is used, the weight error vector finally converges near the 0 point under the condition of a continuous excitation of ${\Psi }_{\theta }$.

Proof. 

We define the Lyapunov function as

$$V=\frac{1}{2}{\tilde{\mathit{W}}}^{\mathrm{T}}Ste{p}^{-1}\tilde{\mathit{W}}$$

(27)

Deriving the above formula provides

$$\dot{V}={\tilde{\mathit{W}}}^{\mathrm{T}}Ste{p}^{-1}\dot{\tilde{\mathit{W}}}={\tilde{\mathit{W}}}^{\mathrm{T}}\delta -{\tilde{\mathit{W}}}^{\mathrm{T}}P\tilde{\mathit{W}}$$

(28)

Since ${\Psi }_{\theta }$ continues to excitate, there is a normal number, $\kappa$, for $\forall t>0$:

$${\displaystyle {\int }_t^{t+\Delta t}F{\Psi }_{\theta }^{\mathrm{T}}d\tau \ge \kappa I}$$

(29)

It can be seen from the auxiliary variable $P$ that

$$P(t)\ge e^{-\beta \Delta t}{\displaystyle {\int }_{t-\Delta t}^{t}F{\Psi }_{\theta }^{\mathrm{T}}d\tau \ge e^{-\beta \Delta t}\kappa }$$

(30)

For simplicity, we define $\varsigma =e^{-\beta \Delta t}\kappa$ and obtain

$$\dot{V}={\tilde{\mathit{W}}}^{\mathrm{T}}\delta -{\tilde{\mathit{W}}}^{\mathrm{T}}P\tilde{\mathit{W}}\le \frac{{\delta }_{\max }^2}{2\varsigma }-\frac{\varsigma }{{\lambda }_{\max }(Ste{p}^{-1})}V$$

(31)

Since both $\frac{{\delta }_{\max }^2}{2\varsigma }$ and $\frac{\varsigma }{{\lambda }_{\max }(Ste{p}^{-1})}$ are greater than 0, it can be known from the Lyapunov theorem that $V$ and the error vector $\tilde{\mathit{W}}$ converge to around 0 according to the exponential law.

The proof is complete. □

Compared with the traditional gradient method, the auxiliary variables $F$, $P$, and $Q$ are constructed in this paper, and then an adaptive rate based on $S$ is designed, ensuring that the error vector $\tilde{\mathit{W}}$ converges to near 0, i.e., $\widehat{\mathit{W}}$ is infinitely close to ${\mathit{W}}_{}^{*}$. Thus, the system estimation affords guaranteed accuracy.

Controller Design and Stability Analysis

In order to achieve the ultimate control goal, we define the error vector and the generalized Hurwitz polynomial

$$\mathit{e}=\mathbf{z}-{\mathit{x}}_{\mathit{d}}$$

(32)

where ${\mathit{x}}_{\mathit{d}}=[x_d,\cdots ,x_d^{(n-1)}]$ are the tracking target and its higher-order derivative.

Set

$$\nu =[{\mathbf{\Lambda }}^{\mathrm{T}},1]\mathit{e}$$

(33)

where $\mathbf{\Lambda }={[{\Lambda }_1,\cdots ,{\Lambda }_{n-1}]}^{\mathrm{T}}$ makes ${\Lambda }_1+{\Lambda }_{2}s+\cdots +{\Lambda }_{n-1}{s}^{n-2}+s^{n-1}$ satisfy the Hurwitz polynomial.

When $\nu$ converges and is bounded, $\mathit{e}$ also converges and is bounded accordingly.

Here, the observation state $\widehat{\mathbf{z}}$ is used instead of $\mathbf{z}$, and the actual errors $\widehat{\mathit{e}}$ and $\widehat{\nu }$ are defined accordingly. That is,

$$\widehat{\mathit{e}}=\widehat{\mathbf{z}}-{\mathit{x}}_{\mathit{d}}$$

(34)

$$\widehat{\nu }=[{\mathbf{\Lambda }}^{\mathrm{T}},1]\widehat{\mathit{e}}$$

(35)

The difference between the replacement and the original state is represented by $\tilde{\mathbf{z}}$ and $\tilde{\nu }$, as shown below.

$$\tilde{\mathbf{z}}=\mathit{e}-\widehat{\mathit{e}}=(\mathbf{z}-{\mathit{x}}_{\mathit{d}})-(\widehat{\mathbf{z}}-{\mathit{x}}_{\mathit{d}})=\mathbf{z}-\widehat{\mathbf{z}}$$

(36)

$$\tilde{\nu }=\nu -\widehat{\nu }=[{\mathbf{\Lambda }}^{\mathrm{T}},1]\tilde{\mathbf{z}}$$

(37)

Taking the derivative of $\nu$, we obtain

$$\dot{\nu }=[0,{\mathbf{\Lambda }}^{\mathrm{T}}]\mathit{e}+A_n+B_{n}u-x_d^{(n)}$$

(38)

We multiply both ends of the equation by $\frac{1}{B_n}$, substitute the expressions above, and sort them to obtain

$$\frac{1}{B_n}\dot{\nu }={\mathit{w}}_1^{*}{}^{\mathrm{T}}\eta (\mathbf{z})[0,{\mathbf{\Lambda }}^{\mathrm{T}}]e+{\epsilon }_1[0,{\mathbf{\Lambda }}^{\mathrm{T}}]\mathit{e}+{\mathit{w}}_2^{*}{}^{\mathrm{T}}\eta (\mathbf{z})+{\epsilon }_2+u-{\mathit{w}}_1^{*}{}^{\mathrm{T}}\eta (\mathbf{z})x_d^{(n)}-{\epsilon }_1{x}_d^{(n)}$$

(39)

We replace $\mathbf{z}$ with the observation state $\widehat{\mathbf{z}}$. Let $\Phi =[\eta (\widehat{\mathbf{z}})[0,{\mathbf{\Lambda }}^{\mathrm{T}}]\widehat{\mathit{e}}-\eta (\widehat{\mathbf{z}})x_d^{(n)},\eta (\widehat{\mathbf{z}})]$ be the augmented polynomial vector, and let $\rho =({\mathit{w}}_1^{*}{}^{\mathrm{T}}\eta (\widehat{\mathbf{z}})+{\epsilon }_1)[0,{\mathbf{\Lambda }}^{\mathrm{T}}]\tilde{\mathbf{z}}+{\epsilon }_2-{\epsilon }_1{x}_d^{(n)}$ be the sum of the approximation errors of the differential observer and the MTN network. Then, we obtain

$$\frac{1}{B_n}\dot{\nu }={\mathit{W}}_{}^{*}{}^{\mathrm{T}}\Phi +{\epsilon }_1[0,{\mathbf{\Lambda }}^{\mathrm{T}}]\widehat{\mathit{e}}+\rho +u$$

(40)

In order to achieve the final control purpose, the control quantity $u$ is constructed as shown below.

$$u=-k\widehat{\nu }-{\widehat{\mathit{w}}}_1^{\mathrm{T}}\eta (\widehat{\mathbf{z}})[0,{\mathbf{\Lambda }}^{\mathrm{T}}]\widehat{\mathit{e}}-x_d^{(n)}-{\widehat{\mathit{w}}}_2^{\mathrm{T}}\eta (\widehat{\mathbf{z}})$$

(41)

Where $k$ is the gain parameter, and ${\widehat{\mathit{w}}}_1^{}$ and ${\widehat{\mathit{w}}}_2^{}$ are estimates of the ideal weight vectors ${\widehat{\mathit{w}}}_1^{*}$ and ${\widehat{\mathit{w}}}_2^{*}$.

We substitute $u$ to obtain

$$\frac{1}{B_n}\dot{\nu }=-k\widehat{\nu }+{\tilde{\mathit{W}}}^{\mathrm{T}}\Phi +\rho +{\epsilon }_1[0,{\mathbf{\Lambda }}^{\mathrm{T}}]\widehat{\mathit{e}}$$

(42)

Similar to Theorem 1, the following adaptive law is designed:

$$\Delta \widehat{\mathit{W}}=-Step\cdot (\beta S-\Phi \widehat{\nu })$$

(43)

where $Step>0$ is the adaptive adjustment step and $\beta >0$ is the correction parameter.

Theorem 2. 

Given the strict feedback system of Equation (1), when the differential state observer of Equation (8), the control input of Equation (41), the parameter vector adaptive law of Equation (43), and the MTN polynomial $\eta (\mathbf{z})$ preserve a continuous motivation, then all signals in a closed-loop system are bounded and the error variables $\mathit{e}$ and $\nu$ and the weight vector error $\tilde{\mathit{W}}$ all converge to a compact set near the 0 point.

Proof. 

From the definition of the observation error, we obtain

$$\frac{1}{B_n}\dot{\widehat{\nu }}=-k\widehat{\nu }+{\tilde{\mathit{W}}}^{\mathrm{T}}\Phi +\rho +{\epsilon }_1[0,{\mathbf{\Lambda }}^{\mathrm{T}}]\widehat{\mathit{e}}+\frac{1}{B_n}[{\mathbf{\Lambda }}^{\mathrm{T}},1]\tilde{\mathbf{z}}$$

(44)

Let $\gamma =\rho +\frac{1}{B_n}[{\mathbf{\Lambda }}^{\mathrm{T}},1]\tilde{\mathbf{z}}$ be the observation error of the differentiator and bounded, that is, $\gamma \le {\gamma }_{\max }$, where ${\gamma }_{\max }$ is a normal constant.

We choose the Lyapunov function as follows:

$$V=\frac{1}{2}{\widehat{\nu }}^2+\frac{1}{2}{B}_{\min }{\tilde{\mathit{W}}}^{\mathrm{T}}Ste{p}^{-1}\tilde{\mathit{W}}$$

(45)

By deriving the above formula, we obtain

$$\dot{V}=\widehat{\nu }\dot{\widehat{\nu }}+B_{\min }{\tilde{\mathit{W}}}^{\mathrm{T}}Ste{p}^{-1}\dot{\tilde{\mathit{W}}}$$

(46)

Substituting the previous form into Equation (41), we obtain

$$\begin{array}{l}\dot{V}=-B_{n}k{\widehat{\nu }}^2+(B_n-B_{\min }){\tilde{\mathit{W}}}^{\mathrm{T}}\Phi \widehat{\nu }+B_n{\epsilon }_1[0,{\mathbf{\Lambda }}^{\mathrm{T}}]\widehat{\mathit{e}}\widehat{\nu }\\ +B_n\gamma \widehat{\nu }-B_{\min }\beta {\tilde{\mathit{W}}}^{\mathrm{T}}P\tilde{\mathit{W}}+B_{\min }\beta {\tilde{\mathit{W}}}^{\mathrm{T}}\delta \end{array}$$

(47)

From Equation (35), we know that $\left|\widehat{\nu }\right|\ge \frac{\left|\widehat{\mathit{e}}\right|}{{\lambda }_{\min }([{\mathbf{\Lambda }}^{\mathrm{T}},1])}$, so we obtain

$$\begin{array}{l}\dot{V}\le -B_{n}k{\widehat{\nu }}^2+(B_n-B_{\min }){\tilde{\mathit{W}}}^{\mathrm{T}}\Phi \widehat{\nu }+B_n\gamma \widehat{\nu }+B_n{\epsilon }_1\frac{{\lambda }_{\max }([0,{\mathbf{\Lambda }}^{\mathrm{T}}])}{{\lambda }_{\min }([{\mathbf{\Lambda }}^{\mathrm{T}},1])}{\left|\widehat{\nu }\right|}^2\\ -B_{\min }\beta {\tilde{\mathit{W}}}^{\mathrm{T}}P\tilde{\mathit{W}}+B_{\min }\beta {\tilde{\mathit{W}}}^{\mathrm{T}}\delta \\ \le -B_n(k-{\epsilon }_1\frac{{\lambda }_{\max }([0,{\mathbf{\Lambda }}^{\mathrm{T}}])}{{\lambda }_{\min }([{\mathbf{\Lambda }}^{\mathrm{T}},1])}){\widehat{\nu }}^2+(B_n-B_{\min }){\tilde{\mathit{W}}}^{\mathrm{T}}\Phi \widehat{\nu }\\ +B_n\gamma \widehat{\nu }-B_{\min }\beta {\tilde{\mathit{W}}}^{\mathrm{T}}P\tilde{\mathit{W}}+B_{\min }\beta {\tilde{\mathit{W}}}^{\mathrm{T}}\delta \end{array}$$

(48)

Therefore, $k-{\epsilon }_1\frac{{\lambda }_{\max }([0,{\mathbf{\Lambda }}^{\mathrm{T}}])}{{\lambda }_{\min }([{\mathbf{\Lambda }}^{\mathrm{T}},1])}>0$ can be established by setting a larger $k$.

From Theorem 1, we know that ${\lambda }_{\min }(P)>\kappa$, so we have

$$\begin{array}{l}\dot{V}\le -B_n(k-{\epsilon }_1\frac{{\lambda }_{\max }([0,{\mathbf{\Lambda }}^{\mathrm{T}}])}{{\lambda }_{\min }([{\mathbf{\Lambda }}^{\mathrm{T}},1])}){\widehat{\nu }}^2+(B_{\max }+B_{\min })‖{\tilde{\mathit{W}}}^{\mathrm{T}}\Phi ‖\left|\widehat{\nu }\right|\\ +B_n{\gamma }_{\max }\left|\widehat{\nu }\right|-B_{\min }\beta \kappa {‖\tilde{\mathit{W}}‖}^2+B_{\min }\beta ‖\tilde{\mathit{W}}‖{\delta }_{\max }\end{array}$$

(49)

By applying Young’s inequality to $‖{\tilde{\mathit{W}}}^{\mathrm{T}}\Phi ‖\left|\widehat{\nu }\right|$, $B_n{\gamma }_{\max }\left|\widehat{\nu }\right|$, and $‖\tilde{\mathit{W}}‖{\delta }_{\max }$, and substituting the result into the above formula, we obtain

$$\begin{array}{l}\dot{V}\le -\min \left\{B_n(k-{\epsilon }_1\frac{{\lambda }_{\max }([0,{\mathbf{\Lambda }}^{\mathrm{T}}])}{{\lambda }_{\min }([{\mathbf{\Lambda }}^{\mathrm{T}},1])})-\frac{2(B_{\max }+B_{\min }){‖\Phi ‖}^2}{\kappa B_{\min }\beta },\frac{\beta \kappa }{{\lambda }_{\max }([0,{\mathbf{\Lambda }}^{\mathrm{T}}])}\right\}V\\ +\frac{B_{\max }^2{\gamma }_{\max }^2}{2B_{\min }(k-{\epsilon }_1\frac{{\lambda }_{\max }([0,{\mathbf{\Lambda }}^{\mathrm{T}}])}{{\lambda }_{\min }([{\mathbf{\Lambda }}^{\mathrm{T}},1])})}+\frac{B_{\min }\beta {\delta }_{\max }^2}{\kappa }\end{array}$$

(50)

Equation (50) reveals that by appropriately increasing the gain parameter $k$ and the correction parameter $\beta$, it can be ensured that

$$\min \left\{B_n(k-{\epsilon }_1\frac{{\lambda }_{\max }([0,{\mathbf{\Lambda }}^{\mathrm{T}}])}{{\lambda }_{\min }([{\mathbf{\Lambda }}^{\mathrm{T}},1])})-\frac{2(B_{\max }+B_{\min }){‖\Phi ‖}^2}{\kappa B_{\min }\beta },\frac{\beta \kappa }{{\lambda }_{\max }([0,{\mathbf{\Lambda }}^{\mathrm{T}}])}\right\}>0$$

(51)

$$\frac{B_{\max }^2{\gamma }_{\max }^2}{2B_{\min }(k-{\epsilon }_1\frac{{\lambda }_{\max }([0,{\mathbf{\Lambda }}^{\mathrm{T}}])}{{\lambda }_{\min }([{\mathbf{\Lambda }}^{\mathrm{T}},1])})}+\frac{B_{\min }\beta {\delta }_{\max }^2}{\kappa }>0$$

(52)

From the Lyapunov theorem, we know that the errors $\widehat{\nu }$ and $\tilde{\mathit{W}}$ are bounded and converge to a compact set near the 0 point. At the same time, from Equations (35) and (43), and since $\tilde{\mathbf{z}}$ is bounded, we conclude that $\nu$, $\mathit{e}$, and $\widehat{\mathit{e}}$ are bounded and that the weight vector $\widehat{\mathit{W}}$ is bounded. From Equation (41), the control signal $u$ is bounded.

The proof is completed. □

In this paper, the adaptive law based on an MTN ensures that the estimated weight vector approaches the true weight vector in a direction with infinitely small errors. At the same time, compared with the traditional dual-neural-network identification method, the number of calculations is reduced, and the identification process of the unknown dynamics of the entire system is completed.

7. Simulation Example

Consider the servo-hydraulic system of [28], as illustrated in Figure 2.

The system has typical strict-feedback non-linear characteristics where $x_q$ is the output displacement, $F_a$ is the output driving force of the hydraulic drive, $P_i$ is the pressure, $m$ is the mass of the load, $k_s$ is the spring coefficient, and $c$ is the damping coefficient.

The system model is as follows:

$$\left\{\begin{array}{l}{\dot{x}}_1=x_2\\ {\dot{x}}_2=-f_{11}(x)x_1-f_{12}(x)x_2+x_3\\ {\dot{x}}_3=-f_{21}(x)x_2-f_{22}(x)x_3+f_{23}(x)u\\ y=x_1\end{array}\right.$$

(53)

where $f_{11}(x)=\frac{k_s}{m}$, $f_{12}(x)=\frac{c}{m}$, $f_{21}(x)=\frac{4{\beta }_e{\omega }^2}{V_{t}m}$, $f_{22}(x)=\frac{4{\beta }_e}{V_{t}m}{C}_t$, and $f_{23}(x)=\frac{4{\beta }_e\omega }{V_{t}m}\chi$.

$V_t$ is the total volume of the hydraulic cylinder, ${\beta }_e$ is the elastic modulus of the hydraulic fluid, $\omega$ is the effective acting area of the piston in the hydraulic cylinder, and $\chi$ is the effective conversion ratio of the servo valve input and output.

In order to verify the validity, we select data close to reality:

$m=38\mathrm{kg}$; $k_s=1.425\times {10}^4\mathrm{N}/\mathrm{m}$; $c=1.425\times {10}^3\mathrm{N}\cdot \mathrm{s}/\mathrm{m}$; $V_t=5.6\times {10}^{-5}{\mathrm{m}}^3$; ${\beta }_e=600{\mathrm{MP}}_{\mathrm{a}}$; $\omega =2.8\times {10}^{-4}{\mathrm{m}}^2$; $C_t=4\times {10}^{-13}{\mathrm{m}}^3\cdot {\mathrm{P}}_{\mathrm{a}}/\mathrm{s}$; $\chi =1\times {10}^{-2}{\mathrm{m}}^3\cdot \mathrm{V}/\mathrm{s}$.

The unit step response curve of the MTN is illustrated in Figure 3.

In Figure 3, the BPNN controller and RBFNN controller are given. As traditional control methods, the neural network controllers work well and have the ability to resist disturbance. From these experimental results, it is shown that the method proposed in this paper is faster than another.

To accurately assess the performance of the three control methods, we employed three error metrics: the (1) Root Mean Square Error (RMSE), which represents the square root of the ratio of the squared differences between the actual values and the predicted values and is sensitive to outliers in the data; (2) the Mean Absolute Error (MAE), which measures the average distance between the model’s predicted values and the actual values and is less sensitive to outliers; and (3) the Mean Absolute Percentage Error (MAPE), which is a relative measure that quantifies the accuracy of predictions using relative error. The values of these metrics obtained using the three control methods are shown in

Table 1. The unit step response comparison among three metrics obtained using different control methods.

Error Comparison	RMSE	MAE	MAPE
MTN	0.03360	0.04857	1.0844
BPNN controller	0.06321	0.11697	1.18105
RBF controller	0.03682	0.06465	1.15638

.

As shown in Table 1, the proposed method outperforms the NN and the RBF in terms of most metrics.

In order to verify the tracking performance of the system, $y_d=1+0.1\sin (t)$ was chosen as the desired signal, and the system outputs are illustrated in Figure 4.

Similarly, the results of the three indicators are shown in

Table 2. The tracking response comparison among three metrics obtained using different control methods.

Error Comparison	RMSE	MAE	MAPE
MTN	0.01997	0.04468	0.65589
BPNN controller	0.03958	0.10296	0.7236
RBF controller	0.02232	0.06112	0.69082

.

The latter figure presents the system output and the ideal tracking signal, highlighting that the system has a good tracking performance, i.e., the effectiveness of the proposed method is highlighted from the simulation results.

8. Discussion

This paper proposes an output feedback control method based on the MTN that is appropriate for non-linear strict systems so that the system output can automatically track the desired signal. The original strict-feedback system is first transformed in the proposed method, and the state variables are redefined to obtain the new standard form. A state observer is then designed to complete the identification process of the adaptive system under the good approximation characteristics of the MTN. Based on this, the adaptive control law is designed to complete the system tracking process. Numerical simulations on a servo-hydraulic system model as the control object verify the effectiveness of the suggested method.