Towards non-linearly activated ZNN model for constrained manipulator trajectory tracking

As a powerful method for time-varying problems solving, the zeroing neural network (ZNN) is widely applied in many practical applications that can be modeled as time-varying linear matrix equations (TVLME). Generally, existing ZNN models solve these TVLME problems in the ideal no noise situation without inequality constraints, but the TVLME with noises and inequality constraints are rarely considered. Therefore, a non-linear activation function is designed, and based on the non-linear activation function, a non-linearly activated ZNN (NAZNN) model is proposed for solving constrained TVLME (CTVLME) problems. The convergence and robustness of the proposed NAZNN model are verified theoretically, and simulation results further demonstrate the effectiveness and superiority of the NAZNN model in dealing with CTVLME and the constrained robot manipulator trajectory tracking problems. In addition, the wheeled robot trajectory tracking fault problems with physical constraints are also analyzed theoretically, and the proposed NAZNN model is also applied to the manipulator trajectory tracking fault problem, and the experimental results prove that the NAZNN model also deal with the manipulator trajectory tracking fault problem effectively.

1 Introduction

With the acceleration of industrialization, manipulator has been widely used in industrial production. However, it is important to realize accurate control of robotic manipulators because as there are various disturbances and constraints in the production environment. In general, the behavioural control of a robot manipulator can be modelled as a TVLME problem [1–3]. When designing behavioural controllers for robot manipulators, there are necessary to consider robot dynamics [4,5], torque saturation [6] and obstacle avoidance [7,8] of the problem. For example, wheeled robots are non-linear systems and their controllers do not consider sliding, so it is difficult for these controllers to have good control when wheeled robots work with some complex environments, such as wet and icy, uneven surfaces. Moreover, the problems of dynamic coupling, dynamic limitations caused by the environments, and delay problems of the controller are also should be considered, and they complicate the control process of manipulator trajectory tracking. Therefore, researchers have proposed the PID control [9,10], feedback control [11], finite-time control [12–14], fuzzy control [15–18] and neural network control [19–25] to solve the above problems.

In recent years, with the continuous improvement and development of deep learning [26–30], neural networks [31–36] have become an efficient solution for various time-varying problems. For example, Jin et al. build the interference-tolerant fast convergence zeroing neural network (ITFCZNN) model [37] based on a new activation function, which exhibit excellent time-varying Robustness and convergence. One of the things that must be mentioned is that the activation function heavily influences the performance of the model. Therefore, the researchers have proposed a corresponding novel activation function in order to achieve the desired experimental results. For example [38], proposed zero-tuned neural networks (ZTNN) to solve the Stein matrix equation based on several new activation functions. In [39], it is proposed that the PSAF-based ZNN model is applied to the secondary programming problem. A ZNN model based on the activation function (HSAF) is designed in [40] to solve the time-varying square root of the matrix. In [41,42], it is proposed to apply the SBPAF-based ZNN model to solve the time-varying Sylvester equation. In [43,44], a ZNN model with adjustable convergence rate is designed based on the new activation function and applied to the control process of a robotic arm. However, most practical problems can be modelled as time-varying non-linear systems of equations with constraints. In contrast, the ZNN model described above only considers the unconstrained ideal environment and may not work as well as expected in practical applications, especially for the control of robot behaviour.

The physical constraints of industrial robots must be taken into account in the actual control process, otherwise specific tasks cannot be performed and even the hardware of the industrial robot is damaged. Considering the physical constraints of industrial robots are less studied. In [45], the motion process of an industrial robot is modelled as a multilayer time-varying problem in order to solve the problem of joint angle constraints in the control process [46]. proposed a physical limit constrained minimum velocity parametric coordination scheme to solve the constraints of a wheeled robot. In [47], the analytical solution of the robot controller is solved based on a parametric approach, which in turn yields the joint angle range of the industrial robot. However, the above methods only consider the angle overrun fault of the robotic manipulator, and they ignore other faults, such as speed overrun, noises, and the robotic manipulator does not stop in the case of angle overrun, which is possible in practical situations.

It is clear that the usage of neural networks to solve constrained manipulator trajectory tracking is still far from being investigated, and the potential of neural networks in this area remains to be exploited. Therefore, this paper develops the NAZNN for manipulator trajectory tracking with joint angle and joint velocity constraints in noisy environments.

The remainder of the paper is organized as follows. The modeling process and theoretical proof of the NAZNN model are analyzed in Section 2. Examples of the NAZNN model for solving CTVLME problems are presented in Section 3. Modeling of a wheeled robot is provided in Section 4, and simulation experiments of the NAZNN model for failure case of manipulator trajectory tracking with physical constraints are provided in Section 4. Finally, The conclusions of the paper are given in Section 5.

2 CTVLMA problem description and NAZNN model

2.1 The CTVLMA problem

In mathematics, a constrained time-varying linear matrix equation (CTVLMA) can be expressed as

$\left\{\begin{array}{c}\hfill \mathbf{A}\left(t\right)\mathbf{X}\left(t\right)=\mathbf{C}\left(t\right)\hfill \\ \hfill \mathbf{B}\left(t\right)\mathbf{X}\left(t\right)\le \mathbf{D}\left(t\right)\hfill \end{array}\right.(1)$

where A(t) ∈ R^m×n and B(t) ∈ R^p×n are smoothed full rank matrices, and m < n. C(t) ∈ R^m and D(t) ∈ R^p are smooth vectors. And X(t) ∈ Rⁿ is the unknown vector to be solved. The time-varying solution X(t) of A(t)X(t) = C(t) exists only if it satisfies the restriction B(t)X(t) ≤ D(t).

For CTVLMA (1), the following equation is obtained by introducing a non-negative variable v^.2 ∈ R^p.

$\left\{\begin{array}{c}\hfill \mathbf{A}\left(t\right)\mathbf{X}\left(t\right)=\mathbf{C}\left(t\right)\hfill \\ \hfill \mathbf{B}\left(t\right)\mathbf{X}\left(t\right)+v^{.2}\left(t\right)=\mathbf{D}\left(t\right)\hfill \end{array}\right.(2)$

Here v^.2(t) is also a unknown vector, and the superscript .2 denotes the square operation of each element of v(t) ∈ R^p. Defining the logarithmic matrix $\mathfrak{R}(t)=\mathit{diag}[v_1(t),v_2(t),\cdots v_p(t)]\in R^{p\times p}$ leads to $v^{.2}(t)=\mathfrak{R}(t)v(t)$. Thus, Equation 2 can be represented in a matrix form below.

$\left[\begin{array}{cc}\hfill \mathbf{A}\left(t\right)\hfill & \hfill 0\hfill \\ \hfill \mathbf{B}\left(t\right)\hfill & \hfill \mathfrak{R}\left(t\right)\hfill \end{array}\right]\left[\begin{array}{c}\hfill \mathbf{X}\left(t\right)\hfill \\ \hfill v\left(t\right)\hfill \end{array}\right]=\left[\begin{array}{c}\hfill \mathbf{C}\left(t\right)\hfill \\ \hfill \mathbf{D}\left(t\right)\hfill \end{array}\right](3)$

Then, we define $\mathbf{V}(t)=\left[\begin{array}{cc}\hfill \mathbf{A}(t)\hfill & \hfill 0\hfill \\ \hfill \mathbf{B}(t)\hfill & \hfill \mathfrak{R}(t)\hfill \end{array}\right]\in R^{(m+p)(n+p)}$, $\mathbf{w}(t)={\left[\begin{array}{cc}\hfill \mathbf{C}(t)\hfill & \hfill \mathbf{D}(t)\hfill \end{array}\right]}^T\in R^{m+p}$ and $\mathbf{u}(t)\in {[\mathbf{X}{(t)}^T,v{(t)}^T]}^T\in R^{n+p}$ where the upper label T denotes permutation.

Then, the following equation is obtained based on the above equivalent substitution.

$\mathbf{V}\left(t\right)\mathbf{u}\left(t\right)=\mathbf{w}\left(t\right)(4)$

Obviously, Eq. 4 is equivalent to Eq. 2, and solving CTVLMA (1) is transformed into solving the matrix-vector Equation 4.

2.2 NAZNN model for CTVLMA problem solving

In ordered to find the solution of Eq. 4, the NAZNN is designed according to the following steps.

Firstly, denote the following error function E(t).

$\mathbf{E}\left(t\right)=\mathbf{V}\left(t\right)\mathbf{u}\left(t\right)-\mathbf{w}\left(t\right)(5)$

Then, the time derivatives of E(t) are deduced below.

$\dot{\mathbf{E}}\left(t\right)=\lambda \mathbf{F}\left(\mathbf{E}\left(t\right)\right)(6)$

where λ > 0 is the convergence factor, and F(•) is an activation function. In order to construct our model for solving Eq. 4, the following theorem 1 is introduced in advance.

Lemma 1: The time derivatives of v^.2(t) can be written as

${\dot{v}}^{.2}\left(t\right)=\frac{d{v}^{.2}\left(t\right)}{dt}=2\mathfrak{R}\left(t\right)\dot{v}\left(t\right)(7)$

where $\dot{v}(t)$ is the time derivatives of v(t).

Proof: Let $\dot{\mathfrak{R}}(t)$ represent the temporal derivatives of $\mathfrak{R}(t)$, and we can obtain the following equation.

${\dot{v}}^{.2}\left(t\right)=\dot{\mathfrak{R}}\left(t\right)v\left(t\right)+\mathfrak{R}\left(t\right)\dot{v}\left(t\right)(8)$

Then,

$\begin{array}{c}\dot{\mathfrak{R}}\left(\mathrm{t}\right)\mathrm{v}\left(\mathrm{t}\right)=\left[\begin{array}{cccc}\hfill {\dot{v}}_1\left(t\right)\hfill & \hfill 0\hfill & \hfill \cdots \hfill & \hfill 0\hfill \\ \hfill ⋮\hfill & \hfill {\dot{v}}_2\left(t\right)\hfill & \hfill \cdots \hfill & \hfill 0\hfill \\ \hfill ⋮\hfill & \hfill ⋮\hfill & \hfill \ddots \hfill & \hfill ⋮\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill \cdots \hfill & \hfill {\dot{v}}_p\left(t\right)\hfill \end{array}\right]\left[\begin{array}{c}\hfill v_1\left(t\right)\hfill \\ \hfill v_2\left(t\right)\hfill \\ \hfill ⋮\hfill \\ \hfill v_p\left(t\right)\hfill \end{array}\right]\hfill \\ =\left[\begin{array}{cccc}\hfill v_1\left(t\right)\hfill & \hfill 0\hfill & \hfill \cdots \hfill & \hfill 0\hfill \\ \hfill ⋮\hfill & \hfill v_2\left(t\right)\hfill & \hfill \cdots \hfill & \hfill 0\hfill \\ \hfill ⋮\hfill & \hfill ⋮\hfill & \hfill \ddots \hfill & \hfill ⋮\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill \cdots \hfill & \hfill v_p\left(t\right)\hfill \end{array}\right]\left[\begin{array}{c}\hfill {\dot{v}}_1\left(t\right)\hfill \\ \hfill {\dot{v}}_2\left(t\right)\hfill \\ \hfill ⋮\hfill \\ \hfill {\dot{v}}_p\left(t\right)\hfill \end{array}\right]=\mathfrak{R}\left(t\right)\dot{v}\left(t\right)\hfill \end{array}(9)$

Then, Eq. 8 can be expressed in the following form.

$v^{.2}\left(t\right)=d{v}^{.2}\left(t\right)/dt=2\mathfrak{R}\left(t\right)\dot{v}\left(t\right)(10)$

The proof is completed.Based on Eq. 5, Eq. 6 and Lemma 1, the following NAZNN model is obtained.

$\begin{array}{cc}\left[\begin{array}{cc}\hfill \mathbf{A}\left(t\right)\hfill & \hfill 0\hfill \\ \hfill \mathbf{B}\left(t\right)\hfill & \hfill 2\mathfrak{R}\left(t\right)\hfill \end{array}\right]\left[\begin{array}{c}\hfill \dot{\mathbf{X}}\left(t\right)\hfill \\ \hfill \dot{v}\left(t\right)\hfill \end{array}\right]=-\left[\begin{array}{cc}\hfill \dot{\mathbf{A}}\left(t\right)\hfill & \hfill 0\hfill \\ \hfill \dot{\mathbf{B}}\left(t\right)\hfill & \hfill 0\hfill \end{array}\right]\left[\begin{array}{c}\hfill \mathbf{X}\left(t\right)\hfill \\ \hfill v\left(t\right)\hfill \end{array}\right]\hfill & \hfill +\left[\begin{array}{c}\dot{\mathbf{C}}\left(t\right)\hfill \\ \hfill \dot{\mathbf{D}}\left(t\right)\hfill \end{array}\right]-\lambda \left(\left[\begin{array}{cc}\hfill \mathbf{A}\left(t\right)\hfill & \hfill 0\hfill \\ \hfill \mathbf{B}\left(t\right)\hfill & \hfill \mathfrak{R}\left(t\right)\hfill \end{array}\right]\left[\begin{array}{c}\hfill \mathbf{X}\left(t\right)\hfill \\ \hfill v\left(t\right)\hfill \end{array}\right]-\left[\begin{array}{c}\hfill \mathbf{C}\left(t\right)\hfill \\ \hfill \mathbf{D}\left(t\right)\hfill \end{array}\right]\right)\end{array}(11)$

where $\dot{\mathbf{X}}(t)$, $\dot{\mathbf{A}}(t)$, $\dot{\mathbf{B}}(t)$, $\dot{\mathbf{C}}(t)$ and $\dot{\mathbf{D}}(t)$ are the time-derivatives of X(t), A(t), B(t), C(t) and D(t).Let us set $\mathbf{N}(t)=\left[\begin{array}{cc}\hfill \mathbf{A}(t)\hfill & \hfill 0\hfill \\ \hfill \mathbf{B}(t)\hfill & \hfill 2\mathfrak{R}(t)\hfill \end{array}\right]$, $\dot{\mathbf{N}}(t)=\left[\begin{array}{cc}\hfill \dot{\mathbf{A}}(t)\hfill & \hfill 0\hfill \\ \hfill \dot{\mathbf{B}}(t)\hfill & \hfill 0\hfill \end{array}\right]$, $\dot{\mathbf{u}}(t)={\left[\begin{array}{cc}\hfill \dot{\mathbf{X}}(t)\hfill & \hfill \dot{v(t)}\hfill \end{array}\right]}^T$, $\dot{\mathbf{M}}(t)={\left[\begin{array}{cc}\hfill \dot{\mathbf{C}}(t)\hfill & \hfill \dot{\mathbf{D}}(t)\hfill \end{array}\right]}^T$, and Eq. 11 can be transformed to the following simplified NAZNN (12).

$\mathbf{N}\left(\mathbf{t}\right)\dot{\mathbf{u}}\left(t\right)=-\dot{\mathbf{N}}\left(t\right)\mathbf{u}\left(t\right)+\dot{\mathbf{M}}\left(t\right)-\lambda \mathbf{F}\left(\mathbf{N}\left(t\right)\mathbf{u}\left(t\right)-\mathbf{M}\left(t\right)\right)(12)$

The NAZNN model with noise Y(t) can be expressed in the following form.

$\mathbf{N}\left(t\right)\dot{\mathbf{u}}\left(t\right)=-\dot{\mathbf{N}}\left(t\right)\mathbf{u}\left(t\right)+\dot{\mathbf{M}}\left(t\right)-\lambda \mathbf{F}\left(\mathbf{N}\left(t\right)\mathbf{u}\left(t\right)-\mathbf{M}\left(t\right)\right)+\mathbf{Y}\left(t\right)(13)$

where λ > 0 and F(•) are the same definitions above.Actually, the performances of the ZNN models are closely related with the activation functions F(•), and the existing activation functions are listed in Table 1. Additionally, f(•) denotes the element of F(•).In order to enhance the performances of the NAZNN (13), the following non-linear activation function (14) is designed.

$f\left(x\right)=\left[{\left(k_1{\left|x\right|}^p+k_2{\left|x\right|}^q\right)}^m+k_{3}x+k_4{e}^{{\left|x\right|}^z}{\left|x\right|}^{1|z}\right]\mathit{sgn}\left(x\right)(14)$

where m > 0, p > 0, q > 0, k₁ > 0, k₂ > 0, k₃ > 0, k₄ > 0, 0 < z < 1 and sgn(x) denotes the signum function.

TABLE 1

TABLE 1. Classical activation function and ZNN model.

2.3 Convergence and robustness analysis of the NAZNN model

2.3.1 Convergence analysis

The following Lemma 2 is provided in advance for the convergence analysis of the proposed NAZNN model.

Lemma 2: [48,49] Considering a non-linear dynamic system as follows.

$G=f\left(G\left(t\right),t\right)(15)$

where f(•) is a continuously non-linear function. Assumed that there is a continuous function L(b) satisfying both of the following conditions.

(1) L(b) is a radial unconstrained function intersecting with L(ξ) = 0.

(2) L ≤ −(pL^a(ξ(t))) + qL^b(ξ(t)))^l, where p > 0, q > 0, a > 0, b > 0, l > 0 and al > 1, bl < 1.

Then, the above dynamic system (15) is fixed time stable, and the upper bound of its stable time is T_max ≤ 1/(p^l(al − 1)) + 1/(q^l(1 − bl)).The following Theorem 1 and 2 guarantee the convergence and robustness of the proposed NAZNN model (12), respectively.

Theorem 1:. If the NAZNN model (12) is not polluted by noise, and Eq. 1 is smooth at all times. For any initial system state X(t), the state solution of model (12) converges to the theoretical solution of Eq. 1 at a predetermined time t_s.

$t_s=1/\left(\lambda {k_1}^m\left(pm-1\right)\right)+1/\left(\lambda {k_2}^m\left(1-qm\right)\right)(16)$

where k₁ > 0, k₂ > 0, λ > 0, q > 0, m > 0, mp > 1, qm < 1.

Proof: If the error function E(t) in Eq. 5 converges to 0, the neural state solution of NAZNN (12) will be equal to the theoretical solution of Eq. 1, and the evolutionary formulation (6) assures the convergence of the error function E(t). Furthermore, Eq. 6 consists of n² independent subsystems. Therefore, we only need to show these subsystems are stable at a fixed time.

${\dot{e}}_{ij}\left(t\right)=-\lambda \mathbf{F}\left(e_{ij}\left(t\right)\right);i,j\in \left\{\mathrm{1,2},\cdots n\right\}(17)$

where the scalars ${\dot{e}}_{ij}(t)$ and e_ij(t) mean the elements of the ith row and jth column of $\dot{\mathbf{E}}(t)$ and E(t) respectively. The flowing Lyapunov function is adopted for the convergence validation.

$h\left(t\right)=\left|e_{ij}\left(t\right)\right|(18)$

Derive for h(t):

$\dot{h}\left(t\right)={\dot{e}}_{ij}\mathit{sgn}\left({\dot{e}}_{ij}\left(t\right)\right)=-\lambda \mathbf{F}\left(e_{ij}\left(t\right)\right)\mathit{sgn}\left({\dot{e}}_{ij}\left(t\right)\right)(19)$

Then, substituting the non-linear activation function (14) into the above formula yields

$\begin{array}{cc}\dot{h}\left(t\right)=-\lambda \left[{\left(k_1{\left|e_{ij}\left(t\right)\right|}^p+k_2{\left|e_{ij}\left(t\right)\right|}^q\right)}^m\right.\hfill & +\left.k_3\exp \left({\left|e_{ij}\left(t\right)\right|}^z\right){\left|e_{ij}\left(t\right)\right|}^{1-z}\left(t\right)/z+k_4\right]\hfill \\ \le -\lambda {\left(k_1{\left|e_{ij}\left(t\right)\right|}^p+k_2{\left|e_{ij}\left(t\right)\right|}^q\right)}^m\hfill & =-{\left({\lambda }^{1/m}{k}_1{h}^p+{\lambda }^{1/q}{k}_2{h}^q\right)}^m\hfill \end{array}(20)$

Based on Lemma 2, the upper bound of convergence time t_ij for the subsystem in row i and column j of E(t) is obtained.

$t_s=\max \left(t_{ij}\right)\le 1/\left(\lambda {k_1}^m\left(mp-1\right)\right)+1/\left(\lambda {k_2}^m\left(1-qm\right)\right)(21)$

On basis of the above analysis, it can be drawn the conclusion that the state solution of the ZNN model (12) converges to the theory solutions of Eq. 1 in a predetermined time.

2.3.2 Robustness analysis

The robustness of NAZNN model (13) in noisy environment is discussed in this subsection. In order not to lose generality, the noise in Eq.13 is chosen to be Y(t) = 0.1exp(0.5t), and the following Theorem 2 guarantees the robustness of NAZNN model (13).

Theorem 2:. Assume the theoretical solution of Eq. 1 exists, and each element of Y(t) satisfies the conditions $\left|y_{ij}(t)\right|\le \delta \left|e_{ij}(t)\right|$ and 0 < δ < λk₃e/z. The NAZNN model (13) has the following fixed convergence time t_s with noise Y(t).

$t_s=1/\left(\lambda {k_1}^m\left(pm-1\right)\right)+1/\lambda {k_2}^m\left(1-qm\right)(22)$

Proof: Similar with the analysis of Theorem 1, Eq. 6 also contains n² mutually independent subsystems with noise Y(t).

${\dot{e}}_{ij}=-\lambda \mathbf{F}\left(e_{ij}\left(t\right)\right)+y_{ij}\left(t\right)(23)$

The following Lyapunov function is selected for the stable validation of E(t).

$h\left(t\right)={\left|e_{ij}\left(t\right)\right|}^2(24)$

The derived of h(t) is obtained below.

$\begin{array}{c}\dot{h}\left(t\right)=2e_{ij}\left(t\right){\dot{e}}_{ij}\left(t\right)=2e_{ij}\left(t\right)\left(-\lambda \mathbf{F}\left(e_{ij}\left(t\right)\right)+y_{ij}\left(t\right)\right)\hfill \\ =2e_{ij}\left(t\right)\left(-\lambda \right.{\left(k_1{\left|e_{ij}\left(t\right)\right|}^p+k_2{\left|e_{ij}\left(t\right)\right|}^q\right)}^m\hfill & +{\text{k}}_3\exp \left({\left|{\text{e}}_{\text{ij}}\left(\text{t}\right)\right|}^{\text{z}}\right){\left|{\text{e}}_{\text{ij}}\left(\text{t}\right)\right|}^{1-\text{z}}\left(\text{t}\right)/\text{z}\hfill \\ +k_4\dot{\mathrm{sgn}}\left(e_{ij}\left(t\right)\right)+y_{ij}\left(t\right)\hfill \end{array}(25)$

According to the conditions $\left|y_{ij}(t)\right|\le \delta \left|e_{ij}(t)\right|$, we can obtain the following inequalities.

$\begin{array}{c}\dot{h}\left(t\right)\le -2\lambda \left|e_{ij}\left(t\right)\right|\left({\left(k_1{\left|e_{ij}\left(t\right)\right|}^p+k_2{\left|e_{ij}\left(t\right)\right|}^q\right)}^m\right.\hfill \\ +2\delta {\left|e_{ij}\left(t\right)\right|}^2+2\lambda k_3/z\exp \left({\left|e_{ij}\left(t\right)\right|}^z\right){\left|e_{ij}\left(t\right)\right|}^{2-z}\left(t\right)/z\hfill \end{array}(26)$

In order to simplify the approach, setting up the following equation

$R\left(t\right)=2\delta {\left|e_{ij}\left(t\right)\right|}^2+2\lambda k_3/z\exp \left({\left|e_{ij}\left(t\right)\right|}^z\right){\left|e_{ij}\left(t\right)\right|}^{2-z}(27)$

Then,

$\begin{array}{c}R\left(t\right)=2\delta {\left|e_{ij}\left(t\right)\right|}^2+2\lambda k_3/z\exp \left({\left|e_{ij}\left(t\right)\right|}^z\right){\left|e_{ij}\left(t\right)\right|}^{2-z}\hfill \\ =2{\left|e_{ij}\left(t\right)\right|}^2\left[\delta -\lambda k_3\exp \left({\left|e_{ij}\left(t\right)\right|}^z\right)/\left(z{\left|e_{ij}\left(t\right)\right|}^z\right)\right]\hfill \end{array}(28)$

Let $u_1(t)=\delta -\lambda k_3\exp ({\left|e_{ij}(t)\right|}^z)/\left(z{\left|e_{ij}(t)\right|}^z\right)$, $f(t)=\lambda k_3\exp ({\left|e_{ij}(t)\right|}^z)/\left(z{\left|e_{ij}(t)\right|}^z\right)$ and $\varpi ={\left|e_{ij}(t)\right|}^z$, f(t) can be simplified to the following form.

$f\left(\varpi \right)=\lambda k_3{e}^{\varpi }/\left(z\varpi \right)(29)$

The derivative of (29) is provided in Eq. 30.

$\dot{f}\left(\varpi \right)=e^{\varpi }\left(\varpi -1\right)/{\varpi }^2(30)$

According to the above formula, it is clear that when 0 < ϖ < 1, the derivative of f(ϖ) is less than 0, and f(ϖ) decreases monotonically; when ϖ > 1, f(ϖ) > 0 and the derivative of f(ϖ) rises monotonically. Obviously, on basis of the above monotonic analysis, ϖ = 1 is equivalent to z being close to 0 and f(ϖ) achieving a minimum, which indicates f(t) reaches its minimum value.

$f{\left(t\right)}_{\min }=\lambda k_{3}e/z(31)$

Since δ ≤ λk₃e/z, δ is less than the minimum value of f(t), and u₁(t) is always less than 0. In summary, inequality (26) can be further simplified to the following form.

$\begin{array}{c}\dot{h}\left(t\right)\le -2\lambda \left|e_{ij}\left(t\right)\right|{\left(k_1{\left|e_{ij}\left(t\right)\right|}^p+k_2{\left|e_{ij}\left(t\right)\right|}^q\right)}^m+R\left(t\right)\hfill \\ \le -2\lambda \left|e_{ij}\left(t\right)\right|{\left(a_1{\left|e_{ij}\left(t\right)\right|}^p+k_2{\left|e_{ij}\left(t\right)\right|}^q\right)}^m\hfill \\ =-2\lambda {\left|e_{ij}\left(t\right)\right|}^{1/m}{\left(k_1{\left|e_{ij}\left(t\right)\right|}^p+k_2{\left|e_{ij}\left(t\right)\right|}^q\right)}^m\hfill \\ =-{\left[{\left(2\lambda \right)}^{1/m}\left(k_1{\left|e_{ij}\left(t\right)\right|}^{\left(p+1/m\right)}+k_2{\left|e_{ij}\left(t\right)\right|}^{\left(q+1/m\right)}\right)\right]}^m\hfill \\ =-\left[{\left(2\lambda \right)}^{1/m}(k_1{h}^{\left(1+pm\right)/2m}+{\left(2\lambda \right)}^{1/m}\left(k_2{h}^{\left(1+pm\right)/2m}\right)\right]m\hfill \end{array}(32)$

Then, based on Lemma 2, the convergence time of the ijth element of E(t) is obtained.

$\begin{array}{cc}{t}_{ij}\le 1/\left(2\lambda {k_1}^m\left(m\left(pm+1\right)/2m-1\right)\right)\hfill & +1/2\lambda {k_2}^m\left(1-m\left(m\left(pm+1\right)\right)\right)\hfill \\ =1/2\lambda {k_1}^m\left(\left(pm+1\right)/2-1\right)\hfill \\ +1/2\lambda {k_2}^m\left(1-\left(qm+1\right)/2\right)=1/\left(\lambda {k_1}^m\left(qm-1\right)\right)\hfill \\ +1/\left(\lambda {k_2}^m\left(1-qm\right)\right)\hfill \end{array}(33)$

The maximal convergence time t_s of the ZNN model (13) is

$t_s=\max \left(t_{ij}\right)\le 1/\left(\lambda {k_1}^m\left(pm-1\right)\right)+1/\left(\lambda {k_2}^m\left(1-qm\right)\right)(34)$

From the above analyses, we can draw the conclusion that the proposed NAZNN model has the fixed convergence time t_s in noiseless and noisy environments.

3 Numerical simulations for CTVLME solving

In this section, an illustrative example of the NAZNN model for solving CTVLME (1) is introduced to demonstrate its efficiency and accuracy.

Consider CTVLME (1) with the following coefficients.

$\left\{\begin{array}{c}\hfill \mathbf{A}\left(t\right)\mathbf{X}\left(t\right)=\mathbf{C}\left(t\right)\hfill \\ \hfill \mathbf{B}\left(t\right)\mathbf{X}\left(t\right)\le \mathbf{D}\left(t\right)\hfill \end{array}\right.(35)$

where $\mathbf{A}(t)=\left[\begin{array}{ccc}\hfill \sin (t)+2\hfill & \hfill \cos (t)+3\hfill & \hfill -\sin (t)+5\hfill \end{array}\right],\mathbf{B}(t)={\left[\begin{array}{cc}\hfill \sin (2t)\hfill & \hfill -\cos (3t)\hfill \\ \hfill \cos (3t)\hfill & \hfill \sin (3t)\hfill \\ \hfill -\sin (3t)\hfill & \hfill \cos (3t)\hfill \end{array}\right]}^T$, $\mathbf{C}(t)=\sin (2t)+\cos (2t),\mathbf{D}(t)=\left[\begin{array}{c}\hfill \sin (4t)\hfill \\ \hfill \cos (4t)\hfill \end{array}\right]$.

Here, we set all the parameters m, p, q, z, k₁, k₂, k₃, k₄ in the non-linear activation function (14) to 5, and the state solutions generated by the proposed NAZNN model are shown in Figure 1.

FIGURE 1

FIGURE 1. Neural state solution of the NAZNN model when m = 5 and λ = 1.

According to Figure 1, it can be observed that the black curves quickly coincide with the red curves, which indicate that the state solutions generated by the NAZNN model converge to the theoretical solutions of Eq. 1 in a very brief period of time.

In addition, the residual errors of the NAZNN model (12) and the IZNN model activated by LAF, PSAF, HSAF and SBPAF for solving the above same equation are compared in Figure 2. Figure 2A shows only the residual error of the NAZNN model (12) converges rapidly to 0, while the IZNN model activated by the activation functions converges slowly.

FIGURE 2

FIGURE 2. Comparative experiments of the ZNN models for solving Eq. 1. (A) is the residual errors of all the models, (B) is the residual errors of the NAZNN model with different parameter m, (C) is the residual errors of the NAZNN model with different parameter λ.

Furthermore, it can be observed that the convergence speed becomes faster as the value of m increases in Figure 2B. This phenomenon indicates that the time required for the NAZNN model (12) to solve inequality (1) becomes shorter as m increases. Finally, from Figure 2C, we can see that the convergence time of the NAZNN model becomes smaller as the convergence coefficient λ increases, which indicates that the convergence speed of the NAZNN model is also closely related to its convergence coefficient. Therefore, we can set these parameter values according to the accuracy requirements.

It is worth mentioning that the system environment in reality is complex and variable. Therefore, the NAZNN model (13) is used to solve inequality (1) with the different noises to highlight its robustness, and the simulation result are shown in Figure 3.

FIGURE 3

FIGURE 3. Neural state solution of NAZNN model and IZNN model for solving Eq.1 with different noises, (A) is add Y(t)=0.5, (B) is add Y(t)=0.5t, (C) is add Y(t)=cost, (D) is add exponential interference.

As can be seen from Figure 3A-D, even under various noise conditions, all the black curves still coincide exactly with the red dashed curves, while the other curves do not coincide quickly and accurately with the red dashed line. This indicates that only the transient solution of the NAZNN model quickly tracks the theoretical solution of inequality (1), while the transient solutions of other models cannot. Therefore, it can be concluded that the NAZNN model solves the time-varying linear Equation 1 perfectly in a predetermined time, and it has better convergence and greater robustness than the existing ZNN models. To further compare the errors of the NAZNN model (13) with the IZNN model for solving the inequality system (1) under different noise conditions, the residual errors of all the model are shown in Figure 4.

FIGURE 4

FIGURE 4. Residual errors of the NAZNN model and the IZNN models for solving Eq. 1 when disturbed by various noises. The noises considered in (A-D) are the same ones with (A-D).

As can be seen in Figure 4A-D, the residual errors of the NAZNN model (13) drops to 0 in a very short time in the presence of four noises. However, the residual errors of the IZNN model fluctuate greatly or converge very slowly, or even fail to converge to 0 due to noises.

4 Applications on wheeled robots

In this section, the NAZNN model is applied to solve the wheeled robot trajectory tracking problems [50,54].

4.1 The construction of NAZNN model for wheeled robot trajectory tracking with physical constrains

4.1.1 Modeling of the physical constrained manipulator

In this subsection, the modeling of a movable six-joint three-wheel manipulator is introduced and its 3D model is shown in Figure 5A.

FIGURE 5

FIGURE 5. Wheeled robot modeling process. (A) is 3D model, (B) is the model of mobile platform, (C) is Wheeled robot world coordinate system and axis coordinate system.

The equations of motion are analyzed according to the wheeled robot mobile device in Figure 5B, and the parameters are shown below.

W₀: the midpoint of the drive axis, expressed in the world coordinate system as (x₀, y₀, z₀).

W_s: the position of the manipulator, expressed in the world coordinate system (x_s, y_s, z_s).

d: distance from W₀ to W_s, d = 0.1m.

b: distance from the midpoint of the drive axis to the left and right drive wheels, b = 0.32m.

r: radius of each driving wheel, r = 0.1025m.

θ: The heading angle of the mobile device, expressed as the angle of the mobile device from the X-axis to the symmetry axis; its time derivative is the heading speed.

P: the mobile device rotates around the point P.

R: the distance of point P from the left driving wheel.

ω: the rotation speed of the mobile device around point P; and $\omega =\dot{\theta }$.

$\dot{{\beta }_1}$ and $\dot{{\beta }_r}$: rotation speed of the left and right wheels.

The next step is to establish robot model of the mobile device. Assume that each link of the wheeled robot is rigid and there is no relative sliding between the mobile device and the robot arm. Based on Figure 5B, the kinematic equations for the mobile device are established as follows, and the detailed derivation can be found in Supplementary Appendix S1A.

$\left\{\begin{array}{c}\hfill {\stackrel{•}{x}}_s=\left(\frac{r}{2}\cos \theta +\frac{dr}{2b}\sin \theta \right){\stackrel{•}{\mathit{\beta }}}_1+\left(\frac{r}{2}\cos \theta -\frac{dr}{2b}\sin \theta \right){\stackrel{•}{\mathit{\beta }}}_r\hfill \\ \hfill {\stackrel{•}{y}}_s=\left(\frac{r}{2}\sin \theta -\frac{dr}{2b}\cos \theta \right){\stackrel{•}{\mathit{\beta }}}_1+\left(\frac{r}{2}\sin \theta +\frac{dr}{2b}\cos \theta \right){\stackrel{•}{\mathit{\beta }}}_r\hfill \end{array}\right.(36)$

Rewrite Eq. 36 into matrix form

$\left[\begin{array}{c}\hfill {\stackrel{•}{x}}_s\hfill \\ \hfill {\stackrel{•}{y}}_s\hfill \end{array}\right]=\left[\begin{array}{cc}\hfill \cos \theta \hfill & \hfill -\sin \theta \hfill \\ \hfill \sin \theta \hfill & \hfill \cos \theta \hfill \end{array}\right]\left[\begin{array}{cc}\hfill \frac{r}{2}\hfill & \hfill \frac{r}{2}\hfill \\ \hfill -\frac{dr}{2b}\hfill & \hfill \frac{dr}{2b}\hfill \end{array}\right]\left[\begin{array}{c}\hfill {\stackrel{•}{\mathit{\beta }}}_1\hfill \\ \hfill {\stackrel{•}{\mathit{\beta }}}_r\hfill \end{array}\right](37)$

where ${\dot{x}}_s$ and ${\dot{y}}_s$ denote the x-axis velocity component and y-axis velocity of the point W_s, respectively. Figure 5A shows a 3D model of a wheeled robot. The origin of the moving platform coordinate system (x_s, y_s, z_s) is defined at the point w_s in Figure 5B, while x_s is the positive direction of the moving device. Let (x_s, y_s, z_s) indicates the reference points in the coordinate system of the moving platform, and for computational convenience we set z_s to 0. Similarly, the coordinate system of the ith joint of the six-joint robot is defined as (X_i, Y_i, Z_i), as shown in Figure 5C (i = 1, 2, … , 6). The articulation of each joint with the previous joint is defined as the origin of each joint’s coordinate system, and the direction along this joint is the Z-axis of this joint’s coordinate system, which conforms to the left-hand rule to find the X-axis and Y-axis. The coordinate system of the end-effector (X₆, Y₆, Z₆) position vector ${}^6\mathbf{W}_{\mathit{end}}$ belongs to R^m, and the homogeneity condition shows that ${}^6\mathbf{W}_{\mathit{end}}={[{{}^6\mathbf{W}_{\mathit{end}}}^T,1]}^T$ belongs to R^m+1. (The superscript T denotes the transpose of the vector.) Based on the platform coordinate system (x_s, y_s, z_s), we can represent the end-effector vector as follows.

${}^s\mathbf{W}_{\mathit{end}}={}_1{}^s\mathbf{T}_2^1{\mathbf{T}}_3^2{\mathbf{T}}_4^3{\mathbf{T}}_5^4{\mathbf{T}}_6^5{\mathbf{T}}^6{\mathbf{W}}_{\mathit{end}}(38)$

where ${}_1{}^s\mathbf{T}$, ${}_2{}^1\mathbf{T}$, ${}_3{}^2\mathbf{T}$, ${}_4{}^3\mathbf{T}$, ${}_5{}^4\mathbf{T}$, ${}_6{}^5\mathbf{T}$ denote the flush transformation matrices. The position coordinate vector of the end-effector in world coordinates can be expressed as

${\left[\begin{array}{cc}\hfill {\delta }_z\hfill & \hfill 1\hfill \end{array}\right]}^T={}_s{}^z\mathbf{T}^s{\mathbf{W}}_{\mathit{end}}(39)$

where δ_z ∈ Rⁿ indicates the position relative to the world coordinate system, and ${}_s{}^z\mathbf{T}=\left[\begin{array}{cccc}\hfill \cos \theta \hfill & \hfill -\sin \theta \hfill & \hfill 0\hfill & \hfill x_s\hfill \\ \hfill \sin \theta \hfill & \hfill \cos \theta \hfill & \hfill 0\hfill & \hfill y_s\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill & \hfill 0\hfill \\ \hfill 0\hfill & \hfill 0\hfill & \hfill 0\hfill & \hfill 1\hfill \end{array}\right]$.

According to the above analysis, the coordinates of the end-effector in the world coordinate system can be expressed as (x_z, y_z, z_z), and the kinematic relations of the end-effector can be obtained as follows:

${\delta }_z={\left[\begin{array}{ccc}\hfill x_z\hfill & \hfill y_z\hfill & \hfill z_z\hfill \end{array}\right]}^T={\left[\begin{array}{ccc}\hfill x_s\hfill & \hfill y_s\hfill & \hfill 0\hfill \end{array}\right]}^T+{\delta }_s(40)$

where δ_s is a three-dimensional vector, and the detailed expressions and calculation procedure for δ_s are shown in Supplementary Appendix S1B. Besides, Eq. 40 can be obtained by the time derivative of the speed level equation.

$\dot{{\delta }_z}={\left[\begin{array}{ccc}\hfill {\dot{x}}_z\hfill & \hfill {\dot{y}}_z\hfill & \hfill {\dot{z}}_z\hfill \end{array}\right]}^T={\left[\begin{array}{ccc}\hfill {\dot{x}}_s\hfill & \hfill {\dot{y}}_s\hfill & \hfill {\dot{z}}_s\hfill \end{array}\right]}^T+{\dot{\delta }}_s(41)$

It can be reformulated as:

${\dot{\delta }}_z={\mathbf{J}}_z\dot{\varphi }(42)$

where $\dot{\varphi }=[\dot{{\theta }_1},\dot{{\theta }_r},\dot{{\gamma }_1},\dot{{\gamma }_2},\dot{{\gamma }_3},\dot{{\gamma }_4},\dot{{\gamma }_5},\dot{{\gamma }_6}]$. In three-dimensional space, the position of the end-effector is calculated with n = 3 (n is the number of variables), and the position and direction of the end-effector is calculated with n = 6. To control the wheeled robot, we set n = 8 (including two rotation variables and six joint variables). $\dot{{\theta }_1}$ and $\dot{{\theta }_r}$ denote the rotational speed of the left and right drive wheels, and $\dot{{\gamma }_i}$ (i = 1, 2, … , 6) denotes the joint velocity vector of the robotic arm. The combined velocity vector $\dot{\varphi }$ is a derivation of the combined angular vector ϕ with respect to t. In addition, J_z ∈ R^m×n denotes a generalized Jacobi matrix and J_z ∈ R^m×n. The detailed expressions and derivations are given in Supplementary Appendix S1C. The physical constraints of the robot are shown in Table 2.

TABLE 2

TABLE 2. Physical constraints of the robotic arm.

Conventional control approaches have difficulty in handling trajectory tracking with constraints, and physical constraints are rarely considered before. However, almost all controllers have physical constraints (angular constraints, speed constraints, etc.). Therefore, it is very realistic and necessary to consider the failure problem of trajectory tracking of wheeled robots subject to constraints. The physical constraints of wheeled robot trajectory tracking considered in this work are listed below.

$\left\{\begin{array}{c}{\mathbf{J}}_z\dot{\varphi }={\dot{\delta }}_{zd}+v\left({\delta }_{zd}-{\delta }_z\right)\hfill \\ {\varphi }^{-}\le \varphi \le {\varphi }^{+}\hfill \\ {\dot{\varphi }}^{-}\le \varphi \le {\dot{\varphi }}^{+}\hfill \end{array}\right.(43)$

where v > 0 is the feedback gain, ${\dot{\delta }}_{zd}$ and δ_zd denote the position vector and velocity of the desired end position of the tracking path. ϕ⁻ and ϕ⁺ denote the lower and upper limits of the joint angle ϕ, ${\dot{\varphi }}^{-}$ and ${\dot{\varphi }}^{+}$ denote the lower and upper limits of the joint velocity $\dot{\varphi }$, respectively. For the range of motion of the wheeled robot, we theoretically set the upper and lower limits of ϕ₁ and ϕ₂ to converge to infinity.

To deal with the problem at the joint velocities level, the range of active wheel rotation angles of the wheeled robot and the range of robot joint angles are transformed into the corresponding velocities as follows.

$\eta \left({\varphi }^{-}-\varphi \right)\le \varphi \le \eta \left({\varphi }^{+}-\varphi \right)(44)$

where the coefficient η > 0 is used to calculate the range of joint velocities, and the coefficient has η special points. The value of η may lead to a sudden deceleration of the joint velocity when the wheeled robot approaches the joint limit, in numerical terms, $\eta \ge 2{\max }_{1\le i\le n}\{{\dot{{\varphi }_i}}^{+}/({{\varphi }_i}^{+}-{{\varphi }_i}^{-}),-{{\dot{\varphi }}_i}^{-}/({{\varphi }_i}^{+}-{{\varphi }_i}^{-})\}$. By calculating and setting the next simulation experiment in η = 4; the constraints of angle and velocity can be combined into constraint ${\psi }^{-}\le \dot{\varphi }\le {\psi }^{+}$, where the κ th element of ψ⁻ and ψ⁺ can be expressed as

$\left\{\begin{array}{c}\hfill {\psi }^{-}=\max \left\{{\varphi }_{\kappa }^{-}\eta \left({\varphi }^{-}-\varphi \right)\right\}\hfill \\ \hfill {\psi }^{+}=\min \left\{{\varphi }_{\kappa }^{+}\eta \left({\varphi }^{+}-\varphi \right)\right\}\hfill \end{array}\right.(45)$

In summary, the velocity control of wheeled robot trajectory tracking with physical constraints can be formulated as

$\left\{\begin{array}{c}\mathbf{J}\mathbf{q}=\dot{\delta },\hfill \\ {\psi }^{-}\le \mathbf{q}\le {\psi }^{+},\hfill \end{array}\right.(46)$

where q ∈ R^m denotes the combined velocity vector $\dot{\varphi }$, J = J_z, and the equation restriction represents the linear relationship between the velocities. Besides, $\dot{\delta }={\dot{\delta }}_{zd}+v({\delta }_{zd}-{\delta }_z)\in R^m$, where v > 0 is the feedback gain. ${\dot{\delta }}_{zd}$ and δ_zd denote the position vector and velocity at the desired end position of the tracking path. ψ denotes the range of active wheel rotation angles of the wheeled robot and the range of robot joint angles transformed into the corresponding velocities. ψ⁺ and ψ⁻ represent the upper and lower bounds of the transformed velocities, respectively. In order to keep the joint variables within the set range, they can be constrained with restriction conditions.

4.1.2 NAZNN model for trajectory tracking control of wheeled robots

Equation 46 with the above conditions can be transformed as

$\left\{\begin{array}{c}\hfill \mathbf{J}\mathbf{q}=\dot{\delta }\hfill \\ \hfill \mathbf{q}\le {\psi }^{+}\hfill \\ \hfill \mathbf{q}\ge {\psi }^{-}\hfill \end{array}\right.(47)$

Convert (47) to matrix form by referring to the CTVLMA calculation process.

$\left[\begin{array}{ccc}\hfill \mathbf{J}\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 1\hfill & \hfill {\mathbf{D}}_{\mathbf{1}}\left(t\right)\hfill & \hfill 0\hfill \\ \hfill 1\hfill & \hfill 0\hfill & \hfill -{\mathbf{E}}_{\mathbf{1}}\left(t\right)\hfill \end{array}\right]\left[\begin{array}{c}\hfill \mathbf{q}\hfill \\ \hfill \mathbf{y}\left(t\right)\hfill \\ \hfill \mathbf{o}\left(t\right)\hfill \end{array}\right]=\left[\begin{array}{c}\hfill \dot{\delta }\hfill \\ \hfill {\psi }^{+}\hfill \\ \hfill {\psi }^{-}\hfill \end{array}\right](48)$

D₁(t), E₁(t), y(t) and o(t) are process quantities generated by the calculation process with reference to CTVLMA. Let $\mathbf{M}(t)=\left[\begin{array}{ccc}\hfill J\hfill & \hfill 0\hfill & \hfill 0\hfill \\ \hfill 1\hfill & \hfill {\mathbf{D}}_{\mathbf{1}}(t)\hfill & \hfill 0\hfill \\ \hfill 1\hfill & \hfill 0\hfill & \hfill -{\mathbf{E}}_{\mathbf{1}}(t)\hfill \end{array}\right]\in R^{(m+p)\times (n+p)}$  and $\mathbf{N}(t)={\left[\begin{array}{c}\hfill \dot{\delta };{\psi }^{+};{\psi }^{-}\hfill \end{array}\right]}^T\in R^{(m+p)}$.

Then, define $\mathbf{u}(t)={[\begin{array}{ccc}\hfill \mathbf{q}\hfill & \hfill \mathbf{y}(t)\hfill & \hfill \mathbf{o}(t)\hfill \end{array}]}^T$, the following matrix vector form of (45) is obtained

$\mathbf{M}\left(t\right)\mathbf{u}\left(t\right)=\mathbf{N}\left(t\right)(49)$

The NAZNN model for trajectory tracking control of wheeled robots with physical constraints is obtained.

$\mathbf{M}\left(t\right)\dot{\mathbf{u}}\left(t\right)=-\dot{\mathbf{M}}\left(t\right)\mathbf{u}\left(t\right)+\dot{\mathbf{N}}\left(t\right)-\lambda \mathbf{F}\left(\mathbf{M}\left(t\right)\mathbf{u}\left(t\right)-\mathbf{N}\left(t\right)\right)(50)$

4.2 Simulation results on physically constrained wheeled robots

In this section, the above NAZNN model (50) and other related ZNN models are all used to solve the same wheeled robotic arm trajectory tracking problem with physical constraints for the purpose of comparison.

The initial heading angle of the wheeled robot is set to zero, and the motion direction of the wheeled robot is parallel to the x-axis of the world coordinate system, and its initial position is (x_s(0), y_s(0), z_s(0)) = (0, 0, 0). The initial state of the robot arm joint is [π/5; π/3; π/6; π/3; π/6; π/3]^T, and the rotation angle of the drive wheel set to β₁ = β_r = 0rad. In summary, the initial value of the combined angular vector is ϕ (0) = [0,0; π/5; π/3; π/6; π/3; π/6; π/3]^T.

4.2.1 NAZNN model simulation results

In this subsection, the proposed NAZNN model is applied to control the wheeled robot to perform trajectory tracking, and the corresponding simulation results are represented in Figure 6. As observed in Figure 6, the wheeled robot controlled by the NAZNN model completes the tracking task effectively.

FIGURE 6

FIGURE 6. NAZNN model-controlled wheeled robot trajectory and the end-effector trajectory. (A) is Robot operation trajectory, (B) is Robotic arm end-effector trajectory.

Additionally, the joint angle variation of the robot for spiral trajectory tracking is represented in Figure 7, and the joint velocity of the robot for the tracking process is represented in Figure 8.

FIGURE 7

FIGURE 7. The NAZNN model-controlled wheeled robots trajectory tracking with 6 joint angle changes.

FIGURE 8

FIGURE 8. The NAZNN model-controlled wheeled robot successfully finishes the trajectory tracking with 6 joint velocities change.

It can be observed in Figures 7, 8 that the joint angles and joint speeds of the NAZNN model-controlled wheeled robotic arm are within the physical limits until the end of the trajectory tracking, which indicates that the NAZNN model-controlled wheeled robotic arm successfully completes the tracking task.

4.2.2 IZNN models simulation results

In this subsection, the IZNN models controlled robots are also used for the same tracking task for the purpose of comparison, and the corresponding simulation results are represented in Figures 9–12.

FIGURE 9

FIGURE 9. (A) represent joint angle fault for IZNN-1, (B) represent joint speed fault for IZNN-2.

Figure 9 shows the difference between the IZNN-1 and IZNN-2 models. Both the IZNN-1 and IZNN-2 models are activated by the linear activation function. Because the parameter size has a great impact on the models, the actual experimental results are also different.

As observed in Figure 9, the IZNN-1 model controlled robot fails the tracking task due to robot joint angle $\dot{{\lambda }_1}$ exceeds limitation; besides, the IZNN-2 model controlled robot also fails the tracking task due to robot joint speed $\dot{{\lambda }_5}$ exceeds limitation. Figure 9A shows that joint angle 1 of the IZNN-1 model exceeds the upper limit at 3.6 s, and it lead to the trajectory tracking task fail; Figure 9B shows that joint velocity 5 of the IZNN-2 model falls below the lower limit at 3.6 s, and it lead to the trajectory tracking task pause.

The wheeled robot controlled by the IZNN-3 model for the same tracking task is presented in Figures 10–12. As observed in Figure 10, the wheeled robot controlled by the IZNN-3 model also fails the tracking task. Additionally, the joint angle variation of the robot controlled by the IZNN-3 model for spiral trajectory tracking is represented in Figure 11, and the joint velocity of the robot controlled by the IZNN-3 model for the tracking process is represented in Figure 12.

FIGURE 10

FIGURE 10. (A) represent IZNN-3 model-controlled wheeled robot's joint trajectory, (B) represent the end-effector trajectory.

FIGURE 11

FIGURE 11. The IZNN-3 model-controlled wheeled robot fails trajectory tracking with joint angles exceed limits.

FIGURE 12

FIGURE 12. The IZNN-3 model-controlled wheeled robot fails trajectory tracking with Joint velocities exceed limits.

As observed in Figure 10, Figures 11, 12, the tracking task is interrupted, with the joint speed $(\dot{{\lambda }_3})$ exceeds the physical limit (3 rad/s) and the joint angle (λ₃) exceeds the physical limit (exceeded the lower limit - π/6). Speed 3 $(\dot{{\lambda }_3})$ in Figure 10 exceeds the limit at 3.3 s and angle 3 (λ₃) in Figure 11 exceeds the limit at 3.3 s, which stop the tracking task. The above analysis indicates that the wheeled robotic arm controlled by the IZNN-3 model does not complete the tracking task due to exceediton of the joint speed and joint angle constrains.

In summary, the proposed NAZNN model has better control performances compared to other models for physically constrained wheeled robot trajectory tracking, and it completes the physically constrained trajectory tracking task smoothly and accurately without exceeding the joint angle and joint speed. The detailed comparative results of the models are presented in Table 3.

TABLE 3

TABLE 3. Comparisons of ZNN models for trajectory tracking results.

5 Conclusion

In this paper, a NAZNN model is proposed and effective applied to solve CTVLME problems. It is theoretically demonstrated that the NAZNN model can obtain the exact solutions of CTVLME problems. The validity and superiority of the NAZNN model is further verified by two numerical examples. Besides, the proposed NAZNN model is also applied to the failure problem of trajectory tracking of wheeled robots with physical constraints. Finally, the NAZNN model is used to control the wheeled robot to complete trajectory tracking under restricted conditions to prove the feasibility of this control method.

Data availability statement

The original contributions presented in the study are included in the article/Supplementary Material, further inquiries can be directed to the corresponding authors.

Author contributions

All authors listed have made a substantial, direct, and intellectual contribution to the work and approved it for publication.

Funding

This work was supported by the National Natural Science Foundation of China (62273141), Natural Science Foundation of Hunan Province (2020JJ4315), Scientific Research Fund of Hunan Provincial Education Department (20B216).

Conflict of interest

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Publisher’s note

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.

Supplementary material

The Supplementary Material for this article can be found online at: https://www.frontiersin.org/articles/10.3389/fphy.2023.1159212/full#supplementary-material

References

1. Katsikis VN, Mourtas SD, Stanimirović PS, Zhang Y. Solving complex-valued time-varying linear matrix equations via qr decomposition with applications to robotic motion tracking and on angle-of-arrival localization. IEEE Trans Neural Networks Learn Syst (2021) 33(8):3415–24. doi:10.1109/tnnls.2021.3052896

CrossRef Full Text | Google Scholar

2. Kayastha S, Katupitiya J, Pearce G, Rao A. Comparative study of post-impact motion control of a flexible arm space robot. Eur J Control (2022) 69:100738. doi:10.1016/j.ejcon.2022.100738

CrossRef Full Text | Google Scholar

3. Yang S, Zhang Y, Wen H, Jin D. Coordinated control of dual-arm robot on space structure for capturing space targets. Adv Space Res (2023) 71(5):2437–48. doi:10.1016/j.asr.2022.10.027

CrossRef Full Text | Google Scholar

4. Park FC, Kim B, Jang C, Hong J. Geometric algorithms for robot dynamics: A tutorial review. Appl Mech Rev (2018) 70. doi:10.1115/1.4039078

CrossRef Full Text | Google Scholar

5. Yang B, Yang W. Modular approach to kinematic reliability analysis of industrial robots. Reliab Eng Syst Saf (2023) 229:108841. doi:10.1016/j.ress.2022.108841

CrossRef Full Text | Google Scholar

6. Gyebrószki G, Csernák G, Milton JG, Insperger T. The effects of sensory quantization and control torque saturation on human balance control. Chaos: Interdiscip J Nonlinear Sci (2021) 31:033145. doi:10.1063/5.0028197

CrossRef Full Text | Google Scholar

7. Khan AT, Li S, Li Z. Obstacle avoidance and model-free tracking control for home automation using bio-inspired approach. Adv Control Appl Eng Ind Syst (2022) 4(1):e63. doi:10.1002/adc2.63

CrossRef Full Text | Google Scholar

8. Li ZF, Li JT, Li XF, Yang YJ, Xiao J, Xu BW. Intelligent tracking obstacle avoidance wheel robot based on arduino. Proced Comput Sci (2020) 166:274–8. doi:10.1016/j.procs.2020.02.100

CrossRef Full Text | Google Scholar

9. Liu D, Wang J, Lei T, Wang S. Active suspension control with consensus strategy for dynamic posture tracking of wheel-legged robotic systems on uneven surfaces. ISA Trans (2022) 131:628–38. doi:10.1016/j.isatra.2022.05.021

PubMed Abstract | CrossRef Full Text | Google Scholar

10. Carlucho I, De Paula M, Acosta GG. An adaptive deep reinforcement learning approach for mimo pid control of mobile robots. ISA Trans (2020) 102:280–94. doi:10.1016/j.isatra.2020.02.017

PubMed Abstract | CrossRef Full Text | Google Scholar

11. Singhal K, Kumar V, Rana K. Robust trajectory tracking control of non-holonomic wheeled mobile robots using an adaptive fractional order parallel fuzzy pid controller. J Franklin Inst (2022) 359(9):4160–215. doi:10.1016/j.jfranklin.2022.03.043

CrossRef Full Text | Google Scholar

12. Li Y, Li Y-X, Tong S. Event-based finite-time control for nonlinear multi-agent systems with asymptotic tracking. IEEE Trans Autom Control (2022) 1–8. doi:10.1109/tac.2022.3197562

CrossRef Full Text | Google Scholar

13. Rosas-Vilchis A, de Loza AF, Aguilar LT, Cieslak J, Henry D, Montiel-Ross O. Trajectory tracking control for an autonomo vehicle using a decoupling approach. In: 2020 28th Mediterranean Conference on Control and Automation (MED). IEEE (2020). p. 375–80.

CrossRef Full Text | Google Scholar

14. Lu Q, Chen J, Wang Q, Zhang D, Sun M, Su C-Y. Practical fixed-time trajectory tracking control of constrained wheeled mobile robots with kinematic disturbances. ISA Trans (2022) 129:273–86. doi:10.1016/j.isatra.2021.12.039

PubMed Abstract | CrossRef Full Text | Google Scholar

15. Yu F, Shen H, Liu L, Zhang Z, Huang Y, He B, et al. Ccii and fpga realization: A multistable modified fourth-order autonomous chua’s chaotic system with coexisting multiple attractors. Complexity (2020) 2020:1–17. doi:10.1155/2020/5212601

CrossRef Full Text | Google Scholar

16. Pan Y, Wu Y, Lam H-K. Security-based fuzzy control for nonlinear networked control systems with dos attacks via a resilient event-triggered scheme. IEEE Trans Fuzzy Syst (2022) 30(10):4359–68. doi:10.1109/tfuzz.2022.3148875

CrossRef Full Text | Google Scholar

17. Dai J, Chen Y, Xiao L, Jia L, He Y. Design and analysis of a hybrid gnn-znn model with a fuzzy adaptive factor for matrix inversion. IEEE Trans Ind Inform (2021) 18(4):2434–42. doi:10.1109/tii.2021.3093115

CrossRef Full Text | Google Scholar

18. Katsikis VN, Stanimirović PS, Mourtas SD, Xiao L, Karabašević D, Stanujkić D. Zeroing neural network with fuzzy parameter for computing pseudoinverse of arbitrary matrix. IEEE Trans Fuzzy Syst (2021) 30(9):3426–35. doi:10.1109/tfuzz.2021.3115969

CrossRef Full Text | Google Scholar

19. Kong Y, Chen S, Jiang Y, Wang H, Chen H. Zeroing neural network with fuzzy parameter for cooperative manner of multiple redundant manipulators. Expert Syst Appl (2023) 212:118735. doi:10.1016/j.eswa.2022.118735

CrossRef Full Text | Google Scholar

20. Gong J, Jin J. A better robustness and fast convergence zeroing neural network for solving dynamic nonlinear equations. Neural Comput Appl (2021) 35:77–87. doi:10.1007/s00521-020-05617-9

CrossRef Full Text | Google Scholar

21. Xiao L, Liu S, Wang X, He Y, Jia L, Xu Y. Zeroing neural networks for dynamic quaternion-valued matrix inversion. IEEE Trans Ind Inform (2021) 18(3):1562–71. doi:10.1109/tii.2021.3090063

CrossRef Full Text | Google Scholar

22. Yu F, Yu Q, Chen H, Kong X, Mokbel AAM, Cai S, et al. Dynamic analysis and audio encryption application in iot of a multi-scroll fractional-order memristive hopfield neural network. Fractal and Fractional (2022) 6(7):370. doi:10.3390/fractalfract6070370

CrossRef Full Text | Google Scholar

23. Barajas CA, Gobbert M, Polf JC. (2021). Deep residual fully connected neural network classification of compton camera based prompt gamma imaging for proton radiotherapy. UMBC Student Collection.

Google Scholar

24. Jin J, Zhao L, Chen L, Chen W. A robust zeroing neural network and its applications to dynamic complex matrix equation solving and robotic manipulator trajectory tracking. Front Neurorobotics (2022) 16:1065256. doi:10.3389/fnbot.2022.1065256

PubMed Abstract | CrossRef Full Text | Google Scholar

25. Jin J, Zhu J, Zhao L, Chen L. A fixed-time convergent and noise-tolerant zeroing neural network for online solution of time-varying matrix inversion. Appl Soft Comput (2022) 130:109691. doi:10.1016/j.asoc.2022.109691

CrossRef Full Text | Google Scholar

26. He B, Dai C, Lang J, Bing P, Tian G, Wang B, et al. A machine learning framework to trace tumor tissue-of-origin of 13 types of cancer based on dna somatic mutation. Biochim Biophys Acta (BBA)-Molecular Basis Dis (2020) 1866(11):165916. doi:10.1016/j.bbadis.2020.165916

PubMed Abstract | CrossRef Full Text | Google Scholar

27. He B, Zhang Y, Zhou Z, Wang B, Liang Y, Lang J, et al. A neural network framework for predicting the tissue-of-origin of 15 common cancer types based on rna-seq data. Front Bioeng Biotechnol (2020) 8:737. doi:10.3389/fbioe.2020.00737

PubMed Abstract | CrossRef Full Text | Google Scholar

28. Jin J, Gong J. A noise-tolerant fast convergence znn for dynamic matrix inversion. Int J Comput Math (2021) 98(11):2202–19. doi:10.1080/00207160.2021.1881498

CrossRef Full Text | Google Scholar

29. Jin J, Xiao L, Lu M, Li J. Design and analysis of two ftrnn models with application to time-varying sylvester equation. IEEE Access (2019) 7:58945–50. doi:10.1109/access.2019.2911130

CrossRef Full Text | Google Scholar

30. Ma M, Xiong K, Li Z, Sun Y. Dynamic behavior analysis and synchronization of memristor-coupled heterogeneous discrete neural networks. Mathematics (2023) 11(2):375. doi:10.3390/math11020375

CrossRef Full Text | Google Scholar

31. Jin J, Chen W, Chen C, Chen L, Tang Z, Chen L, et al. A predefined fixed-time convergence znn and its applications to time-varying quadratic programming solving and dual-arm manipulator cooperative trajectory tracking. IEEE Trans Ind Inform (2022) 1–12. doi:10.1109/tii.2022.3220873

CrossRef Full Text | Google Scholar

32. Jin J, Chen W, Zhao L, Chen L, Tang Z. A nonlinear zeroing neural network and its applications on time-varying linear matrix equations solving, electronic circuit currents computing and robotic manipulator trajectory tracking. Comput Appl Math (2022) 41(7):319. doi:10.1007/s40314-022-02031-w

CrossRef Full Text | Google Scholar

33. Jin J, Qiu L. A robust fast convergence zeroing neural network and its applications to dynamic sylvester equation solving and robot trajectory tracking. J Franklin Inst (2022) 359(7):3183–209. doi:10.1016/j.jfranklin.2022.02.022

CrossRef Full Text | Google Scholar

34. Ma M, Lu Y, Li Z, Sun Y, Wang C. Multistability and phase synchronization of rulkov neurons coupled with a locally active discrete memristor. Fractal Fractional (2023) 7(1):82. doi:10.3390/fractalfract7010082

CrossRef Full Text | Google Scholar

35. Jin J, Chen W, Qiu L, Zhu J, Liu H. A noise tolerant parameter-variable zeroing neural network and its applications. Math Comput Simul (2023) 207:482–98. doi:10.1016/j.matcom.2023.01.012

CrossRef Full Text | Google Scholar

36. Jin J, Zhu J, Zhao L, Chen L, Chen L, Gong J. A robust predefined-time convergence zeroing neural network for dynamic matrix inversion. IEEE Trans Cybernetics (2022) 1–14. doi:10.1109/tcyb.2022.3179312

CrossRef Full Text | Google Scholar

37. Jin J, Gong J. An interference-tolerant fast convergence zeroing neural network for dynamic matrix inversion and its application to mobile manipulator path tracking. Alexandria Eng J (2021) 60(1):659–69. doi:10.1016/j.aej.2020.09.059

CrossRef Full Text | Google Scholar

38. Hu Z, Xiao L, Dai J, Xu Y, Zuo Q, Liu C. A unified predefined-time convergent and robust znn model for constrained quadratic programming. IEEE Trans Ind Inform (2020) 17(3):1998–2010. doi:10.1109/tii.2020.2996215

CrossRef Full Text | Google Scholar

39. Luo J, Yang H, Yuan L, Chen H, Wang X. Hyperbolic tangent variant-parameter robust znn schemes for solving time-varying control equations and tracking of mobile robot. Neurocomputing (2022) 510:218–32. doi:10.1016/j.neucom.2022.08.066

CrossRef Full Text | Google Scholar

40. Yang Y, Zhang Y. Superior robustness of power-sum activation functions in zhang neural networks for time-varying quadratic programs perturbed with large implementation errors. Neural Comput Appl (2013) 22(1):175–85. doi:10.1007/s00521-011-0692-5

CrossRef Full Text | Google Scholar

41. Li S, Chen S, Liu B. Accelerating a recurrent neural network to finite-time convergence for solving time-varying sylvester equation by using a sign-bi-power activation function. Neural Process Lett (2013) 37(2):189–205. doi:10.1007/s11063-012-9241-1

CrossRef Full Text | Google Scholar

42. Xiao L. Accelerating a recurrent neural network to finite-time convergence using a new design formula and its application to time-varying matrix square root. J Franklin Inst (2017) 354(13):5667–77. doi:10.1016/j.jfranklin.2017.06.012

CrossRef Full Text | Google Scholar

43. Zhu J, Jin J, Chen W, Gong J. A combined power activation function based convergent factor-variable znn model for solving dynamic matrix inversion. Math Comput Simul (2022) 197:291–307. doi:10.1016/j.matcom.2022.02.019

CrossRef Full Text | Google Scholar

44. Xiao L, He Y, Liao B. A parameter-changing zeroing neural network for solving linear equations with superior fixed-time convergence. Expert Syst Appl (2022) 208:118086. doi:10.1016/j.eswa.2022.118086

CrossRef Full Text | Google Scholar

45. Li J, Zhu X, Shi Y, Wang J, Guo H. Real-time robot manipulator tracking control as multilayered time-varying problem. Appl Math Model (2021) 96:355–66. doi:10.1016/j.apm.2021.03.021

CrossRef Full Text | Google Scholar

46. He W, Xue C, Yu X, Li Z, Yang C. Admittance-based controller design for physical human–robot interaction in the constrained task space. IEEE Trans Autom Sci Eng (2020) 17(4):1937–49. doi:10.1109/tase.2020.2983225

CrossRef Full Text | Google Scholar

47. Dou R, Yu S, Li W, Chen P, Xia P, Zhai F, et al. Inverse kinematics for a 7-dof humanoid robotic arm with joint limit and end pose coupling. Mech Machine Theor (2022) 169:104637. doi:10.1016/j.mechmachtheory.2021.104637

CrossRef Full Text | Google Scholar

48. Aouiti C, Miaadi F. A new fixed-time stabilization approach for neural networks with time-varying delays. Neural Comput Appl (2020) 32(8):3295–309. doi:10.1007/s00521-019-04586-y

CrossRef Full Text | Google Scholar

49. Tutsoy O, Polat A. Linear and non-linear dynamics of the epidemics: System identification based parametric prediction models for the pandemic outbreaks. ISA Trans (2022) 124:90–102. doi:10.1016/j.isatra.2021.08.008

PubMed Abstract | CrossRef Full Text | Google Scholar

50. Xing H, Torabi A, Ding L, Gao H, Li W, Tavakoli M. Enhancing kinematic accuracy of redundant wheeled mobile manipulators via adaptive motion planning. Mechatronics (2021) 79:102639. doi:10.1016/j.mechatronics.2021.102639

CrossRef Full Text | Google Scholar

51. Wang D, Wei W, Wang X, Gao Y, Li Y, Yu Q, et al. Formation control of multiple mecanum-wheeled mobile robots with physical constraints and uncertainties. Appl Intell (2022) 52:2510–29. doi:10.1007/s10489-021-02459-3

CrossRef Full Text | Google Scholar

52. Ding L, Xiao L, Zhou K, Lan Y, Zhang Y. A New RNN Model With a Modified Nonlinear Activation Function Applied to Complex–Valued Linear Equations. IEEE. Access (2018) 6:62954–62962. doi:10.1109/ACCESS.2018.2876665

CrossRef Full Text | Google Scholar

53. Li W, Xiao L, Liao B. A Finite-time convergent and noise-rejection recurrent neural network and its discretization for dynamic nonlinear equations solving. IEEE. Transactions on Cybernetics (2020) 50(7):3195–3207. doi:10.1109/TCYB.2019.2906263

CrossRef Full Text | Google Scholar

54. Jin L, Li S, Xiao L, Lu R, Liao B. Cooperative motion generation in a distributed network of redundant robot manipulators with noises. IEEE Transactions on Systems, Man, and Cybernetics: Systems, (2018) 48(10):1715–1724. doi:10.1109/TSMC.2017.693400

CrossRef Full Text | Google Scholar