1 Introduction

Over the last decades, adaptive backstepping control has attracted widespread attention due to its broad engineering applications, such as aircraft attitude systems [1], power systems [2] and so on. With the development of the Lyapunov stability theorem, the backstepping control technique and other tools, some remarkable results have been proposed (see, [3,4,5,6] and their references). It should be noticed that the control gains in considered nonlinear systems are assumed known in [7,8,9]. However, it is difficult for practical systems to satisfy this assumption [10]. In order to be more suitable for the practical situation in engineering applications, neural networks (NNs) or fuzzy logic systems (FLSs) are incorporated into the adaptive backstepping control technique. The authors in [11] and [12] utilized NNs or FLSs \(f_i({\bar{\chi }}_i|\varTheta _i)\) to approximate the unknown function \(f_i({\bar{\chi }}_i)\). And then, Wang et al. [13] developed a NN controller for uncertain nonlinear systems subject to unknown control directions and time delay. The authors in [14] developed an adaptive backstepping control method for nonlinear systems with time-varying delay. In [15], an adaptive NN backstepping controller was developed for nonlinear systems in presence of unmodeled dynamics. Combining NNs with the backstepping technique, Li and Yang [16] developed an adaptive control strategy for nonlinear systems subject to unknown dead-zone inputs.

However, an inherent shortcoming of backstepping control is the complexity problem, which is caused by the repeated differentiation of the virtual controller in the process of recursive design. Fortunately, the dynamic surface control (DSC) was proposed to deal with the complexity problem. The main idea of the DSC is to introduce a first-order filter in the traditional backstepping control procedures. Thus, the proposed DSC-based controller not only overcomes the explosion of differential terms, but also makes the controller simpler. By combining the DSC with the backstepping technique, some remarkable adaptive controllers have been proposed in [17,18,19,20].

It should be pointed out that the aforementioned literature can only guarantee the infinite-time stabilization. Theoretically, the control systems are regulated to the desired performance when the time variable goes to infinity. However, from the view of practical applications, the control objective is expected to be achieved in the finite-time, which has drawn extensive practical interest as well as theoretical significance. Therefore, the adaptive finite-time (AFT) control design has attracted considerable attention. For example, Li et al. [21] developed an AFT controller for nontriangular nonlinear systems, and it can ensure that the closed-loop system is semiglobally practical finite-time stability (SGPFS). Based on the event-triggering strategy, Wang et al. [22] solve the AFT control problem for nontriangular nonlinear systems. The authors in [23] developed an AFT tracking control scheme for the spacecraft system with state constraints. Based on introducing a new barrier power integrator, Zhang et al. [24] developed a novel AFT control scheme for switched systems, which can deal with the finite-time control problem for some types of tracking and stabilization issues. By employing the approximate ability of the RBF-NNs, an AFT control strategy for MIMO nonlinear systems with the actuator hysteresis has been developed in [25]. In [26], an AFT recursive terminal sliding mode controller was proposed for a linear motor positioner. Based on an integral terminal sliding mode, Shao et al. [27] developed an adaptive control method for high-order uncertain nonlinear systems.

Even though the above results regarding the control theory of nonlinear systems have made abundant progress. The results proposed in [21,22,23,24,25,26,27] do not consider the prescribed performance control problem. Apparently, with the development of society, tracking control is demanded to realize tracking error in a precise range. The prescribed performance control (PPC) technique is a useful method to realize this demand. The PPC was first proposed in [28], which can guarantee the transient performance of the considered systems, and the tracking error can enter into a given bounded set. Wang et al. [29] presented a prescribed tracking performance control method for n-link manipulator, and they solved the problem caused by input saturation. For uncertain MIMO nonlinear systems with input quantization, Bikas et al. [30] constructed an effective adaptive NN controller to ensure the tracking error can remain in a prescribed range.

In summary, although the above results have made great progress in adaptive tracking control, there are still some problems to be solved in this paper: (1) how to address the algebraic loop problem caused by the structure of the nonstrict-feedback systems, (2) how to overcome the complexity problem in the process of backstepping procedure, (3) how to ensure that the closed-loop system is SGPFS and the tracking error converge to a prescribed range, (4) how to estimate unmeasurable states and make all states are not transgressed the constrained space. Based on the above discussion, this paper focuses on the AFT control for nonstrict-feedback nonlinear systems subject to unmeasurable states and full-state constraints. The main work consists of the following aspects:

  1. (1)

    As more general nonlinear systems, nonstrict-feedback nonlinear systems proposed in this study can be used to control strict-feedback (or pure-feedback) nonlinear systems.

  2. (2)

    By utilizing a finite-time performance function (FTPF), the presented AFT prescribed performance control method can not only guarantee that the considered system is stable, but also make the tracking error enters into the predefined range in a known time. It can be seen that the adaptive PPC schemes in [31,32,33] can only ensure the tracking error remains in the predefined bounded set without giving a precise time.

  3. (3)

    By adopting the DSC, the computational explosion is avoided in the process of backstepping control. The \(\log\)-type BLF is introduced in the process of backstepping design, and it can guarantee that all states do not transgress the constrained space.

2 Problem formulation

2.1 System description

Consider the following nonlinear systems

$$\left\{ {\begin{array}{*{20}l} {\dot{\chi }_{i} (t) = \chi _{{i + 1}} (t) + f_{i} (\chi (t)),\,\,~i = 1,2, \ldots ,n - 1} \\ {\dot{\chi }_{n} (t) = u(t) + f_{n} (\chi (t)),} \\ {y(t) = \chi _{1} (t),} \\ \end{array} } \right.$$
(1)

where \(\chi (t) \in {\mathbb {R}}^n\) is the state variable, \(y(t)\in {\mathbb {R}}\) is the output, \(u(t)\in {\mathbb {R}}\) represents the input. \(f_i( \cdot )\) is the unknown nonlinear function.

Remark 1

It should be noticed that the controller developed in [34] does not consider the issue of the full state constraints. However, it has a solid engineering background, and the investigation of nonlinear systems subject to full-state constraints is much more challenging. Meanwhile, as we all know that the full-state constraints are widely exist in engineering systems, for example, power systems [2] and missile systems [35]. If one does not consider the problem of full-state constraints, stability and good performance cannot be obtained.

Remark 2

If \(f_i(\cdot )=f_i({\bar{\chi }}_i)\) (or \(f_i(\cdot )=f_i({\bar{\chi }}_i, \chi _{i+1})\)) with \({\bar{\chi }}_i=[\chi _1,\ldots ,\chi _i]^\mathrm {T}\), system (1) is a class of strict (or pure)-feedback nonlinear systems. However, the unknown nonlinear function \(f_i(\cdot )\) considered in this paper contains the whole state variables \(\chi _i=[\chi _1,\ldots ,\chi _n]^\mathrm {T}\). Thus, the nonlinear system (1) is a class of nonstrict-feedback systems. In the process of backstepping control, the considered systems are divided into n subsystems. The states variables \(\chi _i\) (or \(\chi _{i+1}\)) are viewed as state variables for the first ith subsystems in the strict-feedback (or pure-feedback) form. And then, the virtual control signal \(\alpha _i\) should be constructed to ensure the stability for the first ith subsystems. However, \(f_i(\cdot )\) contains the whole state variable in nonstrict-feedback systems, which means that \(\alpha _i\) also contains the whole state variables for the first ith subsystems. Then, the designed controller for nonstrict-feedback systems has more challenges, and the algebraic loop problem is generated.

In this paper, the designed adaptive tracking controller satisfies the following objectives:

  1. (1)

    the closed-loop system is SGPFS.

  2. (2)

    all the states do not transgress their constrained sets.

  3. (3)

    the output y(t) can track the desired signal \(y_d(t)\), that is to say, the tracking error \(y(t)-y_d(t)=\omega (t)\) can converge to a predefined range in finite-time.

Assumption 1

[36] The reference signal \(y_d(t)\) is a known bounded function. The time derivatives of \({\dot{y}}_d(t)\) and \(\ddot{y}_d(t)\) are known and bounded. \(A_0\), \(A_1\) and \(A_2\) such that \(|y_d|\le A_0\le k_{c1}\), \(|{\dot{y}}_d|\le A_1\) and \(|\ddot{y}_d|\le A_2\), \(\forall t>0\). And there exists a compact \(\varOmega _{y_d}=\{(y_d, {\dot{y}}_d, \ddot{y}_d)^\mathrm {T}: y_d^2+{\dot{y}}_d^2+\ddot{y}_d^2\le \delta _{y_d}\}\subset {\mathbb {R}}^3\) such that \((y_d, {\dot{y}}_d, \ddot{y}_d)^\mathrm {T}\in \varOmega _{y_d}\), where \(\delta _{y_d}\) is a positive constant.

Assumption 2

[37] For \(\forall \aleph _1, \aleph _2\), there exists a known constant \(l_i\), such that

$$\begin{aligned} \begin{aligned} |f_i(\aleph _1)-f_i(\aleph _2)|\le l_i|\aleph _1-\aleph _2|. \end{aligned} \end{aligned}$$

Lemma 1

[38] For \(\forall (\ell _1, \ell _2)\in {\mathbb {R}}^2\), the following inequality can be obtained

$$\begin{aligned} \begin{aligned} \ell _1\ell _2\le \frac{\hbar ^p}{p}|\ell _1|^p+\frac{1}{q\hbar ^q}|\ell _2|^q, \end{aligned} \end{aligned}$$

where \(\hbar >0\), \(p>1\), \(q>1\) and \(\frac{1}{p}+\frac{1}{q}=1\).

Remark 3

Assumption 1 implies only the reference signal without its high-order times derivatives. In addition, for a given nonlinear function, the locally Lipschitz condition is easily satisfied. Assumption 2 allows us to consider unknown functions. Similar assumptions can be found in [16,17,18]. Without these assumptions, the proposed control scheme cannot be realized.

2.2 Prescribed performance function

Definition 1

[39] Suppose that there exists a function \(\rho (t)\) satisfies the following properties:

  1. (1)

    \(\rho (t)>0\);

  2. (2)

    \({\dot{\rho }}(t)\le 0\);

  3. (3)

    \(\lim _{t\rightarrow T_r}\rho (t)=\rho _{T_r}\), and \(\rho _{T_r}\) is an arbitrary positive constant;

  4. (4)

    when \(t>T_r\), \(\rho (t)=\rho _{T_r}\) with \(T_r\) being a designed time.

Then, \(\rho (t)\) is a FTPF. It can be defined in this paper as

$$\ \left\{ {\begin{array}{*{20}l} {\rho (t) = (\rho _{0}^{l} - l\rm{\varrho }t)^{{\frac{1}{l}}} + \rho _{{T_{r} }} ,} & {0 \le t < T_{r} } \\ {\rho _{{T_{r} }} ,} & {t \ge T_{r} } \\ \end{array} } \right.$$
(2)

where l, \(\varrho\) and \(\rho _0\) are positive parameters, \(l=\frac{p}{q}\) with \(q\ge p\), q and p are positive odd and even integers. And \(\rho _0+\rho _{T_r}=\rho (0)\) denotes the initial value, \(T_r=\frac{\rho _0^l}{l\varrho }\) is the set time. And \(\rho (t)\) is a smooth function, which has been verified in [40].

In order to realize the \(\omega (t)\) enters into a prescribed range in a finite-time, the following error transformation function is defined

$$\psi (t) = \tan \left( {\frac{{\pi \omega (t)}}{{2\rho (t)}}} \right),~~\omega (0) < \rho (0).$$
(3)

According to (3), one can obtain

$$\begin{aligned} \begin{aligned} \omega (t)=\frac{2}{\pi }\rho (t)\arctan (\psi (t)). \end{aligned} \end{aligned}$$
(4)

From (4) and \(y(t)-y_d(t)=\omega (t)\), we have

$$\begin{aligned} \begin{aligned} {\dot{\omega }}(t)=\frac{2}{\pi }{\dot{\rho }}(t)\arctan (\psi (t))+\frac{2}{\pi }\rho (t)\frac{{\dot{\psi }}(t)}{1+\psi ^2(t)}, \end{aligned} \end{aligned}$$
(5)

which yields

$$\begin{aligned} \begin{aligned} {\dot{\psi }}(t)=\frac{\pi (1+\psi ^2(t))}{2\rho (t)}({\dot{\chi }}_1-{\dot{y}}_d-\frac{2}{\pi }{\dot{\rho }}(t)\arctan (\psi (t))). \end{aligned} \end{aligned}$$
Fig. 1
figure 1

The finite-time prescribed performance on the error

Figure 1 exhibits the bound of the \(\omega (t)\) under the FTPF. Thus, the proposed method can better satisfy the actual engineering application.

Remark 4

The main intention of using a state transition (3) is transform the tracking error \(\omega (t)\) into another state \(\psi (t)\). Then, we will design a controller to guarantee the boundedness for \(\psi (t)\) instead of directly control the tracking error \(\omega (t)\). From (3), we can see that the boundedness of \(\psi (t)\) stands that \(-\rho (t)<\omega (t)<\rho (t)\). Furthermore, \(\psi (t)\rightarrow 0\Rightarrow \omega (t)\rightarrow 0\). The readers can refer to [40] for more details about formula (5).

2.3 NNs approximation

RBF-NNs are utilized to approximate the nonlinear function. By [41], RBF-NNs can evaluate arbitrary continuous nonlinear function f(X) with the neural node number \(q>1\), and

$$\begin{aligned} \begin{aligned} f(X)=(\varGamma ^*)^\mathrm {T}\phi (X)+\zeta (X), |\zeta (X)|\le \zeta _M \end{aligned} \end{aligned}$$

where the approximation error \(\zeta (X)\) satisfies \(|\zeta (X)|\le \zeta _M\) with \(\zeta _M\) is an unknown constant, \(\phi (X)=[\phi _1(X),\dots , \phi _q(X)]^\mathrm {T}\) denotes the basis function vector, and \(\varGamma ^*\) denotes the ideal weight vector,

$$\begin{aligned} \begin{aligned} \varGamma ^*=\arg \min [\sup _{X\in \varOmega _0}|f(X)-\varGamma ^\mathrm {T}\phi (X)|] \end{aligned} \end{aligned}$$
(6)

with \(\varGamma =[\jmath _1,\dots ,\jmath _q]^\mathrm {T}\) being the weight vector. And \(\phi _i(X)\) is the Guassian function and it can be described as

$$\begin{aligned} \begin{aligned} \phi _i(X)=\exp \left(\frac{\Vert \ X-\wp _i\Vert ^2}{\tau _i^2}\right),~i=1, 2, \dots , q \end{aligned} \end{aligned}$$

where \(\wp _i=[\wp _{i1},\wp _{i2},\cdots ,\wp _{il}]^\mathrm {T}\) is the central vector of Gaussian function and \(\tau _i\) represents the breadth of Gaussian function.

Remark 5

It should be noticed that the basis function of RBF-NNs satisfies \(\phi _i^\mathrm {T}(X)\phi _i(X)\le \mathfrak {I}\), which will be greatly useful in controller design procedure.

According to the above NNs approximation results, it is known that \(f_i\big (\chi (t)\big )\) in system (1) is

$$\begin{aligned} \begin{aligned} f_i(\chi (t))={\hat{f}}_1(\chi (t)|\varGamma _1^*)+\zeta _1(\chi (t)), \end{aligned} \end{aligned}$$
(7)

where \({\hat{f}}_i(\chi (t)|\varGamma _1^*)=\varGamma _1^{*\mathrm {T}}\).

Further, according to (6) and (7), \(\varGamma _i^*\) is

$$\begin{aligned} \begin{aligned} \varGamma _i^*=\rm {arg}\min _{\varGamma _i\in \varOmega _i}[\sup _{{\hat{\chi }}\in U}\vert {\hat{f}}_i\big (\chi (t)\big )|\varGamma _i)-f_i\big (\chi (t)\big )|], \end{aligned} \end{aligned}$$
(8)

where \(\varOmega _i\) and U are the compact set of \(\varGamma _i\) and \(\chi (t)\), respectively.

By (7), system (1) is rewritten as

$$\begin{aligned} \left\{ \begin{aligned} {\dot{\chi }}_i(t)&=\chi _{i+1}(t)+\varGamma _i^{*\mathrm {T}}\phi _i({\hat{\chi }}(t))+\triangle f_i+\zeta _i(\chi (t)),\\ {}&~i=1,2,\dots ,n-1\\ {\dot{\chi }}_n(t)&=u(t)+\varGamma _n^{*\mathrm {T}}\phi _n({\hat{\chi }}(t))+\triangle f_n+\zeta _n(\chi (t)),\\ y(t)&=\chi _1(t),\\ \end{aligned} \right. \end{aligned}$$
(9)

where \({\hat{\chi }}(t)\) denotes the estimation value of \(\chi (t)\) and \(\triangle f_i=f_i\big (\chi (t)\big )-f_i\big ({\hat{\chi }}(t)\big )\).

2.4 Finite-time

Definition 2

[42] Consider a simple nonlinear system \({\dot{\eta }}=f(\eta , u)\), where \(\eta\) represents the state, and u is the input. The nonlinear system \({\dot{\eta }}=f(\eta , u)\) is SGPFS, if for every initial condition \(\eta (t_0)=\eta _0\in \varOmega _0\) with \(\varOmega _0\) is the compact set, there exists \(\jmath >0\) and a setting time \(T(\jmath , \eta _0)< \infty\) such that \(\Vert \eta (t)\Vert < \jmath\), for all \(t\ge t_0+T\).

Lemma 2

[43] For \((\varphi _1, \varphi _2)\in {\mathbb {R}}^2\), and there exists positive constants \(\epsilon _1\), \(\epsilon _2\) and \(\epsilon _3\), such that

$$\begin{aligned} \begin{aligned} |\varphi _1|^{\epsilon _1}|\varphi _2|^{\epsilon _2}\le \frac{\epsilon _1}{\epsilon _1+\epsilon _2}\epsilon _3|\varphi _1|^{\epsilon _1+\epsilon _2} +\frac{\epsilon _1}{\epsilon _1+\epsilon _2}\epsilon _3^{-\frac{\epsilon _1}{\epsilon _2}}|\varphi _2|^{\epsilon _1+\epsilon _2}. \end{aligned} \end{aligned}$$

Lemma 3

[44] Consider the nonlinear system \({\dot{\eta }}=f(\eta )\). If for all \(\eta _0\in \varOmega _0\), there exists a smooth function \(V(\eta )\) with constants \(c>0\), \(0<\sigma <1\), and \(\beta >0\), such that

$$\begin{aligned} \begin{aligned} {\dot{V}}(\eta )\le cV^\sigma (\eta )+\beta , ~~t\ge 0 \end{aligned} \end{aligned}$$

then \({\dot{\eta }}=f(\eta )\) is SGPFS.

Lemma 4

[45] For any \(\chi _r\in {\mathbb {R}}, (r=1,\dots , n\)) and \(0<p\le 1\), we have

$$\begin{aligned} \begin{aligned} \left(\sum _{r=1}^{n}|\chi _r|\right)^p\le \sum _{r=1}^{n}|\chi _r|^p\le n^{1-p}\left(\sum _{r=1}^{n}|\chi _r|\right)^p. \end{aligned} \end{aligned}$$

3 Main results

3.1 Observer design

Since only the output y(t) is measured, a NN state will be developed to obtain the unmeasurable states.

In order to design the state observer, we transform the nonlinear system (9) as the following matrix form

$$\begin{aligned} \left\{ \begin{aligned} {\dot{\chi }}(t)=&A\chi (t)+Ky(t)+\sum _{i=1}^{n} B_i\varGamma _i^{*\mathrm {T}}\phi _i({\hat{\chi }}(t))\\ {}&+B_n u(t)+\triangle f+\zeta ,\\ y(t)=&C\chi (t), \end{aligned} \right. \end{aligned}$$
(10)

where

$$\begin{aligned} A=\begin{aligned} \quad \begin{bmatrix} -k_1 &{} &{} &{} \\ -k_2 &{} &{} I_{n-1} &{} \\ \vdots &{} &{} &{} \\ -k_n &{} 0 &{} \ldots &{} 0 \\ \end{bmatrix} \end{aligned}, \end{aligned}$$

\(K=[k_1,\dots ,k_n]^\mathrm {T}\), \(B_i=[\underbrace{0,\dots ,1}_i,\dots ,0]^\mathrm {T}\), \(C=[\underbrace{1,0,\dots ,0}_n]\), \(\triangle f=[\triangle f_1,\cdots ,\triangle f_n]^\mathrm {T}\), \(\zeta =[\zeta _1\big ({\hat{\chi }}(t)\big ),\dots ,\zeta _n\big ({\hat{\chi }}(t)\big )]^\mathrm {T}\).

Vector K is chosen such that A is a Hurwitz matrix. And then, there exists a positive defined matrix \(W>0\), for any given matrix Q satisfies \(Q=Q^\mathrm {T}>0\) such that the following equality holds

$$\begin{aligned} \begin{aligned} A^\mathrm {T}W+WA=-Q. \end{aligned} \end{aligned}$$
(11)

An NN observer is established as

$$\mathop {\left\{ {\begin{array}{*{20}c} {\hat{\chi }(t){\mkern 1mu} {\mkern 1mu} = {\mkern 1mu} {\mkern 1mu} A\hat{\chi }(t) + Ky(t) + \sum\limits_{{i = 1}}^{n} {B_{i} } \Gamma _{i}^{{\text{T}}} \phi _{i} (\hat{\chi }(t)) + Bu(t),} \hfill \\ {\hat{y}(t) = C\hat{\chi }(t).} \hfill \\ \end{array} } \right.}\limits^{.}$$
(12)

Remark 6

Many works of literature require that all state variables are measured directly, for example, [46]. However, this requirement is almost impossible to achieve in practical engineering. Thus, we construct a state observer to estimate the unmeasurable states. Compared with [46], the system in this paper is more suitable for the actual systems.

According to (10) and (12), choose e(t) as

$$\begin{aligned} \begin{aligned} e(t)=\chi (t)-{\hat{\chi }}(t) \end{aligned} \end{aligned}$$
(13)

satisfies

$$\begin{aligned} \dot{e}(t) & = \,\,Ae(t) + \sum\limits_{{i = 1}}^{n} {B_{i} } \tilde{\Gamma }_{i} \phi _{i} (\hat{\chi }(t)) \\ &\quad + \zeta + Bu(t) + \vartriangle f, \\ \end{aligned}$$
(14)

where \({\tilde{\varGamma }}_i=\varGamma _i^*-\varGamma _i\), and \(\varGamma _i\) is the optimal parameter of \(\varGamma _i^*\).

Choose a Lyapunov function as

$$\begin{aligned} \begin{aligned} V_0(t)=e^\mathrm {T}(t)We(t). \end{aligned} \end{aligned}$$
(15)

And then, the derivative of \(V_0\) satisfies

$$\begin{aligned} \begin{aligned} {\dot{V}}_0\le&-q_0\Vert e\Vert ^2+\mathfrak {I}\Vert W\Vert ^2\sum _{i=1}^{n}{\tilde{\varGamma }}_i^\mathrm {T}{\tilde{\varGamma }}_i+M_0,\\ \end{aligned} \end{aligned}$$
(16)

where \(q_0=\lambda _{\min }(Q)-\left\| W\right\| ^2\sum _{i=1}^{n}l_i^2-3\), \(M_0=\left\| W\right\| ^2\Vert \zeta ^*\Vert ^2\). Specifically, the calculation process can be found in Appendix 1.

Remark 7

For unmeasured state variables, a linear observer was proposed in [47] as the following form:

$$\begin{aligned} \left\{ \begin{aligned} \dot{{\hat{\chi }}}_i&={\hat{\chi }}_{i+1}-k_i\big (\chi _1-{\hat{\chi }}_1\big ), 1\le i\le n-1\\ \dot{{\hat{\chi }}}_n&=u-k_n\big (\chi _1-{\hat{\chi }}_1\big ). \end{aligned} \right. \end{aligned}$$

where the observer gain parameter \(k_i\) is chosen such that the polynomial \(s(p)=p^n+k_1p^{n-1}+\cdots +k_{n-1}p+k_n\) is Hurwizts. It will lead to the developed observer independent of considered systems. However, observer (12) utilizes RBF-NNs \(\varGamma _i^\mathrm {T}\phi _i({\hat{\chi }}(t))\) to estimate the unknown nonlinear functions \(f_i(\chi _i(t))\), \((i=1,\dots , n)\). Via online estimation, a better estimation performance can be obtained.

Remark 8

In [13, 14], unmeasurable states make these methods no longer effective, and thus the NN state observer (12) is constructed. From (16), the convergence of the designed state observer cannot be ensured. It is thus necessary to develop a control scheme in the next section to guarantee the finite-time stability of the closed-loop system.

3.2 Backstepping control design

An AFT prescribed performance tracking controller is presented for considered nonstrict-feedback nonlinear systems in this subsection.

Choose the following coordinates change.

$$\begin{aligned} \left\{ \begin{aligned} z_1&=\psi ,\\ z_i&={\hat{\chi }}_i-\gamma _i,\\ \varsigma _i&=\gamma _i-\alpha _{i-1}, ~~i=2,\dots , n \end{aligned} \right. \end{aligned}$$
(17)

where \(\gamma _i\) represents the filter signal and \(\varsigma _i\) denotes the error surface.

Design the virtual control signal \(\alpha _1\) and the adaptive function \({\dot{\varGamma }}_1\) as

$$\begin{aligned} \left\{ \begin{aligned} \alpha _1=&-\frac{2\rho (k_{b_1}^2-z_1^2)^{1-\sigma }}{\pi (1+\psi ^2)}c_1z_1^{2\sigma -1} -\varGamma _1^\mathrm {T}\phi _1(\chi _1)\\ {}&-\frac{(3+\tau )\pi (1+\psi ^2)}{4\rho }z_1+\frac{2}{\pi }{\dot{\rho }}\arctan (\psi )+{\dot{y}}_d,\\ {\dot{\varGamma }}_1=\,\,&\delta _1\frac{\pi (1+\psi ^2)}{2\rho (k_{b_1}^2-z_1^2)}z_1\phi _1(\chi _1) -\mu _1\varGamma _1, \end{aligned} \right. \end{aligned}$$
(18)

where \(0<\sigma <1\), \(c_1>0\) and \(\mu _1>0\) are design parameters.

Choose the virtual controller \(\alpha _2\) and the adaptive law \({\dot{\varGamma }}_2\) as

$$\begin{aligned} \left\{ \begin{aligned} \alpha _2=&-\frac{c_2z_2^{2\sigma -1}}{(k_{b_2}^2-z_2^2)^{\sigma -1}}-k_2e_1 -\varGamma _2^\mathrm {T}\phi _2(\hat{{\bar{\chi }}}_2)+{\dot{\gamma }}_2\\ {}&-\frac{(\tau +2)z_2}{2(k_{b_i}^2-z_i^2)} -\frac{\pi (1+v^2)(k_{b_2}^2-z_2^2)}{k_{b_{i-1}}^2-z_{i-1}^2}z_{i-1},\\ {\dot{\varGamma }}_2=&\frac{\delta _2\phi _2(\hat{{\bar{\chi }}}_2)}{k_{b_2}^2-z_2^2}z_2-\mu _2 \varGamma _2, \end{aligned} \right. \end{aligned}$$
(19)

where \(c_2\) and \(\mu _2\) are positive designed parameters.

Choose the virtual controller \(\alpha _i\) and the adaptive function \({\dot{\varGamma }}_i\) as

$$\begin{aligned} \left\{ \begin{aligned} \alpha _i=&-\frac{c_iz_i^{2\sigma -1}}{(k_{b_i}^2-z_i^2)^{\sigma -1}}-k_ie_1 -\varGamma _i^\mathrm {T}\phi _i(\hat{{\bar{\chi }}}_i)\\ {}&-\frac{\tau +2}{2(k_{b_i}^2-z_i^2)}z_i-\frac{k_{b_i}^2-z_i^2}{k_{b_{i-1}}^2-z_{i-1}^2}z_{i-1} +{\dot{\gamma }}_i,\\ {\dot{\varGamma }}_i=&\frac{\delta _i\phi _i(\hat{{\bar{\chi }}}_i)}{k_{b_i}^2-z_i^2}z_i-\mu _i \varGamma _i, \end{aligned} \right. \end{aligned}$$
(20)

where \(c_i>0\), \(\mu _i>0\) are designed parameters.

Choose the control input u and the adaptive function \({\dot{\varGamma }}_n\) as

$$\begin{aligned} \left\{ \begin{aligned} u=&-\frac{c_nz_n^{2\sigma -1}}{(k_{b_n}^2-z_n^2)^{\sigma -1}}-k_ne_1 -\frac{z_n}{2(k_{b_n}^2-z_n^2)}\\ {}&-\frac{(k_{b_n}^2-z_n^2)z_{n-1}}{k_{b_{n-1}}^2-z_{n-1}^2} -\varGamma _n^\mathrm {T}\phi _n(\hat{{\bar{\chi }}})+{\dot{\gamma }}_n,\\ {\dot{\varGamma }}_n=&\frac{\delta _n\phi _n({\hat{\chi }})}{k_{b_n}^2-z_n^2}z_n-\mu _n\varGamma _n, \end{aligned} \right. \end{aligned}$$
(21)

where \(c_n>0\) and \(\mu _n>0\) are designed parameters.

The specific design process can be found in Appendix 2. Based on the above analysis, we summarize the main results in Theorem 1.

Theorem 1

Choose virtual controllers (18), (19) and (20), the actual control input (21), adaptive laws (18), (19), (20) and (21), the NN state observer (12) for system (1). Then, the developed controller can be guaranteed the closed-loop system is SGPFS under the full-state constraints.

Proof

By Appendix 2 and Lemma 1, one has

$$\begin{aligned}&\begin{aligned} \frac{\mu _i}{\delta _i} {\tilde{\varGamma }}_i^\mathrm {T}\varGamma _i =&\frac{\mu _i}{\delta _i}{\tilde{\varGamma }}_i^\mathrm {T}(\varGamma _i^*-{\tilde{\varGamma }}_i) \\ \le&-\frac{\mu _i}{\delta _i}{\tilde{\varGamma }}_i^\mathrm {T}{\tilde{\varGamma }}_i +\frac{\mu _i}{\delta _i}\varGamma _i^{*\mathrm {T}}\varGamma _i^*, \end{aligned} \end{aligned}$$
(22)
$$\begin{aligned}&\begin{aligned} \varsigma _iY_i(\cdot )\le \frac{1}{2\tau }\varsigma _i^2\vartheta _i^2+\frac{\tau }{2}. \end{aligned} \end{aligned}$$
(23)

From (22) and (13), one gets

$$\begin{aligned} \begin{aligned} {\dot{V}}_n\le&-\frac{q_1}{\lambda _{\max }(W)}e^\mathrm {T}We -\sum _{i=1}^{n}2^\sigma c_i(\frac{z_i^2}{2(k_{b_i}^2-z_i^2)})^\sigma \\&-((\mu _1-\mathfrak {I}\Vert W\Vert ^2\delta _1)\frac{1}{2\delta _1}{\tilde{\varGamma }}_1^\mathrm {T}{\tilde{\varGamma }}_1\\&+\sum _{i=2}^{n}(\mu _i-\mathfrak {I}\delta _i-\mathfrak {I}\Vert W\Vert ^2\delta _i)\frac{1}{2\delta _i}{\tilde{\varGamma }}_i^\mathrm {T}{\tilde{\varGamma }}_i)\\&+\sum _{i=2}^{n}(\frac{2}{\varpi _i}-\frac{\vartheta _i^2}{\tau }-1)\frac{1}{2}\varsigma _i^2+M, \end{aligned} \end{aligned}$$
(24)

where \(\lambda _{\max }(W)\) is the maximal eigenvalue of matrix W, and \(M=M_n+\sum _{i=1}^{n}\left(\frac{\mu _i}{2\delta _i}\right)\varGamma _i^{*\mathrm {T}}\varGamma _i^*+\frac{n-1}{2}\tau\).

Defining

$$\begin{aligned} \begin{aligned} C=\min&\Big \{ 2^\sigma c_1,\dots ,2^\sigma c_n, \mu _1-\mathfrak {I}\Vert W\Vert ^2\delta _1,\\&\mu _2-\mathfrak {I}\Vert W\Vert ^2\delta _2-\mathfrak {I}\delta _2, \dots , \\&\mu _n-\mathfrak {I}\Vert W\Vert ^2\delta _n-\mathfrak {I}\delta _n, \frac{2}{\varpi _2}-\frac{\vartheta _2^2}{\tau }-1, \\ {}&\dots , \frac{2}{\varpi _n}-\frac{\vartheta _n^2}{\tau }-1 \Big \} \end{aligned} \end{aligned}$$
(25)

and substituting (25) into (24), we can obtain

$$\begin{aligned} \begin{aligned} {\dot{V}}_n\le&-\frac{q_1}{\lambda _{\max }(W)}e^\mathrm {T}We -C\sum _{i=1}^{n}\left(\frac{z_i^2}{2\left(k_{b_i}^2-z_i^2\right)}\right)^\sigma \\&-\sum _{i=1}^{n}C\frac{1}{2\delta _i}{\tilde{\varGamma }}_i^\mathrm {T}{\tilde{\varGamma }}_i -C\sum _{i=2}^{n}\frac{1}{2}\varsigma _i^2+M. \end{aligned} \end{aligned}$$
(26)

According to Lemma 2, combining with \(q_1=1\), \(q_2=\sum _{i=2}^{n}\varsigma _i^2\), \(\varepsilon _1=1-\sigma\), \(\varepsilon _2=\sigma\), and \(\varepsilon _3=\sigma ^{\frac{\sigma }{1-\sigma }}\), we can obtain

$$\begin{aligned} \begin{aligned} \left(\sum _{i=2}^{n}\frac{1}{2}\varsigma _i^2\right)^\sigma \le \left(1-\sigma \right)\sigma ^{\frac{\sigma }{1-\sigma }}+\sum _{i=2}^{n}\frac{1}{2}\varsigma _i^2. \end{aligned} \end{aligned}$$
(27)

Similarly, one has

$$\begin{aligned}&\begin{aligned} \left(\sum _{i=1}^{n}\frac{1}{2\delta _i}{\tilde{\varGamma }}_i^\mathrm {T}{\tilde{\varGamma }}_i\right)^\sigma \le \left(1-\sigma \right)\sigma ^{\frac{\sigma }{1-\sigma }}+\sum _{i=1}^{n}\frac{1}{2\delta _i}{\tilde{\varGamma }}_i^\mathrm {T}{\tilde{\varGamma }}_i, \end{aligned} \end{aligned}$$
(28)
$$\begin{aligned}&\begin{aligned} \left(e^\mathrm {T}We\right)^\sigma \le \left(1-\sigma \right)\sigma ^{\frac{\sigma }{1-\sigma }} +e^\mathrm {T}We. \end{aligned} \end{aligned}$$
(29)

According to (27)-(29), it yields

$$\begin{aligned} \begin{aligned} {\dot{V}}_n\le&-\frac{q_1}{\lambda _{\max }(W)}\left(e^\mathrm {T}We\right)^\sigma -C\sum _{i=1}^{n}\left(\frac{z_i^2}{2\left(k_{b_i}^2-z_i^2\right)}\right)^\sigma \\&-C\left(\sum _{i=1}^{n}\frac{1}{2\delta _i}{\tilde{\varGamma }}_i^\mathrm {T}{\tilde{\varGamma }}_i\right)^\sigma -C\left(\sum _{i=2}^{n}\frac{1}{2}\varsigma _i^2\right)^\sigma +M\\ {}&+\left(2C+\frac{q_1}{\lambda _{\max }\left(W\right)}\right)\left(1-\sigma \right)\sigma ^{\frac{\sigma }{1-\sigma }}. \end{aligned} \end{aligned}$$
(30)

Defining

$$\begin{aligned} \begin{aligned} c=&\min \big \{ \frac{q_1}{\lambda _{\max }\left(W\right)}, C \big \},\\ \beta =&M+\left(2C+\frac{2q_1}{\lambda _{\max }\left(W\right)}\right)\left(1-\sigma \right)\sigma ^{\frac{\sigma }{1-\sigma }}, \end{aligned} \end{aligned}$$

and utilizing Lemma 4, we can obtain

$$\begin{aligned} \begin{aligned} {\dot{V}}_n\le -cV_n^\sigma +\beta . \end{aligned} \end{aligned}$$
(31)

According to (31), \(\forall 0<\imath <1\), one has

$$\begin{aligned} \begin{aligned} {\dot{V}}_n\left(\theta \right)\le -\imath cV_n^\sigma \left(\theta \right)-\left(1-\imath \right)cV_n^\sigma \left(\theta \right)+\beta , \end{aligned} \end{aligned}$$
(32)

where \(\theta =[z_1,\dots ,z_n, {\tilde{\varGamma }}_1,\dots ,{\tilde{\varGamma }}_n,\varsigma _2,\dots ,\varsigma _n]^\mathrm {T}\).

Let

$$\begin{aligned} \begin{aligned} \nu _\theta =&\left\{ \theta |V_n^\sigma \left(\theta \right)\le \frac{\beta }{\left(1-\imath \right)c} \right\} ,\\ {\bar{\nu }}_\theta =&\left\{ \theta |V_n^\sigma \left(\theta \right)>\frac{\beta }{\left(1-\imath \right)c} \right\} . \end{aligned} \end{aligned}$$

If \(\theta \in {\bar{\nu }}_\theta\), then one has

$$\begin{aligned} \begin{aligned} {\dot{V}}_n\left(\theta \right)\le -\imath cV_n^\sigma \left(\theta \right). \end{aligned} \end{aligned}$$
(33)

From (33), one has

$$\begin{aligned} \begin{aligned} \int _{0}^{T}\frac{{\dot{V}}_n\left(\theta \right)}{V_n^\sigma \left(\theta \right)}dt\le -\int _{0}^{T}\imath cdt. \end{aligned} \end{aligned}$$
(34)

According to (34), one has

$$\begin{aligned} \begin{aligned} \frac{1}{1-\sigma }V_n^{1-\sigma }\left(\theta \left(T\right)\right)-\frac{1}{1-\sigma }V_n^{1-\sigma }\left(\theta \left(0\right)\right)\le -\imath cT, \end{aligned} \end{aligned}$$
(35)

where \(\theta (0)\) is the initial value of \(\theta\).

Let

$$\begin{aligned} \begin{aligned} T^*=\frac{1}{\left(1-\sigma \right)\imath c}[V_n^{1-\sigma }\left(\theta \left(0\right)\right)-\left(\frac{\beta }{\left(1-\imath \right)c}\right)^\frac{1-\sigma }{\sigma }]. \end{aligned} \end{aligned}$$
(36)

It follows from (36) that \(\theta \in \nu _\theta\) for \(T\ge T^*\), the trajectory of \(\theta\) does not outstrip the set \(\nu _\theta\).

From (33) and (36), \({\dot{V}}_n\le 0\). Therefore, it can now be concluded form stability that the dynamic of the closed-loop system is SGPFS. On the other hand, by Lemma 4 in [48], it can be obtained that \(z_i\in \varOmega _{z_i}\), that is, \(|z_i|<k_{b_i}\). As mentioned in Remark 4, \(z_1=v(t)\) is transformed form \(\omega (t)=y(t)-y_d(t)\). Then, one can obtain \(|\chi _1|<|z_1|+|y_d|<k_{b_1}+A_0\). Choose \(k_{b_1}=k_{c_1}-A_0\). We can obtain \(|\chi _1|<k_{c_1}\). The state of \(\chi _1\) is constrained in \(\varOmega _{\chi _1}\). According to \(z_2={\hat{\chi }}_2-\gamma _2=\chi _2+e_2+\varsigma _2+\alpha _1\), \(|\chi _2|\le |z_2|+|e_2|+|\varsigma _2|+|\alpha _1|\) holds. Because \(\alpha _1\) is a smooth function of \(\chi _1\), \(z_1\), \(y_d\) and \({\dot{y}}_d\), \(|\chi _1|<k_{c_1}\), \(|z_1|<k_{b_1}\), \(y_d\le A_0\), and \(|{\dot{y}}_d|\le A_1\). Then there exists a constant \({\bar{\alpha }}_1>0\) makes \(|\alpha _1|\le {\bar{\alpha }}_1\). \(\forall t\ge T^*\), \(V_n^\sigma >\frac{\beta }{1-\iota c}\), one has \(|e_2|\le \Vert e\Vert \le s_2\) and \(|\varsigma _2|\le \Vert (\varsigma _2,\dots , \varsigma _n)\Vert \le \varLambda _2\), which means \(|\chi _2|\le k_{b_2}+s_2+\varLambda _2+{\bar{\alpha }}_1\). Let \(k_{b_2}=k_{c_2}-s_2-\varLambda _2-{\bar{\alpha }}_1\), \(|\chi _2|<k_{c_2}\) can be obtained, and \(\chi _2\) is constrained in the set \(\varOmega _{\chi _2}\). In this way, the state variable \(\chi _i\in \varOmega _{\chi _i}\) can be obtained. That is, the state systems do not violate constraint conditions. \(\square\)

Remark 9

For any positive constants \(\delta _{y_d}\) and \(\varPi\), the set \(\varOmega _{y_d}=\Big \{(y_d, {\dot{y}}_d, \ddot{y}_d)^\mathrm {T}: y_d^2+{\dot{y}}_d^2+\ddot{y}_d^2\le \delta _{y_d} \Big \}\in {\mathbb {R}}^3\) and \(\Omega _{i} = \left\{ {e^{{\text{T}}} We + \sum\limits_{{j = 1}}^{i} {\log } \left( {\frac{{k_{{b_{j} }}^{2} }}{{k_{{b_{j} }}^{2} - z_{j}^{2} }}} \right) + \sum\limits_{{j = 1}}^{i} {\frac{1}{{\delta _{j} }}} \widetilde{\Gamma }_{j}^{{\text{T}}} \widetilde{\Gamma }_{j} + \sum\limits_{{j = 1}}^{{i - 1}} {\varsigma _{{i + 1}}^{2} } \le 2\Pi } \right\} \in \mathbb{R}^{{3i}}\). Furthermore, \(\varOmega _{y_d}\times \varOmega _{i}\) is compact in \({\mathbb {R}}^{3+3i}\). Thus, \(Y_i(\cdot )\) has a maximum \(\vartheta _i>0\), such that \(|Y_i(\cdot )|\le \vartheta _i\).

Remark 10

It can be seen that the nonlinear function \(f_i (\chi )\) in the nonlinear system (1) contains the whole states. If the traditional backstepping control method for strict-feedback systems is adopted, the algebraic loop problem will be caused. To avoid this problem, the equation \(\begin{aligned} \phi _{i}^{{\text{T}}} \phi _{i} (\hat{\chi }) & = \phi _{i}^{{*{\text{T}}}} \phi _{i} (\hat{\chi }) - \widetilde{\phi }_{i}^{{\text{T}}} \phi _{i} (\hat{\chi }) - \phi _{i}^{{*{\text{T}}}} \phi _{i} (\widehat{{\bar{\chi }}}_{i} ) \\ & + \,\phi _{i}^{{\text{T}}} \phi _{i} (\widehat{{\bar{\chi }}}_{i} ) + \widetilde{\phi }_{i}^{{\text{T}}} \phi _{i} (\widehat{{\bar{\chi }}}_{i} ) \\ \end{aligned}\) is adopted in (72). By employing this equation, NNs concluding state variables \(\hat{{\bar{\chi }}}_i\) appear. Then, the property of RBF-NNs is utilized to design the controller.

Remark 11

According to the Lyapunov stability theorem, the above theorem presents a result on AFT prescribed performance control strategy. Obviously, the tracking error can converge to a prescribed range by designing reasonable FTPF. It theoretically ensures that the tracking error can converge to a prescribed range in the finite-time. In addition, it should be noticed that the BLF may generate the infinite control signal or even the actuator saturation, which has been discussed in [49].

Fig. 2
figure 2

Block diagram of the developed control strategy

Remark 12

The AFT control diagram is exhibited in Fig. 2. It can be seen that an observer (12) is designed for the considered nonlinear system (1), which can estimate the unmeasurable states. And then, utilizing the state estimation, we introduce the finite-time performance function \(\rho (t)\) and the reference signal \(y_d(t)\) into the backstepping design procedure to obtain the virtual controller, the adaptive law and the actual controller. We summarize the algorithm in this paper as follows

Step I: Choose the vector \(K=[k_1,k_2,\dots ,k_n]^\mathrm {T}\), such that A is the Hurwitz matrix. Furthermore, by solving equation (11), we can get the positive defined matrix W.

Step II: Select the initial conditions such that the initial tracking error is smaller than the initial value of FTPF.

Step III: Specify suitable designed parameters, such as \(c_1>0\), \(\delta _1>0\), \(\mu _1>0\) and \(\varpi _2>0\). And decide the virtual control signal \(\alpha _1\) and the parameter update law \({\dot{\varGamma }}_1\).

Step IV: Specify suitable designed parameters, such as \(c_i>0\) , \(\delta _i>0\), \(\mu _i>0\) and \(\varpi _i>0\). And decide the virtual control signal \(\alpha _i\) and the parameter update law \({\dot{\varGamma }}_i ~ (i=2, \dots , n-1)\).

Step V: Specify suitable designed parameters, such as \(c_n>0\), \(\tau >0\), \(\delta _n>0\), \(\mu _n>0\) and \(0<\sigma <1\). And decide the control input u and the parameter update law \({\dot{\varGamma }}_n\).

4 Simulation examples

In order to verify the reliability of the designed controller, a numerical example and a practical example are given.

Example 1

Choose a nonstrict-feedback nonlinear systems

$$\begin{aligned} \left\{ \begin{aligned} {\dot{\chi }}_1(t)&=\chi _2(t)+\sin \chi _1\chi _2^2,\\ {\dot{\chi }}_2(t)&= u+\left(1+\chi _1^2\right)\chi _2^2, \end{aligned} \right. \end{aligned}$$
(37)

where \(\chi _1\) and \(\chi _2\) represent the system state, u is the system input, and the boundary of constrained space is selected as \(k_{c_1}=1.5\) and \(k_{c_2}=1.65\). The ideal reference signal \(y_d=0.5\sin (t)\). In this example, Gaussian functions contain eleven nodes with centers \(b_i\) evenly in \([-5,5]\) and widths \(b_i=1\).

Define the FTPF \(\rho (t)\) as

$$\left\{ {\begin{array}{*{20}c} {\rho \left( t \right) = \left( {\rho _{0}^{l} - l\rm{\varrho }t} \right)^{{\frac{1}{l}}} + \rho _{{T_{r} }} ,} & {0 \le t \le T_{r} } \\ {\rho _{{T_{r} }} ,} & {~t \ge T_{r} } \\ \end{array} ~} \right.$$
(38)

with \(l=\frac{2}{13}\), \(\varrho =0.7\), \(\rho _0=0.6\) and \(\rho _{T_r}=0.025\). It should be noticed that the set time of finite-time performance function can be calculated as \(T_r=\frac{\rho _0^l}{l\varrho }=8.5839\) seconds.

Design \(\alpha _1\), u, \({\dot{\varGamma }}_1\) and \({\dot{\varGamma }}_2\) as

$$\begin{aligned}&\begin{aligned} \alpha _1=&-\frac{2\rho \left(k_{b_1}^2-z_1^2\right)^{1-\sigma }}{\pi \left(1+\psi ^2\right)}c_1z_1^{2\sigma -1} +{\dot{y}}_d-\varGamma _1^\mathrm {T}\phi _1\left(\chi _1\right)\\&-\frac{\left(3+\tau \right)\pi \left(1+\psi ^2\right)}{4\rho }z_1+\frac{2}{\pi }{\dot{\rho }}\arctan \left(v\right), \end{aligned} \end{aligned}$$
(39)
$$\begin{aligned}&\begin{aligned} u=&-\frac{c_2z_2^{2\sigma -1}}{\left(k_{b_2}^2-z_2^2\right)^{\sigma -1}}-k_2e_1+{\dot{\gamma }}_2 -\frac{z_2}{2\left(k_{b_2}^2-z_2^2\right)}\\ {}&-\frac{\left(k_{b_2}^2-z_2^2\right)z_1}{k_{b_1}^2-z_1^2} -\varGamma _2^\mathrm {T}\phi _2\left(\hat{{\bar{\chi }}}\right), \end{aligned} \end{aligned}$$
(40)
$$\begin{aligned}&\begin{aligned} {\dot{\varGamma }}_1=\frac{\delta _1\pi \left(1+\psi ^2\right)}{2\rho \left(k_{b_1}^2-z_1^2\right)}z_1\phi _1\left(\chi _1\right) -\mu _1\varGamma _1, \end{aligned} \end{aligned}$$
(41)
$$\begin{aligned}&\begin{aligned} {\dot{\varGamma }}_2=\frac{\delta _2\phi _2\left({\hat{\chi }}\right)}{k_{b_2}^2-z_2^2}z_2-\mu _2\varGamma _2. \end{aligned} \end{aligned}$$
(42)

Choose the NN state observer as

$$\begin{aligned} \left\{ \begin{aligned} {\hat{\chi }}_1&={\hat{\chi }}_2-k_1\left({\hat{\chi }}_1-\chi _1\right)+\varGamma _1^{*\mathrm {T}}\phi _1\left({\hat{\chi }}\right),\\ {\hat{\chi }}_2&=u-k_2\left({\hat{\chi }}_1-x_1\right)+\varGamma _2^{*\mathrm {T}}\phi _2\left({\hat{\chi }}\right). \end{aligned} \right. \end{aligned}$$
(43)
Fig. 3
figure 3

Trajectories of y and \(y_d\)

Fig. 4
figure 4

Trajectories of \(\chi _1\) and \({\hat{\chi }}_1\)

Fig. 5
figure 5

Trajectories of \(\chi _2\) and \({\hat{\chi }}_2\)

Fig. 6
figure 6

Trajectories of \(\omega\)

Fig. 7
figure 7

State trajectories remain in the constrained space

Fig. 8
figure 8

Trajectories of u

The parameters are selected as \(\epsilon =99/101\), \(\tau =1\), \(\delta _1=\delta _2=0.5\), \(\mu _1=\mu _2=0.5\), \(c_1=15\), \(c_2=18\), \(k_1=20\), \(k_2=50\). \([\chi _1(0), \chi _2(0)]=[0.3, 0]\), \([{\hat{\chi }}_1(0), {\hat{\chi }}_2(0)]=[0, 0]\), \(\varGamma _1(0)=\varGamma _2(0)=[0,0,0,0,0,0,0,0,0,0,0]^\mathrm {T}\).

To verify the effectiveness of the developed controller, figures (Figs. 3, 4, 5, 6, 7 and 8) have been displayed for this example. Figure 3 exhibits the tracking performance of the considered system. Figure 4 plots the system state \(\chi _1\) and the estimation \({\hat{\chi }}_1\). Figure 5 depicts the system state \(\chi _2\) and its estimation \({\hat{\chi }}_2\). Figure 6 shows the tracking error, and it can be seen the tracking error remains in the prescribed range. Figure 7 depicts the constrained space and states trajectories remain in the constrained space. The system input u is exhibited in Fig. 8. It should be noticed that the designed parameters, the initial conditions, the centers of the receptive and the width of Gaussian functions based on DSC in [11] are selected the same with the controller proposed in this paper. Form Figs. 5 and6, we can see that the trajectory of the tracking error \(\omega (t)\) based on DSC in [11] is out of the prescribed range and \(\chi _2\) based on DSC in [11] is out of constraint interval. Thus, the control scheme developed in this paper can ensure the full states and the tracking error do not violate constraint conditions and prescribed range, respectively.

Fig. 9
figure 9

Schematic of electromechanical system

Table 1 Parameters of the electromechanical system

Example 2

Based on the designed adaptive NN control scheme, the model of the electromechanical system exhibited in Fig. 9. Its dynamics can be modeled as the following form in [40]

$$\begin{aligned} \begin{aligned} M\ddot{q}+B{\dot{q}}+N\sin q+\varDelta _1\left({\dot{q}},q,I\right)=&I, \\ V_e-RI-K_B{\dot{q}}+\varDelta _2\left({\dot{q}},q,I\right)=&L{\dot{I}}, \end{aligned} \end{aligned}$$
(44)

where

$$\begin{aligned} \begin{aligned} M=&\frac{J}{K_\tau }+\frac{mL_0^2}{3K_\tau }+\frac{M_0L_0^2}{K_\tau }+\frac{2M_0R_0^2}{5K_\tau },\\ N=&\frac{mL_0g}{2K_\tau }+\frac{M_0L_0g}{K_\tau }, B=\frac{B_0}{K_\tau }, \end{aligned} \end{aligned}$$

and I represents the motor armature current, \(V_e\) is the input voltage, and q represents the angular motor position. To consider the influence of the model error on the real system, \(\varDelta _1\) and \(\varDelta _2\) denote the model error, respectively. The parameters of the electromechanical system are shown in Table 1.

Define \(\chi _1=q\), \(\chi _2={\dot{q}}\), \(\chi _3=I\) and \(u=V_e\). Equation (44) is transformed as

$$\begin{aligned} \left\{ \begin{aligned} {\dot{\chi }}_1\left(t\right)=&\chi _2\left(t\right),\\ {\dot{\chi }}_2\left(t\right)=&\frac{1}{M}\chi _3-\frac{B}{M}\chi _2-\frac{N}{M}\sin \chi _1+\frac{B}{M}\cos \chi _2\sin \chi _3,\\ {\dot{\chi }}_3\left(t\right)=&\frac{1}{L}u-\frac{K}{L}\chi _2-\frac{R}{L}\chi _3. \end{aligned} \right. \end{aligned}$$
(45)

In this example, we give \(y_d=0.5\sin (t)+\sin (0.5t)\). The Gaussian functions in this example contain nine nodes with center \(b_i\) evenly in \([-4,4]\) and widths \(b_i=1\). And the prescribed performance function keeps the same as Example 1. Furthermore, the design parameters are chosen as \(\epsilon =97/101\), \(\tau =1\), \(\delta _1=\delta _2=\delta _3=1\), \(c_1=8\), \(c_2=10\), \(c_3=12\), \(k_1=20\), \(k_2=40\), \(k_3=50\), \(l=\frac{2}{13}\), \(\varrho =0.7\), \(\rho _0=0.6\), \(\rho _{T_r}=0.05\) and \(T_r=8.5839\).

Meanwhile, the initial values are selected as \(\chi _1(0)=0.3\), \(\chi _2(0)=-1\), \(\chi _3(0)=-1\), \({\hat{\chi }}_1(0)=0.3\), \({\hat{\chi }}_2(0)=-1\), \({\hat{\chi }}_3(0)=0.3\), \(\varGamma _1(0)=\varGamma _2(0)=\varGamma _3(0)=[0.1,0.1,0.1,0.1,0.1,0.1,0.1,0.1,0.1]^\mathrm {T}\).

Figures 10, 11, 12, 13, 14 and 15 give the simulation results of the designed AFT control scheme. Figure 10 is described to show the tracking performance of the considered systems. The system state \(\chi _1\) and the estimation \({\hat{\chi }}_1\) are shown in Fig. 11. Figure 12 shows the system state \(\chi _2\) and its estimation \({\hat{\chi }}_2\). And the system state \(\chi _3\) and the estimation \({\hat{\chi }}_3\) are exhibited in Fig. 13. Figure 14 depicts the tracking performance, and we can see that the tracking error remains in the described range. The control input u is depicted in Fig. 15.

Fig. 10
figure 10

Trajectories of y and \(y_d\)

Fig. 11
figure 11

Trajectories of \(\chi _1\) and \({\hat{\chi }}_1\)

Fig. 12
figure 12

Trajectories of \(\chi _2\) and \({\hat{\chi }}_2\)

Fig. 13
figure 13

Trajectories of \(\chi _3\) and \({\hat{\chi }}_3\)

Fig. 14
figure 14

Trajectories of \(\omega\)

Fig. 15
figure 15

Trajectories of u

5 Conclusion

This article has investigated the AFT prescribed performance control for nonstrict-feedback nonlinear systems subject to unmeasurable states and full-state constraints. The unmeasurable states are estimated via designing an NN observer. Meanwhile, the BLF method has been introduced in the process of the backstepping design, and the constraint condition is satisfied. It has been proven that the developed NN control strategy can ensure that the controlled system is SGPFS and the tracking error can converge to a predefined interval. Moreover, the DSC technique is utilized to address the complexity problem. Therefore, it has enriched the adaptive NN control theories of the nonstrict-feedback nonlinear systems.