A New Data-Driven Control System for MEMSs Gyroscopes: Dynamics Estimation by Type-3 Fuzzy Systems

Abstract

In this study, a novel data-driven control scheme is presented for MEMS gyroscopes (MEMS-Gs). The uncertainties are tackled by suggested type-3 fuzzy system with non-singleton fuzzification (NT3FS). Besides the dynamics uncertainties, the suggested NT3FS can also handle the input measurement errors. The rules of NT3FS are online tuned to better compensate the disturbances. By the input-output data set a data-driven scheme is designed, and a new LMI set is presented to ensure the stability. By several simulations and comparisons the superiority of the introduced control scheme is demonstrated.

1. Introduction

Micro-electro-mechanical-system gyroscopes (MEMS-Gs) have specific properties and vast applications in navigation systems, industrial plants, automobile systems, and so on. MEMS-Gs mainly measure the rate of the rotation around the axis. The control problem of MEMS-Gs can be challengeable, because the MEMS-Gs performance can be significantly influenced by fundamental perturbations such as time-varying dynamics, cross stiffness, external noises, and damping [1,2,3,4].

Interestingly, design of MEMS-Gs can be impressively boosted through powerful control schemes which can eliminate or at least reduce the error signals [5,6]. In turn, some algorithms have been proposed to control MEMS-Gs. For instance, the chattering phenomenon in control signal applied to the MEMS-Gs has been removed by employing an integral sliding-mode control (SMC) [7]. Moreover, a robust SMC has been developed to improve trajectory tracking and remove the chattering for the similar problem [8]. An adaptive dynamic SMC with the sliding surface comprised of fractional-order terms has been utilized to control the Z-axis vibrating MEMS-Gs in [9], and an adaptive dynamic SMC via a backstepping technique to analyze the same problem has been used in [10]. Based on an LMI approach and the concept of a nonsingular terminal SMC strategy, the stabilization conditions of the MEMS-Gs have been addressed in [11]. The tracking problem of uncertain MEMS-Gs with disturbances has been analyzed by using an adaptive prescribed performance SMC in [12]. Moreover, the nonsingular terminal SMC which involves an online identifier to approximate the angular velocity has been suggested by using the backstepping scheme in [13].

On the other hand, the stability analysis and control problem become more complex when unknown nonlinear dynamics and uncertainties exist in the model of MEMS-Gs. These types of uncertainties may devastate the performance of MEMS-Gs [14].

In the literature, FLS-based control techniques are widely used for uncertain systems [15,16]. For instance, in [17], a type-2 (T2) FLS with a tuned scheme for secondary memberships has been implemented for the frequency regulation problem subject to unknown dynamics and multiple disturbances. In [18], based on T2-FLSs, the unknown nonlinearities have been approximated to analyze the synchronization of chaotic systems under unknown slave systems. The problem of synchronization of chaotic systems in the presence of unknown dynamics has been solved by using a dynamic programming technique and type-2 wavelet-based FLSs [19]. To upgrade the estimation precision in the system identification problem, a dynamic deep learned T2-FLS has been introduced in [20]. The predictive control of glucose level with unknown metabolism has been studied by using T2-FLSs in [21]. Based on an LMI scheme and a deep tuned T2-FLS, the leader following problem of multi-agent plants under perturbed dynamics has been studied in [22]. Moreover, to upgrade approximation performance, an interval type-3 (T3) FLS with an online learning scheme has been developed in [23]. Recently, a self-organizing interval T3-FLS has been suggested in [24] to promote the precisions of a learning algorithms in versus of non-Gaussian noises. In [25] a new FLS based predictive control system is introduced for networked systems. In [26], a new system based on FLSs is designed for transporting of hazardous materials.

These techniques have provided the opportunities to address the uncertainties and unknown dynamics of MEMS-Gs. A fractional-order SMC of a micro gyroscope with unknown model has been studied via a double-loop FLS [27]. The bat algorithm has been used for parameter tuning of PID SMC of MEMS-Gs in [28]. Furthermore, both the SMC and the NTSMC have been designed by considering composite neural learning method to achieve finite-time stability and enhance the tracking accuracy of MEMS-Gs [29]. Authors in [30] have utilized a neural adaptive control with hysteresis logarithmic quantizer for the MEMS-GS in the presence of constraints on the states. In [31], using a simple neural network (NN) to approximate nonlinearity of the MEMS-Gs, the fast terminal SMC has been developed to analyze short-time convergence. Based on the error compensation scheme, the TSMC problem has been investigated for the subject of uncertainties in [32]. An output feedback controller has been designed using NNs and SMC for the same problem in [33]. Moreover, a NN constrained output feedback controller which incorporates a hybrid quantizer has been suggested to enhance tracking error of the MEMS-Gs [34]. Recently, the predictive control (MPC) approach with T3FLSs has been designed to control MEMS-Gs which suffers from actuator faults [35]. Considering non-singleton FLSs and Boltzmann machine, a new fuzzy controller has been suggested for MEMS-Gs in the presence of nonlinearities and unknown dynamics [36].

Data-based control strategies are at the center of attention due to their applications in engineering. Along with model-based and system identification approaches, direct data-driven control methods can be implemented to investigate the stability analysis of systems with unknown dynamics. In this regard, direct data-driven control method is able to tackle the complexities of learning a precise model of a system. Recently, some valuable direct data-driven control techniques have been proposed. For instance, based on persistently exciting data, data-dependent LMIs have been provided in [37,38] to obtain the optimal control and robustness in the presence of noise corrupted measurements via applying a data-based state feedback controller. Authors in [39] propose a method to improve the conditions of designing data-driven control. Based on past measured trajectories, an implicit model has been considered to design a robust data-driven MPC [40]. Recently, these ideas have also been utilized to control the unknown nonlinear polynomial systems [41]. Utilizing the framework of matrix S-Lemma and LMIs, $H_2$ and $H_{\infty }$ data-based controllers are designed through noisy data in [42]. Based on data-driven control and reinforcement learning, the Linear Quadratic Regulator (LQR) has been developed for the stabilization of linear systems with unknown dynamics in [43]. Data-driven control and fault estimation of unknown systems has been studied in [44]. Moreover, a data-based feedback controller with a guaranteed attraction has been considered to analyze the stabilization of bilinear systems [45].

Motivated by above research studies, in this paper, a non-singleton T3-FLS is established to tackle the nonlinearities of the system model and unknown dynamics of MEMS-Gs, which in turn enables us to develop the accuracy of the suggested controller. The contributions of this paper are consist of developing the direct data-driven control strategy and merging with a non-singleton type-3 FLS to design a novel hybrid controller. Based on the finite response samples and considering the basic sufficient conditions, a hybrid controller is utilized for the stability of the tracking error. In contrast to the proposed methods of [35,36], where the MPC strategy and a deep learned RBM have been utilized, in current study, a data-driven scheme is implemented to upgrade the accuracy of the applied controller, characterize, and achieve the stability of the error system without explicitly identifying a model or using a deep learned RBM. More specifically, to tackle the conditions on characterization of the error dynamic system proposed in [35,36] which lead to the conservatism, modeling error, and high computational complexity, direct data-driven control mechanism is formulated to enhance the system performance. To this goal, based on the optimization problem, sufficient data-based conditions in the framework of the LMI are acquired and the gain of the data-based controller is computed. Employing the suggested direct data-driven control method, the stability of the error dynamics is ensured via a Lyapunov function, which in turn ensures that our data-driven algorithm steers the error signal to the zero.

2. Problem Formulation

Consider the following dynamics of MEMS-G [35]:

$$\begin{array}{cc}\hfill & M{\ddot{\tilde{r}}}_1+a_{11}{\dot{\tilde{r}}}_1+(a_{12}-2M{\tilde{\theta }}_{\rho }){\dot{\tilde{r}}}_2+({\Lambda }_{11}-M{{\tilde{\theta }}_{\rho }}^2){\dot{\tilde{r}}}_1+{\Lambda }_{11}{\tilde{r}}_2+{\Lambda }_{13}{\tilde{r}}_1^3={\tilde{\eta }}_1\hfill \end{array}$$ (1)

$$\begin{array}{cc}\hfill & M{\ddot{\tilde{r}}}_2+a_{22}{\dot{\tilde{r}}}_1+(a_{21}+2M{\tilde{\theta }}_{\rho }){\dot{\tilde{r}}}_1+({\Lambda }_{22}-M{{\tilde{\theta }}_{\rho }}^2){\dot{\tilde{r}}}_2+{\Lambda }_{21}{\tilde{r}}_1+{\Lambda }_{23}{\tilde{r}}_2^3={\tilde{\eta }}_2\hfill \end{array}$$ (2)

where ${\Lambda }_{13},{\Lambda }_{21},{\Lambda }_{23}$, and ${\Lambda }_{11},{\Lambda }_{22}$ are the stiffness coefficients and the coefficients of stiffness coupling. Moreover, ${\tilde{r}}_1$/${\tilde{r}}_2$ denotes the displacement of drive/sensitive axis and ${\tilde{\theta }}_{\rho }$ is the level sensitivity. The dimensionless positions are as follows:

$$\begin{array}{cc}\hfill & M{\ddot{r}}_1+a_{11}{\dot{r}}_1+(a_{12}-2M{\theta }_{\rho }){\dot{r}}_2+({\Lambda }_{11}-M{\theta }_{\rho }^2){\dot{r}}_1+{\Lambda }_{11}{r}_2+{\Lambda }_{13}{r}_1^3={\eta }_1\hfill \end{array}$$ (3)

$$\begin{array}{cc}\hfill & M{\ddot{r}}_2+a_{22}{\dot{r}}_1+(a_{21}+2M{\theta }_{\rho }){\dot{r}}_1+({\Lambda }_{22}-M{\theta }_{\rho }^2){\dot{r}}_2+{\Lambda }_{21}{r}_1+{\Lambda }_{23}{r}_2^3={\eta }_2\hfill \end{array}$$ (4)

One can estimate the dynamics of MEMS-G as follows:

$$\begin{array}{cc}\hfill & {\dot{\widehat{r}}}_1={\mathcal{G}}_1\left(x\right|{\Xi }_{r_1})+{\eta }_1\hfill \end{array}$$ (5)

$$\begin{array}{cc}\hfill & {\dot{\widehat{r}}}_2={\mathcal{G}}_2\left(x\right|{\Xi }_{r_2})+{\eta }_2\hfill \end{array}$$ (6)

where ${\mathcal{G}}_1\left(x\right|{\Xi }_{r_1})$ and ${\mathcal{G}}_1\left(x\right|{\Xi }_{r_1})$ are the designed NT3FSs, ${\Xi }_{r_1}$ and ${\Xi }_{r_1}$ are the tunable parameters and the vector x is:

$$\begin{array}{c}\hfill x={\left[\begin{array}{cccc}{r}_1& r_2& {\dot{r}}_1& {\dot{r}}_2\end{array}\right]}^T\end{array}$$ (7)

By applying the online optimized FLS to tackle the uncertainties, a data-drive scheme is proposed stabilize the tracking error dynamics. See the general scheme in Figure 1 and Figure 2.

Figure 1.

General control scheme.

Figure 2.

Control scheme.

3. Type-3 FLS

The dynamics of the MEMS-G are perturbed by various disturbances and also the mathematical equations are considered to be fully uncertain. Then in control of MEMS-Gs we deal with a high uncertain problem. Type-3 FLSs can better model the high-level uncertainties, because of their higher degrees of freedom in contrast to type-1 and type-2 counter parts. The secondary memberships and upper bounds of uncertainties in type-3 fuzzy sets are not fixed values but they are also fuzzy sets. Regarding above reasons, in this paper T3-FLSs are employed to tackle the uncertainties in dynamics of MEMS-G as given in (5). The suggested scheme is given in Figure 3. The computation details of output signal is written as:

Figure 3.

NT3FS structure.

(1) The inputs of NT3FSs are $x=\left[y_1,{\dot{y}}_1,y_2,{\dot{y}}_2\right]$.

(2) The operation of fuzzifications are applied as:

$${\overline{x}}_{i,{\overline{\kappa }}_j}\left(t\right)=\frac{x_i\left(t\right){\overline{\sigma }}_{{\Lambda }_i^n,{\overline{\kappa }}_j}^2+c_{{\Lambda }_i^n,{\overline{\kappa }}_j}{\overline{\sigma }}_x^2}{{\overline{\sigma }}_{{\Lambda }_i^n,{\overline{\kappa }}_j}^2+{\overline{\sigma }}_x^2},$$ (8)

$${\overline{x}}_{i,{\underset{\_}{\kappa }}_j}\left(t\right)=\frac{x_i\left(t\right){\overline{\sigma }}_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}^2+c_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}{\overline{\sigma }}_x^2}{{\overline{\sigma }}_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}^2+{\overline{\sigma }}_x^2},$$ (9)

$${\underset{\_}{x}}_{i,{\overline{\kappa }}_j}\left(t\right)=\frac{x_i\left(t\right){\underset{\_}{\sigma }}_{{\Lambda }_i^n,{\overline{\kappa }}_j}^2+c_{{\Lambda }_i^n,{\overline{\kappa }}_j}{\overline{\sigma }}_x^2}{{\underset{\_}{\sigma }}_{{\Lambda }_i^n,{\overline{\kappa }}_j}^2+{\overline{\sigma }}_x^2},$$ (10)

$${\underset{\_}{x}}_{i,{\underset{\_}{\kappa }}_j}\left(t\right)=\frac{x_i\left(t\right){\underset{\_}{\sigma }}_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}^2+c_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}{\overline{\sigma }}_x^2}{{\underset{\_}{\sigma }}_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}^2+{\overline{\sigma }}_x^2},$$ (11)

where, $x_i\left(t\right)$ is the i-th input, $c_{{\Lambda }_i^n,{\overline{\kappa }}_j}$, ${\underset{\_}{\sigma }}_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}$, ${\underset{\_}{\sigma }}_{{\Lambda }_i^n,{\overline{\kappa }}_j}$, ${\overline{\sigma }}_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}$, ${\overline{\sigma }}_{{\Lambda }_i^n,{\overline{\kappa }}_j}$ denote the mean and standard-divisions for n-th fuzzy set (FS) for $y_i$ at $\kappa$ slice level. ${\overline{\sigma }}_x$ is a constant value.

(3) The memberships are written as:

$${\overline{\phi }}_{{\Lambda }_i^n,{\overline{\kappa }}_j}\left(x_i\left(t\right)\right)=exp\left(-\frac{\left({\overline{x}}_{i,{\overline{\kappa }}_j}\left(t\right)-c_{{\Lambda }_i^n,{\overline{\kappa }}_j}\right)}{{\overline{\sigma }}_{{\Lambda }_i^n,{\overline{\kappa }}_j}^2}\right),$$ (12)

$${\overline{\phi }}_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}\left(x_i\left(t\right)\right)=exp\left(-\frac{\left({\overline{x}}_{i,{\underset{\_}{\kappa }}_j}\left(t\right)-c_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}\right)}{{\overline{\sigma }}_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}^2}\right),$$ (13)

$${\underset{\_}{\phi }}_{{\Lambda }_i^n,{\overline{\kappa }}_j}\left(x_i\left(t\right)\right)=exp\left(-\frac{\left({\underset{\_}{x}}_{i,{\overline{\kappa }}_j}\left(t\right)-c_{{\Lambda }_i^n,{\overline{\kappa }}_j}\right)}{{\underset{\_}{\sigma }}_{{\Lambda }_i^n,{\overline{\kappa }}_j}^2}\right),$$ (14)

$${\underset{\_}{\phi }}_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}\left(x_i\left(t\right)\right)=exp\left(-\frac{\left({\underset{\_}{x}}_{i,{\underset{\_}{\kappa }}_j}\left(t\right)-c_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}\right)}{{\underset{\_}{\sigma }}_{{\Lambda }_i^n,{\underset{\_}{\kappa }}_j}^2}\right).$$ (15)

(4) The firing level of rules are [23]:

$${\overline{\mu }}_{{\overline{\kappa }}_j}^h={\overline{\phi }}_{{\Lambda }_1^{n_1},{\overline{\kappa }}_j}·{\overline{\phi }}_{{\Lambda }_2^{n_2},{\overline{\kappa }}_j}\dots {\overline{\phi }}_{{\Lambda }_n^{n_N},{\overline{\kappa }}_j},$$ (16)

$${\overline{\mu }}_{{\underset{\_}{\kappa }}_j}^h={\overline{\phi }}_{{\Lambda }_1^{n_1},{\underset{\_}{\kappa }}_j}·{\overline{\phi }}_{{\Lambda }_2^{n_2},{\underset{\_}{\kappa }}_j}\dots {\overline{\phi }}_{{\Lambda }_n^{n_N},{\underset{\_}{\kappa }}_j},$$ (17)

$${\underset{\_}{\mu }}_{{\overline{\kappa }}_j}^h={\underset{\_}{\mu }}_{{\Lambda }_1^{n_1},{\overline{\kappa }}_j}·{\underset{\_}{\mu }}_{{\Lambda }_2^{n_2},{\overline{\kappa }}_j}\dots {\underset{\_}{\mu }}_{{\Lambda }_n^{n_N},{\overline{\kappa }}_j},$$ (18)

$${\underset{\_}{\mu }}_{{\underset{\_}{\kappa }}_j}^h={\underset{\_}{\mu }}_{{\Lambda }_1^{n_1},{\underset{\_}{\kappa }}_j}·{\underset{\_}{\mu }}_{{\Lambda }_2^{n_2},{\underset{\_}{\kappa }}_j}\dots {\underset{\_}{\mu }}_{{\Lambda }_n^{n_N},{\underset{\_}{\kappa }}_j}.$$ (19)

where, N is input numbers. The h-th rule is given as:

$$\begin{array}{c}{y}_1\mathrm{is}{\overline{\phi }}_{{\Lambda }_1^{n_1},{\overline{\kappa }}_j}\mathrm{and}{y}_2\mathrm{is}{\overline{\phi }}_{{\Lambda }_2^{n_2},{\overline{\kappa }}_j}\mathrm{and}\\ y_n\mathrm{is}{\overline{\phi }}_{{\Lambda }_n^{n_N},{\overline{\kappa }}_j}\mathrm{Then}{y}_h\in \left[{\underset{\_}{\Xi }}_{h,j},{\overline{\Xi }}_{h,j}\right],\end{array}$$ (20)

where, ${\underset{\_}{\Xi }}_{h,j}$ and ${\overline{\Xi }}_{h,j}$ denote rule coefficients.

(5) The output signal is written as [23]:

$$\begin{array}{c}y=\frac{{\displaystyle \sum _{j=1}^{n_{\kappa }}}}{{\displaystyle \sum _{j=1}^{n_{\kappa }}}{\overline{\kappa }}_j}\left(\frac{{\displaystyle \sum _{h=1}^Y}{\overline{\kappa }}_j\left({\overline{\mu }}_{{\overline{\kappa }}_j}^h+{\underset{\_}{\mu }}_{{\overline{\kappa }}_j}^h\right){\overline{\Xi }}_{h,j}/2}{{\displaystyle \sum _{h=1}^Y}\left({\overline{\mu }}_{{\overline{\kappa }}_j}^h+{\underset{\_}{\mu }}_{{\overline{\kappa }}_j}^h\right)}+\right.\left.\frac{{\underset{\_}{\kappa }}_j{\displaystyle \sum _{h=1}^Y}\left({\overline{\mu }}_{{\underset{\_}{\kappa }}_j}^h+{\underset{\_}{\mu }}_{{\underset{\_}{\kappa }}_j}^h\right){\underset{\_}{\Xi }}_{h,j}/2}{{\displaystyle \sum _{h=1}^Y}\left({\overline{\mu }}_{{\underset{\_}{\kappa }}_j}^h+{\underset{\_}{\mu }}_{{\underset{\_}{\kappa }}_j}^h\right)}\right)\hfill \end{array}$$ (21)

where, $n_{\kappa }$ and Y are the number of slices and inputs. From (21), ${\mathcal{G}}_1\left(\mu |{\Xi }_1\right)$ and ${\mathcal{G}}_2\left(\mu |{\Xi }_2\right)$ we have:

$$\mathcal{G}\left(\mu |{\Xi }_{y_1}\right)={\Xi }_{}^T\mu ,$$ (22)

where,

$$\begin{array}{c}{\Xi }_{}^T=\left[{\underset{\_}{\Xi }}_{1,1},\dots ,{\underset{\_}{\Xi }}_{1,n_r},\dots ,{\underset{\_}{\Xi }}_{Y,1},\dots ,{\underset{\_}{\Xi }}_{Y,n_r}\right.,\\ \left.{\overline{\Xi }}_{1,1},\dots ,{\overline{\Xi }}_{1,n_r},\dots ,{\overline{\Xi }}_{1,1},\dots ,{\overline{\Xi }}_{1,n_r}\right],\end{array}$$ (23)

$$\begin{array}{c}{\mu }_{}^T=\frac{0.5}{{\displaystyle \sum _{j=1}^{\Lambda }}{\overline{\kappa }}_j}\left[\frac{{\underset{\_}{\kappa }}_1\left({\overline{\mu }}_{{\underset{\_}{\kappa }}_1}^1+{\underset{\_}{\mu }}_{{\underset{\_}{\kappa }}_1}^1\right)}{{\displaystyle \sum _{h=1}^Y}\left({\overline{\mu }}_{{\underset{\_}{\kappa }}_j}^1+{\underset{\_}{\mu }}_{{\underset{\_}{\kappa }}_j}^1\right)},\dots ,\frac{{\underset{\_}{\kappa }}_{n_{\kappa }}\left({\overline{\mu }}_{{\underset{\_}{\kappa }}_{n_{\kappa }}}^1+{\underset{\_}{\mu }}_{{\underset{\_}{\kappa }}_{n_{\kappa }}}^1\right)}{{\displaystyle \sum _{h=1}^Y}\left({\overline{\mu }}_{{\underset{\_}{\kappa }}_j}^1+{\underset{\_}{\mu }}_{{\underset{\_}{\kappa }}_j}^1\right)}\right.,\\ \frac{{\underset{\_}{\kappa }}_1\left({\overline{\mu }}_{{\underset{\_}{\kappa }}_1}^Y+{\underset{\_}{\mu }}_{{\underset{\_}{\kappa }}_1}^Y\right)}{{\displaystyle \sum _{h=1}^Y}\left({\overline{\mu }}_{{\underset{\_}{\kappa }}_j}^1+{\underset{\_}{\mu }}_{{\underset{\_}{\kappa }}_j}^1\right)},\dots ,\frac{{\underset{\_}{\kappa }}_{n_{\kappa }}\left({\overline{\mu }}_{{\underset{\_}{\kappa }}_{n_{\kappa }}}^Y+{\underset{\_}{\mu }}_{{\underset{\_}{\kappa }}_{n_{\kappa }}}^Y\right)}{{\displaystyle \sum _{h=1}^Y}\left({\overline{\mu }}_{{\underset{\_}{\kappa }}_j}^1+{\underset{\_}{\mu }}_{{\underset{\_}{\kappa }}_j}^1\right)},\\ {\overline{\kappa }}_1\frac{\left({\overline{\mu }}_{{\overline{\kappa }}_1}^1+{\underset{\_}{\mu }}_{{\overline{\kappa }}_1}^1\right)}{{\displaystyle \sum _{h=1}^Y}\left({\overline{\mu }}_{{\overline{\kappa }}_j}^h+{\underset{\_}{\mu }}_{{\overline{\kappa }}_j}^h\right)},\dots ,{\overline{\kappa }}_{n_{\kappa }}\frac{\left({\overline{\mu }}_{{\overline{\kappa }}_{n_{\kappa }}}^1+{\underset{\_}{\mu }}_{{\overline{\kappa }}_{n_{\kappa }}}^1\right)}{{\displaystyle \sum _{h=1}^Y}\left({\overline{\mu }}_{{\overline{\kappa }}_j}^h+{\underset{\_}{\mu }}_{{\overline{\kappa }}_j}^h\right)},\\ \left.{\overline{\kappa }}_1\frac{\left({\overline{\mu }}_{{\overline{\kappa }}_1}^Y+{\underset{\_}{\mu }}_{{\overline{\kappa }}_1}^Y\right)}{{\displaystyle \sum _{h=1}^Y}\left({\overline{\mu }}_{{\overline{\kappa }}_j}^h+{\underset{\_}{\mu }}_{{\overline{\kappa }}_j}^h\right)},\dots ,{\overline{\kappa }}_{n_{\kappa }}\frac{\left({\overline{\mu }}_{{\overline{\kappa }}_{n_{\kappa }}}^Y+{\underset{\_}{\mu }}_{{\overline{\kappa }}_{n_{\kappa }}}^Y\right)}{{\displaystyle \sum _{h=1}^Y}\left({\overline{\mu }}_{{\overline{\kappa }}_j}^h+{\underset{\_}{\mu }}_{{\overline{\kappa }}_j}^h\right)}\right],\end{array}$$ (24)

The rules are optimized as follows:

$$\Xi \left(t+1\right)=\Xi \left(t\right)+\gamma \mu \left(t\right)e\left(t\right)$$ (25)

where, e represents tracking error and $0\le \gamma <1$.

4. Data Driven Control System

From (5), the basic controller is considered as:

$${\eta }_z={\ddot{r}}_{d_z}-{\mathcal{G}}_z\left(x\right|{\Xi }_{r_z})-{\iota }_1{\dot{e}}_z-{\iota }_2{e}_z$$ (26)

where, ${\mathcal{G}}_z\left(x\right|{\Xi }_{r_z})$ is suggested FLS, $r_{d_z}$ is the desired signal, and ${\iota }_1$ and ${\iota }_2$ are constant. Then tracking error dynamics becomes:

$${\ddot{e}}_z=-{\iota }_1{\dot{e}}_z-{\iota }_2{e}_z-{\epsilon }_z-u_z$$ (27)

where, ${\epsilon }_z$ represents the approximation error. The linearized equations of error system are considered as:

$$\begin{array}{cc}\hfill & e_z(k+1)=A{e}_z\left(k\right)+B{u}_z\left(k\right)\hfill \end{array}$$ (28)

As mentioned before, we consider a linear discrete time system to model the error system where the system information are fully unknown. Therefore, the aim of this section is to construct a feedback control system no the basis of limited collected data from previous operation of the system, in order to steer the error to the origin. In this regard, a feedback controller $u_z\left(k\right)=F{e}_z\left(k\right)$ is considered and we have to formulate the gain F based on data (without identifying the matrices $A,B$). During the operation of the system, we collect ${\tau }_k$ samples from the input and error as the sequences of $u_z\left(0\right),u_z\left(1\right),\dots ,u_z({\tau }_k-1)$ and $e_z\left(0\right),e_z\left(1\right),\dots ,e_z({\tau }_k-1)$. These are organized as

$$\begin{array}{cc}\hfill {\mathbf{U}}_{\mathbf{z}[0,{\tau }_k]}& =[u_z\left(0\right)u_z\left(1\right)\dots u_z({\tau }_k-1)]\hfill \end{array}$$ (29)

$$\begin{array}{cc}\hfill {\mathbf{E}}_{\mathbf{z}[0,{\tau }_k]}& =[e_z\left(0\right)e_z\left(1\right)\dots e_z({\tau }_k-1)]\hfill \end{array}$$ (30)

$$\begin{array}{cc}\hfill {\mathbf{E}}_{\mathbf{z}[1,{\tau }_k-1]}& =[e_z\left(1\right)e_z\left(2\right)\dots e_z({\tau }_k-1)]\hfill \end{array}$$ (31)

Lemma 1.

Let $\mathbf{C}\in {\mathbb{R}}^{{\tau }_k\times n}$ satisfies $I={\mathbf{E}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{C}$. Then, the error system (28) with the state feedback controller $u_z\left(k\right)=F{e}_z\left(k\right)$ which is formulated as $F={\mathbf{U}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{C}$ has the following equivalent representation

$$\begin{array}{c}\hfill e_z(k+1)={\mathbf{E}}_{\mathbf{z}[1,{\tau }_k]}\mathbf{C}{e}_z\left(k\right)\end{array}$$ (32)

Proof. 

Applying the state feedback controller $u_z\left(k\right)=F{e}_z\left(k\right)$ to the error system (28) and based on $I={\mathbf{E}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{C}$, one can achieve that

$$\begin{array}{cc}\hfill e_z(k+1)& =\left(A.I+BF\right)e_z\left(k\right)\hfill \\ \hfill & =\left(A{\mathbf{E}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{C}+B{\mathbf{U}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{C}\right)e_z\left(k\right)\hfill \end{array}$$ (33)

Since the error data in (31) satisfies ${\mathbf{E}}_{\mathbf{z}[1,{\tau }_k]}=A{\mathbf{E}}_{\mathbf{z}[0,{\tau }_k]}+B{\mathbf{U}}_{\mathbf{z}[0,{\tau }_k]}$, Lemma 1 is proved.

□

In the next part, sufficient condition in the framework of LMI will be proposed for the stabilization of the error system (32).

Theorem 1.

If there exist a matrix $\mathbf{R}$ such that the following LMI holds

$$\begin{array}{c}\hfill \left[\begin{array}{cc}{\mathbf{E}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{R}& {\mathbf{E}}_{\mathbf{z}[1,{\tau }_k]}\mathbf{R}\\ \ast & {\mathbf{E}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{R}\end{array}\right]>0\end{array}$$ (34)

Then, the error system (28) is asymptotically stable and the direct data-driven controller is computed via $u_z\left(k\right)={\mathbf{U}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{R}{\left({\mathbf{E}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{R}\right)}^{-1}{e}_z\left(k\right)$.

Proof. 

Since (32) is the data-based closed-loop representation of the error system (28), the asymptotical stability of (32) should be guaranteed. For this purpose, the Lyapunov function is considered as $\mathbf{V}\left(k\right)={e_z}^T\left(k\right)\mathbf{P}{e}_z\left(k\right)$.

The time difference of $\mathbf{V}\left(k\right)$ is as follows

$$\begin{array}{cc}\hfill \Delta \mathbf{V}\left(k\right)& ={e_z}^T(k+1)\mathbf{P}{e}_z(k+1)-{e_z}^T\left(k\right)\mathbf{P}{e}_z\left(k\right)\hfill \\ \hfill & ={e_z}^T\left(k\right)\left({\mathbf{E}}_{\mathbf{z}[1,{\tau }_k]}\mathbf{R}{\mathbf{P}}^{-1}{\mathbf{R}}^T{\mathbf{E}}_{\mathbf{z}[1,{\tau }_k]}^T\right)e_z\left(k\right)-{e_z}^T\left(k\right)\mathbf{P}{e}_z\left(k\right)\hfill \end{array}$$ (35)

where the change of variable $\mathbf{R}=\mathbf{C}\mathbf{P}$ is employed. Regarding Lemma 1, one can achieve that $\mathbf{P}={\mathbf{E}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{R}$. Now, applying Schur Complement Lemma to the inequality $\Delta \mathbf{V}\left(k\right)<0$ results in the LMI (34). Furthermore the gain of the direct data-driven controller is computed as $F={\mathbf{U}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{C}={\mathbf{U}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{R}{\mathbf{P}}^{-1}={\mathbf{U}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{R}{\left({\mathbf{E}}_{\mathbf{z}[0,{\tau }_k]}\mathbf{R}\right)}^{-1}$. This completes the proof. □

5. Stabilization with Noisy Data

Consider the error system (28), but in this system the only measurable signal is

$$\begin{array}{c}\hfill e_n\left(k\right)=e_z\left(k\right)+n\left(k\right)\end{array}$$ (36)

where $n\left(k\right)$ is an unknown measurement noise with no particular statistics on the noise. The aim here is to construct a stabilizing control technique on the basis of the open-loop measurable noisy data $e_n\left(k\right)$. Defining the following data sequences

$$\begin{array}{cc}\hfill {\mathbf{N}}_{[0,{\tau }_k]}& =[n\left(0\right)n\left(1\right)\dots n({\tau }_k-1)]\hfill \end{array}$$ (37)

$$\begin{array}{cc}\hfill {\mathbf{N}}_{[1,{\tau }_k]}& =[n\left(1\right)n\left(2\right)\dots n\left({\tau }_k\right)]\hfill \end{array}$$ (38)

in which $n\left(k\right),k=0,\dots ,{\tau }_k$ are noise samples collected during the experiment. Moreover, one has

$$\begin{array}{cc}\hfill {\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}& ={\mathbf{E}}_{\mathbf{z}[0,{\tau }_k]}+{\mathbf{N}}_{[0,{\tau }_k]}\hfill \end{array}$$ (39)

$$\begin{array}{cc}\hfill {\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}& ={\mathbf{E}}_{\mathbf{z}[1,{\tau }_k]}+{\mathbf{N}}_{[1,{\tau }_k]}\hfill \end{array}$$ (40)

Assumption 1.

The matrices $\left[\begin{array}{c}{\mathbf{U}}_{[0,{\tau }_k]}\\ {\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}\end{array}\right],{\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}$ are full ranked.

Assumption 2.

For $\delta >0$ and ${\mathbf{S}}_{\mathbf{n}[0,{\tau }_k]}=A{\mathbf{N}}_{[0,{\tau }_k]}-{\mathbf{N}}_{[1,{\tau }_k]}$, the following inequality holds

$$\begin{array}{c}\hfill {\mathbf{S}}_{\mathbf{n}[0,{\tau }_k]}{\mathbf{S}}_{\mathbf{n}[0,{\tau }_k]}^T\le \delta {\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}{\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}^T\end{array}$$ (41)

The Theorem 2, provides sufficient conditions for the stabilization of (28) with noisy collected data.

Theorem 2.

Assume that Assumptions 1 and 2 hold and there exists a matrix $\mathbf{R}$ and a scalar $\mu >0$ such that $\delta <\frac{{\mu }^2}{\left(4+2\mu \right)}$ and the following LMIs hold

$$\begin{array}{cc}\hfill & \hfill \left[\begin{array}{cc}{\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}\mathbf{R}-\mu {\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}{\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}^T& {\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}\mathbf{R}\\ \ast & {\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}\mathbf{R}\end{array}\right]>0\end{array}$$ (42)

$$\begin{array}{cc}\hfill & \left[\begin{array}{cc}I& \mathbf{R}\\ \ast & {\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}\mathbf{R}\end{array}\right]>0\hfill \end{array}$$ (43)

Then, the error system (28) is asymptotically stable and the gain of the data-based controller is designed under noisy collected data via $F={\mathbf{U}}_{[0,{\tau }_k]}\mathbf{R}{\left({\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}\mathbf{R}\right)}^{-1}$.

Proof. 

From Lemma 1, Equations (39) and (40), the following results can be concluded

$$\begin{array}{cc}\hfill e_n(k+1)& =\left(A+BF\right)e_n\left(k\right)=\left(A{\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}\mathbf{C}+B{\mathbf{U}}_{[0,{\tau }_k]}\mathbf{C}\right)e_n\left(k\right)\hfill \\ \hfill & =\left(A\left({\mathbf{E}}_{[0,{\tau }_k]}+{\mathbf{N}}_{[0,t_k]}\right)\mathbf{C}+B{\mathbf{U}}_{[0,t_k]}\mathbf{C}\right)e_n\left(k\right)\hfill \\ \hfill & =\left({\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}+{\mathbf{S}}_{\mathbf{n}[0,{\tau }_k]}\right)\mathbf{C}{e}_n\left(k\right)\hfill \end{array}$$ (44)

Consider Lyapunov candidate as $\mathbf{V}\left(k\right)={e_n}^T\left(k\right)\mathbf{P}{e}_n\left(k\right)$. The time difference of $\mathbf{V}\left(k\right)$ is:

$$\begin{array}{cc}\hfill & \Delta \mathbf{V}\left(k\right)={e_n}^T(k+1)\mathbf{P}{e}_n(k+1)-{e_n}^T\left(k\right)\mathbf{P}{e}_n\left(k\right)\hfill \\ \hfill & ={e_n}^T\left(k\right)\left(\left({\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}+{\mathbf{S}}_{\mathbf{n}[0,{\tau }_k]}\right)\mathbf{R}{\left({\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}\mathbf{R}\right)}^{-1}{\mathbf{R}}^T\right.\hfill \\ \hfill & \left.{\left({\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}+{\mathbf{S}}_{\mathbf{n}[0,{\tau }_k]}\right)}^T-{\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}\mathbf{R}\right)e_n\left(k\right)\hfill \end{array}$$ (45)

in which $\mathbf{R}=\mathbf{C}\mathbf{P}$ and ${\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}\mathbf{R}=\mathbf{P}$ are utilized. From (45), $\Delta \mathbf{V}\left(k\right)<0$ results in ${e_n}^T\left(k\right)\Omega e_n\left(k\right)<0$, where

$$\begin{array}{cc}\hfill \Omega & =(1+\rho ){\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}\mathbf{R}{\left({\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}\mathbf{R}\right)}^{-1}{\left({\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}\mathbf{R}\right)}^T\hfill \\ \hfill & +(1+{\rho }^{-1}){\mathbf{S}}_{\mathbf{n}[1,{\tau }_k]}\mathbf{R}{\left({\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}\mathbf{R}\right)}^{-1}{\left({\mathbf{S}}_{\mathbf{n}[0,{\tau }_k]}\mathbf{R}\right)}^T-{\mathbf{E}}_{\mathbf{n}[0,{\tau }_k]}\mathbf{R}\hfill \end{array}$$ (46)

in which $\rho >0$. Regarding LMI (43), one has

$$\begin{array}{cc}\hfill \Omega & <-\mu {\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}{\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}^T+\rho {\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}{\mathbf{E}}_{\mathbf{n}[1,{\tau }_k]}^T\hfill \\ \hfill & +(1+{\rho }^{-1}){\mathbf{S}}_{\mathbf{n}[0,{\tau }_k]}{\mathbf{S}}_{\mathbf{n}[0,{\tau }_k]}^T\hfill \end{array}$$ (47)

Now, choosing $\rho =\frac{\mu }{2}$ and considering $\delta <\frac{{\mu }^2}{4+2\mu }$ imply that the upper bound of $\Omega$ in (47) is negative. Therefore, the proof is completed. □

Remark 1.

The advantages of the control scheme are that: (1) The uncertainties in dynamics of the MEMS-G are online identified and there is no dependence on the predefined mathematical equations. (2) The data of tracking error is collected and then a data-driven compensator is designed. (3) The asymptotic stability is proved in two normal and noisy conditions.

6. Simulations

The reference signals $r_{d_1}$ and $r_{d_2}$ are considered to be $cos\left(5t\right)-sin\left(3t\right)$ and $sin\left(5t\right)-cos(2t-0.1)$. The initial conditions are as: $r_1\left(0\right)=-0.71$ and $r_2\left(0\right)=-0.91$. The simulation parameters are given in Table 1. The trajectories of $r_i,i=1,2$ are depicted in Figure 4 that show good tracking. We see that $r_i,i=1,2$ are approached to the references $r_{d_i},i=1,2$ at a finite time with no overshoots. The trajectories of $e_1$ and $e_2$ in Figure 5 show that the settling time is desired and error signals are reached to the zero level at a short time. The estimated signals, control signals and phase portrait are given in Figure 6, Figure 7 and Figure 8, respectively. A strong synchronization in observed in Figure 8.

Table 1.

Control parameters.

Parameters	Values	Equations
$\overline{\kappa }$	0.5 0.8 1	(12) and (13)
$\underset{\_}{\kappa }$	0 0.3 0.7	(14) and (15)
$c_{{\Lambda }_1^1}$	−1	(12)–(15)
$c_{{\Lambda }_1^2}$	1	(12)–(15)
$c_{{\Lambda }_2^1}$	−1	(12)–(15)
$c_{{\Lambda }_2^2}$	1	(12)–(15)
${\iota }_1$	100	(27)
${\iota }_2$	20	(27)

Figure 4.

Output signals.

Figure 5.

Tracking errors.

Figure 6.

Estimated signals.

Figure 7.

Control signals.

Figure 8.

Phase portrait.

For further evaluation, a comparison is presented with backstepping SMC (BSMC) [46], FLS based SMC (FSMC) [47] and fractional-order neural-based controller (FNC) [48]. Table 2, presents the RMSE comparison results. We see that the designed data-driven controller gives a better result. It worth to mention that the dynamics in our controller is fully unknown.

Table 2.

Comparison results.

Controller	${\mathit{e}}_1$	${\mathit{e}}_2$
BSMC	7.4207	11.1113
FSMC	5.3741	10.3440
FNC	6.1931	7.0221
Proposed Controller	3.4442	3.4373

Remark 2.

One of the main properties of the suggested controller is that the uncertainties are tackled by a powerful estimation scheme based on T3-FLSs. On the other hand, a data-driven compensator helps that the tracking error to be reduced. Then we see from simulation results that the tracking errors are well reached to zero level at a good finite time.

To better examine the robustness against the hard noisy condition, the disturbances are considered to be noise with noise-power 10 which is shown in Figure 9. The trajectories of output signals, tracking errors, estimated signals, and control signals are given in Figure 10, Figure 11, Figure 12 and Figure 13. We see that the suggested approach results in a good robust performance. The output signals well track the references in the presence of high noisy condition and unknown dynamics.

Figure 9.

High noise as dynamic perturbation.

Figure 10.

Output signals in the presence of high noisy condition.

Figure 11.

Tracking errors in the presence of high noisy condition.

Figure 12.

Estimated signals in the presence of high noisy condition.

Figure 13.

Control signals in the presence of high noisy condition.

7. Conclusions

This study proposes a novel data-driven control scheme for MEMS gyroscopes (MEMS-Gs) based on type-3 FLSs. The suggested FLS by a non-singleton fuzzification is designed to compensate the perturbations, uncertainties and measurement errors. The data-driven control technique by guaranteed stability is proposed to develop the stability, accuracy and robustness. The suggested controller is applied on a case-study gyroscope. Besides the fully unknown dynamics, a measurement error and dynamic perturbation are also considered as Gaussian noise. The simulations and comparisons with some conventional approaches, show that the suggested data-driven control scheme results in better accuracy.

Author Contributions

Conceptualization, A.M., S.M. and K.A.A.; Data curation, A.A.A. and B.F.F. and M.T.V.; Formal analysis, A.A.A., A.M., B.F.F., S.M., K.A.A. and M.T.V.; Funding acquisition, A.A.A. and B.F.F.; Investigation, A.M., S.M. and K.A.A.; Methodology, A.A.A., B.F.F., K.A.A. and M.T.V.; Resources, A.A.A.; Software, A.M.; Supervision, A.M. and M.T.V.; Validation, A.M.; Visualization, A.M.; Writing—original draft, A.M., S.M., K.A.A., A.A.A., B.F.F. and M.T.V. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Taif University Researchers Supporting Project (TURSP-2020/260), Taif University, Taif, Saudi Arabia.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The study do not report any data.

Conflicts of Interest

The authors declare no conflict of interest.