
In this study, we investigate the traveling wave solutions of the Gilson-Pickering equation using two different approaches: F-expansion and (1/G′)-expansion. To carry out the analysis, we perform a numerical study using the implicit finite difference approach on a uniform mesh and the parabolic-Monge-Ampère (PMA) method on a moving mesh. We examine the truncation error, stability, and convergence of the difference scheme implemented on a fixed mesh. MATLAB software generates accurate representations of the solution based on specified parameter values by creating 3D and 2D graphs. Numerical simulations with the finite difference scheme demonstrate excellent agreement with the analytical solutions, further confirming the validity of our approaches. Convergence analysis confirms the stability and high accuracy of the implemented scheme. Notably, the PMA method performs better in capturing intricate wave interactions and dynamics that are not readily achievable with a fixed mesh.
Citation: Taghread Ghannam Alharbi, Abdulghani Alharbi. Traveling-wave and numerical investigations to nonlinear equations via modern computational techniques[J]. AIMS Mathematics, 2024, 9(5): 12188-12210. doi: 10.3934/math.2024595
[1] | Guijun Xing, Huatao Chen, Zahra S. Aghayan, Jingfei Jiang, Juan L. G. Guirao . Tracking control for a class of fractional order uncertain systems with time-delay based on composite nonlinear feedback control. AIMS Mathematics, 2024, 9(5): 13058-13076. doi: 10.3934/math.2024637 |
[2] | Jingjing Yang, Jianqiu Lu . Stabilization in distribution of hybrid stochastic differential delay equations with Lévy noise by discrete-time state feedback controls. AIMS Mathematics, 2025, 10(2): 3457-3483. doi: 10.3934/math.2025160 |
[3] | Kareem Alanazi, Omar Naifar, Raouf Fakhfakh, Abdellatif Ben Makhlouf . Innovative observer design for nonlinear systems using Caputo fractional derivative with respect to another function. AIMS Mathematics, 2024, 9(12): 35533-35550. doi: 10.3934/math.20241686 |
[4] | Junsoo Lee, Wassim M. Haddad . On finite-time stability and stabilization of nonlinear hybrid dynamical systems. AIMS Mathematics, 2021, 6(6): 5535-5562. doi: 10.3934/math.2021328 |
[5] | Bin Hang, Weiwei Deng . Finite-time adaptive prescribed performance DSC for pure feedback nonlinear systems with input quantization and unmodeled dynamics. AIMS Mathematics, 2024, 9(3): 6803-6831. doi: 10.3934/math.2024332 |
[6] | Miao Xiao, Zhe Lin, Qian Jiang, Dingcheng Yang, Xiongfeng Deng . Neural network-based adaptive finite-time tracking control for multiple inputs uncertain nonlinear systems with positive odd integer powers and unknown multiple faults. AIMS Mathematics, 2025, 10(3): 4819-4841. doi: 10.3934/math.2025221 |
[7] | Tan Zhang, Pianpian Yan . Asymmetric integral barrier function-based tracking control of constrained robots. AIMS Mathematics, 2024, 9(1): 319-339. doi: 10.3934/math.2024019 |
[8] | Liping Yin, Yangyu Zhu, Yangbo Xu, Tao Li . Dynamic optimal operational control for complex systems with nonlinear external loop disturbances. AIMS Mathematics, 2022, 7(9): 16673-16691. doi: 10.3934/math.2022914 |
[9] | Taewan Kim, Jung Hoon Kim . A new optimal control approach to uncertain Euler-Lagrange equations: H∞ disturbance estimator and generalized H2 tracking controller. AIMS Mathematics, 2024, 9(12): 34466-34487. doi: 10.3934/math.20241642 |
[10] | Zhiqiang Chen, Alexander Yurievich Krasnov . Disturbance observer based fixed time sliding mode control for a class of uncertain second-order nonlinear systems. AIMS Mathematics, 2025, 10(3): 6745-6763. doi: 10.3934/math.2025309 |
In this study, we investigate the traveling wave solutions of the Gilson-Pickering equation using two different approaches: F-expansion and (1/G′)-expansion. To carry out the analysis, we perform a numerical study using the implicit finite difference approach on a uniform mesh and the parabolic-Monge-Ampère (PMA) method on a moving mesh. We examine the truncation error, stability, and convergence of the difference scheme implemented on a fixed mesh. MATLAB software generates accurate representations of the solution based on specified parameter values by creating 3D and 2D graphs. Numerical simulations with the finite difference scheme demonstrate excellent agreement with the analytical solutions, further confirming the validity of our approaches. Convergence analysis confirms the stability and high accuracy of the implemented scheme. Notably, the PMA method performs better in capturing intricate wave interactions and dynamics that are not readily achievable with a fixed mesh.
Output tracking control, which entails designing a suitable controller to force the output vector of a control system as close as possible to follow a desired reference signal, is a crucial research frontier in control theory. Specifically, preview control can significantly improve the tracking performance of a closed-loop system using the known future information of a reference signal or disturbances. This technique has attracted considerable attention because of its superior tracking performance. In recent decades, preview control has been combined with various advanced control theories, resulting in a series of control methods, such as robust preview control [1,2,3], fault-tolerant preview control [4,5,6], adaptive preview control [7,8,9], information fusion preview control [10,11,12], and decentralized preview control [13,14]. For example, in [2], the robust preview control problem was solved for convex polyhedral uncertain discrete-time systems with a time-varying delay, and an AES that included the preview information of the reference signal was constructed using a difference operator method; thus, the preview tracking control was converted to a robust control problem. A LMI condition to ensure the asymptotic stability of the closed-loop system and the design method of the preview controller are subsequently provided based on the scaled small gain theorem. In [6], using the model transformation method, unknown input observer theory, robustness parameter optimisation theory and preview control technology, a fault-tolerant preview tracking control method based on simultaneous state and fault estimation was proposed for convex polyhedral LPV systems. In [7], by combining multimodel adaptive control with preview control, a multimodel adaptive preview controller with preview compensation was designed for a discrete-time system with unknown piecewise constant coefficients. In [12], an event-triggered information fusion preview control scheme was employed for the flight control problem of a two-degree-of-freedom helicopter system. Owing to its fast response, small overshoot, and high tracking precision, preview control has several practical applications, such as UAV flight control systems [15], vehicle active suspension control systems [16] and robots [17].
Lipschitz nonlinear systems are a class of nonlinear systems comprising a linear system and a nonlinear part satisfying global or local Lipschitz conditions. These systems have a strong engineering background and appear in many practical applications. For example, the neuron activation function in memristive neural networks [18] and the sinusoidal and cosinusoidal terms in dynamics of single-link flexible and rigid robot systems [19,20], which are globally Lipschitz. In addition, owing to limitations in measurement means or costs, the state variables of an actual system are not always directly accessible. Thus, it is necessary to estimate the unknown state of the system with the aid of state observers to achieve feedback control. Several studies have been conducted on the design of observers and observer-based controllers for Lipschitz nonlinear systems [21,22,23,24]. For example, in [21], a controller design scheme based on a sliding window observer was proposed for a class of discrete-time Lipschitz nonlinear systems with bounded disturbances. The basic principle was to use the input and output data of the system in the recent period of time to perform state estimation within each sliding time window and dynamically update the state estimation through recursive methods to ensure prediction accuracy. In [22], the separation principle was proven to be applicable to Lipschitz nonlinear systems, and an observer-based tracking control scheme was proposed. Subsequently, the results in [22] were extended to quasi-one-sided Lipschitz nonlinear systems in [23]. The problem of observer-based preview tracking control in discrete-time Lipschitz nonlinear systems was also considered in [24]. However, to our knowledge, studies on preview control via a state observer for continuous-time Lipschitz systems have not been reported in the literature.
In this paper, the problem of robust preview tracking control via a state observer is studied for a class of continuous-time Lipschitz nonlinear systems with external disturbances and unknown states. First, a state observer is designed to estimate the unknown state variables when the system states are not fully measurable. Second, using differentiation, the state lifting technique, and several ingenious mathematical manipulations, an AES, including the observer information, tracking error, and preview information of the reference signal, is constructed. The tracking problem is then converted to a robust H∞ control problem. Based on Lyapunov stability theory, a sufficient condition for asymptotic stability and robust H∞ performance of the closed-loop system is established in the form of an LMI. Furthermore, a robust preview tracking controller via a state observer is proposed for the original system. Finally, numerical simulations are performed. The main contributions of this paper are summarized as follows:
1) With respect to the tracking control of Lipschitz nonlinear systems, existing studies, such as [22,24], consider only a linear output (in the form of y=Cx). In contrast, both nonlinear outputs and external disturbances are considered in this paper, thereby making the system model more general and applicable.
2) Compared with the study in [25], the proposed control strategy is applicable in situations where the states are not fully measurable and ensures the simultaneous convergence of both the system tracking and estimation errors to zero. Thus, the proposed controller has the advantages of greater practicability and robustness in actual complex environments.
3) Compared with the observer-based tracking controller presented in [22], the observer-based preview controller proposed in this paper makes full use of the preview information of the reference signal, leading to better output tracking performance. Furthermore, unlike the two-step algorithm in [22], a one-step algorithm that allows the observer and tracking controller gains to be computed simultaneously via LMI in a straightforward manner is used in this paper. Thus, the control design complexity is considerably simplified, and the computational load is reduced.
Notation: Rn denotes the n-dimensional Euclidean space; Rm×n denotes the m×n matrix space; P is a square matrix, and the notation P>0(P<0) means that P is a positive (or negative) definite matrix; AT and A−1 represent the transposed matrix and the inverse matrix of A, respectively. The notion "*" in a symmetric matrix represents the transpose of the element in the symmetric position, that is [X∗YZ]=[XYTYZ]. Sym{A} denotes A+AT; diag(⋯) denotes a diagonal matrix composed of elements in the parentheses; L2[0,∞) refers to the space of square integrable infinite vector sequences, and for Z(t)∈L2[0,∞), its norm is given by ‖Z(t)‖2=√∫∞0Z(t)Z(t)dt; es(i)=(0,⋯,0,ith⏞1,0,⋯0⏟scomponents)T∈Rs,s≥1 is a vector of the canonical basis of Rs.
In this paper, we consider the following Lipschitz nonlinear system:
{˙x(t)=Ax(t)+Bu(t)+Eω(t)+f(x(t))y(t)=Cx(t)+Du(t)+g(x(t)), | (1) |
where x(t)∈Rn is the system state, u(t)∈Rm is the control input, ω(t)∈Rq is the external disturbance, and it satisfies ˙ω(t)∈L2[0,∞), y(t)∈Rp is the system output. A,B,C,D, and E are real constant matrices of appropriate dimensions. The nonlinear functions f(x):Rn→Rn and g(x):Rn→Rp are differentiable.
With regard to system (1), the following basic assumptions are made:
A1. The nonlinear terms f(x) and g(x) satisfy
−∞<f_ij≤∂fi(x)∂xj≤ˉfij<+∞, |
−∞<g_ij≤∂gi(x)∂xj≤ˉgij<+∞, |
where f_ij, ˉfij(i,j=1,⋯,n) and g_ij, ˉgij(i=1,⋯,p,j=1,⋯,n) are real constants.
Remark 1. Lipschitz nonlinear systems satisfying A1 widely exist in practical problems, such as single-link flexible joint systems [19,22], vehicle lateral dynamics models [26], nonlinear tire models [27], and diesel engine models [28]. In particular, if f(x) and g(x) are linear functions, f_ij=ˉfij,g_ij=ˉgij are real constants in A1.
When A1 is satisfied, it can be proven that f(x) and g(x) are globally Lipschitz. Hence, they are called Lipschitz nonlinear terms, and system (1) is referred to as a Lipschitz nonlinear system.
The reference signal r(t)∈Rp is piecewise differentiable with finite discontinuity points in [0,∞) and satisfies the following assumption.
A2. The reference signal r(t) converges to a constant vector r as time tends to infinity, i.e., lim. In addition, the derivative of r(t) satisfies {\dot r}(t) \in {L_2}[0, \infty) . Moreover, the reference signal r(t) is assumed to be previewable in the sense that future values r(\tau)(t \le \tau \le t + {l_r}) are available at each time t , where l_r denotes the preview length of the reference signal.
Remark 2. A2 is a basic assumption in the field of preview control [29,30,31]. In practical problems, the information of a reference signal is usually fully or partially known, such as a vehicle's driving path and an aircraft's scheduled flight path. Previous studies, such as [32,33], have shown that the known information of a reference signal is used to design a feedforward compensator that significantly improves the tracking behavior of a closed-loop system.
To facilitate the subsequent analysis and proof, the following lemmas are given.
Lemma 1. (Schur complement lemma) [34] A symmetric matrix S = \left[ \begin{matrix} {{S}_{11}} & {{S}_{12}} \\ S_{12}^{\rm T} & {{S}_{22}} \\ \end{matrix} \right]<0 is equivalent to any one of the following conditions:
(ⅰ) {{S}_{22}}<0,{{S}_{11}}-{{S}_{12}}S_{22}^{-1}S_{12}^{\rm T}<0 ;
(ⅱ) {{S}_{11}}<0,{{S}_{22}}-S_{12}^{\rm T}S_{11}^{-1}S_{12}^{{}}<0 .
Lemma 2. [35] For matrices T , H , V , W with appropriate dimensions and a scalar \zeta , the inequality
\begin{equation*} T + {\rm{Sym}}\{ WH\} < 0 \end{equation*} |
is fulfilled if the following condition holds:
\begin{equation*} \left[ \begin{matrix} T&*\\ {\zeta {H} + V^{\rm {T}}W^{\rm {T}}}&{ - {\rm{Sym}}\{ \zeta V^{\rm {T}}\} } \end{matrix} \right] < 0 . \end{equation*} |
In practical applications, it is generally impossible to obtain all the states of a system via measurement. Therefore, to estimate the unknown system states, we consider the following observer dynamical system:
\begin{equation} \left\{ \begin{aligned} & {\dot {\hat x}}(t) = A \hat x(t) + Bu(t) + f(\hat x(t)) + L(y(t) - \hat y(t))\\ & {\hat y}(t) = C \hat x(t) + Du(t) + g(\hat x(t)) \end{aligned} \right., \end{equation} | (2) |
where \hat x(t) \in {\mathbb R}^{n} is the observer state, \hat y(t) \in {\mathbb R}^{p} is the output of the observer, and L is the observer gain matrix to be designed.
The estimation error is defined as follows:
\begin{equation} \varepsilon (t) = x(t) - \hat x(t) . \end{equation} | (3) |
From systems (1) and (2), the dynamic equation of the estimation error is obtained as follows:
\begin{equation} \dot \varepsilon (t) = (A - LC)\varepsilon (t) + f(x(t)) - f(\hat x(t)) - L[g(x(t)) - g(\hat x(t))] + E\omega (t) . \end{equation} | (4) |
Taking the derivatives of both sides of the observer system (2) leads to
\begin{equation} \left\{ \begin{aligned} &\frac{{\rm{d}}}{{{\rm{d}}t}}{\dot {\hat x}}(t) = A{\dot {\hat x}}(t) + B\dot u(t) + \frac{{\partial f(\hat x)}}{{\partial \hat x}}{\dot {\hat x}}(t) + L(\dot y(t) - {\dot {\hat y}}(t)) \\ &{\dot {\hat y}}(t) = C{\dot {\hat x}}(t) + D\dot u(t) + \frac{{\partial g(\hat x)}}{{\partial \hat x}}{\dot {\hat x}}(t) \end{aligned} \right., \end{equation} | (5) |
where \frac{{\partial f(\hat x)}}{{\partial \hat x}} and \frac{{\partial g(\hat x)}}{{\partial \hat x}} can be expressed as follows:
\begin{align} \frac{{\partial f(\hat x)}}{{\partial \hat x}} & = \left[ \begin{matrix} {\frac{{\partial {f_1}(\hat x)}}{{\partial {{\hat x}_1}}}}& \cdots &{\frac{{\partial {f_1}(\hat x)}}{{\partial {{\hat x}_n}}}}\\ \cdots & \cdots & \cdots \\ {\frac{{\partial {f_n}(\hat x)}}{{\partial {{\hat x}_1}}}}& \cdots &{\frac{{\partial {f_n}(\hat x)}}{{\partial {{\hat x}_n}}}} \end{matrix} \right] \\ & = \sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {{e_n}(i)e_n^{\rm{T}}(j)\frac{{\partial {f_i}(\hat x)}}{{\partial {{\hat x}_j}}}} } , \end{align} | (6) |
\begin{align} \frac{{\partial g(\hat x)}}{{\partial \hat x}} & = \left[\begin{matrix} {\frac{{\partial {g_1}(\hat x)}}{{\partial {{\hat x}_1}}}}& \cdots &{\frac{{\partial {g_1}(\hat x)}}{{\partial {{\hat x}_n}}}}\\ \cdots & \cdots & \cdots \\ {\frac{{\partial {g_p}(\hat x)}}{{\partial {{\hat x}_1}}}}& \cdots &{\frac{{\partial {g_p}(\hat x)}}{{\partial {{\hat x}_n}}}} \end{matrix} \right] \\ & = \sum\limits_{i = 1}^p {\sum\limits_{j = 1}^n {{e_p}(i)e_n^{\rm{T}}(j)\frac{{\partial {g_i}(\hat x)}}{{\partial {{\hat x}_j}}}} } . \end{align} | (7) |
For simplicity, the following notations are used.
\begin{equation*} {\phi _{ij}} \buildrel \Delta \over = \frac{{\partial {f_i}(\hat x)}}{{\partial {{\hat x}_j}}}, {\eta _{ij}} \buildrel \Delta \over = \frac{{\partial {g_i}(\hat x)}}{{\partial {{\hat x}_j}}}, {\varphi _{ij}} \buildrel \Delta \over = \frac{{\partial {f_i}(x)}}{{\partial {x_j}}}, {\xi _{ij}} \buildrel \Delta \over = \frac{{\partial {g_i}(x)}}{{\partial {x_j}}} ; \end{equation*} |
and
\begin{equation*} \phi \buildrel \Delta \over = [{\phi _{11}}, \cdots ,{\phi _{1n}}, \cdots ,{\phi _{n1}}, \cdots ,{\phi _{nn}}] , \end{equation*} |
\begin{equation*} \eta \buildrel \Delta \over = [{\eta _{11}}, \cdots ,{\eta _{1n}}, \cdots ,{\eta _{p1}}, \cdots ,{\eta _{pn}}] , \end{equation*} |
\begin{equation*} \varphi \buildrel \Delta \over = [{\varphi _{11}}, \cdots ,{\varphi _{1n}}, \cdots ,{\varphi _{n1}}, \cdots ,{\varphi _{nn}}] , \end{equation*} |
\begin{equation*} \xi \buildrel \Delta \over = [{\xi _{11}}, \cdots ,{\xi _{1n}}, \cdots ,{\xi _{p1}}, \cdots ,{\xi _{pn}}] . \end{equation*} |
Combined with A1, we assume \phi , \eta , \varphi , and \xi are unknown parameter vectors whose elements satisfy
\begin{equation*} {\underline f_{ij}} \le {\phi _{ij}} \le {\bar f_{ij}}(i,j = 1, \cdots ,n) , \end{equation*} |
\begin{equation*} {\underline g_{ij}} \le {\eta _{ij}} \le {\bar g_{ij}}(i = 1, \cdots ,p,j = 1, \cdots ,n) , \end{equation*} |
\begin{equation*} {\underline f_{ij}} \le {\varphi _{ij}} \le {\bar f_{ij}}(i,j = 1, \cdots ,n) , \end{equation*} |
\begin{equation*} {\underline g_{ij}} \le {\xi _{ij}} \le {\bar g_{ij}}(i = 1, \cdots ,p,j = 1, \cdots ,n) . \end{equation*} |
Notably, the unknown parameters \phi and \varphi belong to the same bounded convex set:
\begin{equation*} {\varsigma _1} = \{\sigma = [{\sigma _{11}}, \cdots ,{\sigma _{1n}}, \cdots ,{\sigma _{n1}}, \cdots ,{\sigma _{nn}}]:{{\underline f}_{ij}} \le {\sigma _{ij}} \le {{\bar f}_{ij}},i = 1, \cdots ,n;j = 1, \cdots ,n \} . \end{equation*} |
Similarly, the unknown parameters \eta and \xi belong to the same bounded convex set as shown below:
\begin{equation*} {\varsigma _2} = \{\chi = [{\chi _{11}}, \cdots ,{\chi _{1n}}, \cdots ,{\chi _{p1}}, \cdots ,{\chi _{pn}}] :{{\underline g}_{ij}} \le {\chi _{ij}} \le {{\bar g}_{ij}},i = 1, \cdots ,p;j = 1, \cdots ,n \} . \end{equation*} |
The tracking error is defined as
\begin{equation} e(t) = y(t) - r(t) . \end{equation} | (8) |
From Eqs (1) and (8), the tracking error satisfies the following:
\begin{align} \dot e(t) & = C\dot x(t) + D\dot u(t) + \frac{{\partial g(x)}}{{\partial x}}\dot x(t) - \dot r(t) \\ & = C(\xi )[{\dot {\hat x}}(t) + \dot \varepsilon (t)] + D\dot u(t) - \dot r(t) , \end{align} | (9) |
where
\begin{equation} C(\xi ) = C + \sum\limits_{i = 1}^p {\sum\limits_{j = 1}^n {{\xi _{ij}}{e_p}(i)e_n^{\rm{T}}(j)} } . \end{equation} | (10) |
Moreover, using Eqs (3), (6), and (7) and the previously described notations, Eq (5) can be rewritten as follows:
\begin{equation} \left\{ \begin{aligned} &\frac{{\rm{d}}}{{{\rm{d}}t}}{\dot {\hat x}}(t) = [A(\phi ) + LG(\xi ,\eta )]{\dot {\hat x}}(t) + LC(\xi )\dot \varepsilon (t) + B\dot u(t)\\ &{\dot {\hat y}}(t) = C(\eta ){\dot {\hat x}}(t) + D\dot u(t) \end{aligned} \right. , \end{equation} | (11) |
where C(\xi) is as stated in Eq (10),
\begin{equation} A(\phi ) = A + \sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {{\phi _{ij}}{e_n}(i)e_n^{\rm{T}}(j)} } , \end{equation} | (12) |
\begin{equation} C(\eta ) = C + \sum\limits_{i = 1}^p {\sum\limits_{j = 1}^n {{\eta _{ij}}{e_p}(i)e_n^{\rm{T}}(j)} } , \end{equation} | (13) |
\begin{equation} G(\xi ,\eta ) = \sum\limits_{i = 1}^p {\sum\limits_{j = 1}^n {({\xi _{ij}} - {\eta _{ij}}){e_p}(i)e_n^{\rm{T}}(j)} }. \end{equation} | (14) |
Combining the first equation of system (11) and Eq (9) yields the following error system:
\begin{equation} \left[ \begin{matrix} {\frac{{\rm{d}}}{{{\rm{d}}t}}{\dot {\hat x}}(t)} \\ {\dot e(t)} \end{matrix} \right] = \left[ \begin{matrix} {A(\phi ) + LG(\xi ,\eta )}&0 \\ {C(\xi )}&0 \end{matrix} \right]\left[ \begin{matrix} {{\dot {\hat x}}(t)} \\ {e(t)} \end{matrix} \right] + \left[ \begin{matrix} {LC(\xi )} \\ {C(\xi )} \end{matrix} \right]\dot \varepsilon (t) + \left[ \begin{matrix} B\\ D \end{matrix} \right]\dot u(t) + \left[ \begin{matrix} 0 \\ { - I} \end{matrix} \right]\dot r(t). \end{equation} | (15) |
According to A2, the information r(\tau)(t \le \tau \le t + {l_r}) of the reference signal r(t) , which ranges from the current time t to the future l_r steps, is known in advance. To use such information to construct the preview compensation mechanism and retain the dynamic process of the system itself, several ingenious mathematical operations are now applied to system (15).
By defining a new state vector \bar x(t) = \left[\begin{matrix} {{\dot {\hat x}}(t)} \\ {e(t) - \int_t^{t + {l_r}} {\dot r(s){\rm{d}}s} } \end{matrix} \right] and a disturbance vector \varpi (t) = \left[\begin{matrix} {\dot \omega (t)} \\ {\dot r(t + {l_r})} \end{matrix} \right] , Eq (15) can be expressed as
\begin{equation} {\dot {\bar x}}(t) = {A_{11}}(\xi ,\phi ,\eta )\bar x(t) + {A_{12}}(\xi )\dot \varepsilon (t) + \bar B\dot u(t) + \bar E\varpi (t), \end{equation} | (16) |
where
\begin{equation*} {A_{11}}(\xi ,\phi ,\eta ) = A_0^{11} + \sum\limits_{i,j = 1}^{p,{n_i}} {{\xi _{{\rm{ij}}}}A_{1ij}^{11}} + \sum\limits_{i,j = 1}^{n,{n_i}} {{\phi _{ij}}A_{2ij}^{11}} + \sum\limits_{i,j = 1}^{p,{n_i}} {({\xi _{ij}} - {\eta _{ij}})A_1^{11}A_{3ij}^{11}}, \end{equation*} |
\begin{equation*} {A_{12}}(\xi ) = \left[\begin{matrix} {LC(\xi )} \\ {C(\xi )} \end{matrix} \right], \bar B = \left[\begin{matrix} B\\ D \end{matrix} \right], \bar E = \left[\begin{matrix} 0&0 \\ 0&{ - I} \end{matrix} \right], \end{equation*} |
with
\begin{equation*} A_0^{11} = \left[\begin{matrix} A&0\\ C&0 \end{matrix} \right], A_{1ij}^{11} = \left[\begin{matrix} 0&0\\ {{e_p}(i)e_n^{\rm{T}}(j)}&0 \end{matrix} \right], A_{2ij}^{11} = \left[\begin{matrix} {{e_n}(i)e_n^{\rm{T}}(j)}&0\\ 0&0 \end{matrix} \right], \end{equation*} |
\begin{equation*} A_1^{11} = \left[\begin{matrix} L\\ 0 \end{matrix} \right], A_{3ij}^{11} = \left[\begin{matrix} {{e_p}(i)e_n^{\rm{T}}(j)}&0 \end{matrix} \right]. \end{equation*} |
Taking the derivatives of both sides of Eq (4) leads to
\begin{equation} \frac{{\rm{d}}}{{{\rm{d}}t}}\dot \varepsilon (t) = [F(\varphi ,\phi ) - LG(\xi ,\eta )]{\dot {\hat x}}(t) + [A(\varphi ) - LC(\xi )]\dot \varepsilon (t) + E\dot \omega (t), \end{equation} | (17) |
where G(\xi, \eta) and C(\xi) are given by Eqs (14) and (10), respectively, and
\begin{equation*} A(\varphi ) = A + \sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {{\varphi _{ij}}{e_n}(i)e_n^{\rm{T}}(j)} }, \end{equation*} |
\begin{equation*} F(\varphi ,\phi ) = \sum\limits_{i = 1}^n {\sum\limits_{j = 1}^n {({\varphi _{ij}} - {\phi _{ij}}){e_n}(i)e_n^{\rm{T}}(j)} }. \end{equation*} |
Combining Eqs (16) and (17), we obtain
\begin{equation} \left\{ \begin{aligned} &{\dot {\bar x}}(t) = {A_{11}}(\xi ,\phi ,\eta )\bar x(t) + {A_{12}}(\xi )\dot \varepsilon (t) + \bar B\dot u(t) + \bar E\varpi (t)\\ &\frac{{\rm{d}}}{{{\rm{d}}t}}\dot \varepsilon (t) = {A_{21}}(\varphi ,\phi ,\xi ,\eta )\bar x(t) + {A_{22}}(\varphi ,\xi )\dot \varepsilon (t) + \tilde E\varpi (t) \end{aligned} \right., \end{equation} | (18) |
where {A_{11}}(\xi, \phi, \eta) , {A_{12}}(\xi) , \bar B and \bar E are as previously described, and
\begin{equation*} {A_{21}}(\varphi ,\phi ,\xi ,\eta ) = A_0^{21} + \sum\limits_{i,j = 1}^{n,{n_i}} {({\varphi _{{\rm{ij}}}} - {\phi _{ij}})A_{1ij}^{21}} + \sum\limits_{i,j = 1}^{p,{n_i}} {({\xi _{ij}} - {\eta _{ij}})LA_{2ij}^{21}}, \end{equation*} |
\begin{equation*} {A_{22}}(\varphi ,\xi ) = A(\varphi ) - LC(\xi ), \tilde E = \left[\begin{matrix} E&0 \end{matrix} \right], \end{equation*} |
with
\begin{equation*} A_0^{21} = 0, A_{1ij}^{21} = \left[\begin{matrix} {{e_n}(i)e_n^{\rm{T}}(j)}&0 \end{matrix} \right], A_{2ij}^{21} = \left[\begin{matrix} {{e_p}(i)e_n^{\rm{T}}(j)}&0 \end{matrix} \right]. \end{equation*} |
To evaluate the system performance, we introduce the following linear quadratic performance function
\begin{equation} J = \int_0^\infty {\left[ {{{(y(t) - r(t + {l_r}))}^{\rm{T}}}{Q_e}(y(t) - r(t + {l_r}))} \right.} + \left. {{{\dot \varepsilon }^{\rm{T}}}(t){Q_\varepsilon }\dot \varepsilon (t) + {{\dot u}^{\rm{T}}}(t)R\dot u(t)} \right]{\rm{d}}t, \end{equation} | (19) |
where {Q_e} > 0, {Q_\varepsilon } > 0 , and R > 0 are weighting matrices that can be tuned based on the designer's experience.
In fact, if we define a performance signal as follows:
\begin{equation} z(t) = M\bar x(t) + Y \dot \varepsilon (t) + N\dot u(t), \end{equation} | (20) |
where
\begin{equation*} M = \left[\begin{matrix} 0&{Q_{\rm{e}}^{1/2}}\\ 0&0\\ 0&0 \end{matrix} \right], Y = \left[\begin{matrix} 0\\ {Q_\varepsilon ^{1/2}}\\ 0 \end{matrix} \right], N = \left[\begin{matrix} 0\\ 0\\ {{R^{1/2}}} \end{matrix} \right]; \end{equation*} |
then, the performance index function (19) can be expressed as the square of the L_{2} norm of the performance signal:
\begin{equation} J = \int_0^\infty {{z^{\rm{T}}}(t)z(t){\rm{d}}t = } \left\| {z(t)} \right\|_2^2. \end{equation} | (21) |
Combining Eqs (18) and (20), we obtain
\begin{equation} \left\{ \begin{aligned} &{\dot {\bar x}}(t) = {A_{11}}(\xi ,\phi ,\eta )\bar x(t) + {A_{12}}(\xi )\dot \varepsilon (t) + \bar B\dot u(t) + \bar E\varpi (t)\\ &\frac{{\rm{d}}}{{{\rm{d}}t}}\dot \varepsilon (t) = {A_{21}}(\varphi ,\phi ,\xi ,\eta )\bar x(t) + {A_{22}}(\varphi ,\xi )\dot \varepsilon (t) + \tilde E\varpi (t)\\ &z(t) = M\bar x(t) + Y\dot \varepsilon (t) + N\dot u(t) \end{aligned} \right.. \end{equation} | (22) |
Notably, system (22) is still in the form of an LPV system. In the study of preview control, it is generally referred to as an AES. By introducing state feedback control to this system, a dynamic output feedback tracking controller with a preview compensation mechanism can be established for the original system (1). At this point, the observer-based robust preview tracking control problem of system (1) is transformed into a robust H_{\infty} controller design problem of system (22) under the performance index (21).
Precisely, the main problem to be addressed is stated as follows:
The controller for system (22) is designed to satisfy these two requirements:
(ⅰ) The closed-loop system of AES (22) with \varpi (t) = 0 is asymptotically stable.
(ⅱ) Under the zero initial condition, the closed-loop system of AES (22) has a prescribed H_{\infty} disturbance attenuation level \gamma > 0 , i.e.,
\begin{equation} \frac{{{{\left\| {z(t)} \right\|}_2}}}{{{{\left\| {\varpi (t)} \right\|}_2}}} \le \gamma, \end{equation} | (23) |
is satisfied for any nonzero \varpi (t) \in {L_2} .
Note that the inequality (23) is also known as the disturbance attenuation condition, which means that the effect of external disturbance \varpi (t) on performance signal z(t) is attenuated at least by a level \gamma .
We say that the closed-loop system is asymptotically stable with H_{\infty} performance level \gamma if the above two requirements are satisfied. The corresponding controller is said to be the robust controller with H_{\infty} performance level \gamma .
For AES (22), we introduce the following state feedback controller:
\begin{equation} \dot u(t) = K \bar x(t), \end{equation} | (24) |
where K is the controller gain matrix to be determined.
With control law (24), the closed-loop system of AES (22) is expressed as follows:
\begin{equation} \left\{ \begin{aligned} &{\dot {\bar x}}(t) = ({A_{11}}(\xi, \phi, \eta ) + \bar BK)\bar x(t) + {A_{12}}(\xi) \dot \varepsilon (t) + \bar E\varpi (t)\\ &\frac{{\rm{d}}}{{{\rm{d}}t}}\dot \varepsilon (t) = {A_{21}}(\varphi, \phi, \xi, \eta)\bar x(t) + {A_{22}}(\varphi, \xi)\dot \varepsilon (t) + \tilde E\varpi (t)\\ &z(t) = (M + NK) \bar x(t) + Y \dot \varepsilon (t) \end{aligned} \right.. \end{equation} | (25) |
Notably, the unknown parameters \phi and \varphi belong to the previously mentioned bounded convex set {\varsigma _1} , whose set of vertices is defined by
\begin{equation*} {\upsilon _{{\varsigma _1}}} = \{ \sigma = [{\sigma _{11}}, \cdots ,{\sigma _{1n}}, \cdots ,{\sigma _{n1}}, \cdots ,{\sigma _{nn}}]:{{\underline f}_{ij}} \le {\sigma _{ij}} \le {{\bar f}_{ij}},i = 1, \cdots ,n;j = 1, \cdots ,n \}. \end{equation*} |
Moreover, the unknown parameters \eta and \xi belong to the previously stated bounded convex set {\varsigma _2} , whose set of vertices is defined by
\begin{equation*} {\upsilon _{{\varsigma _2}}} = \{ \chi = [{\chi _{11}}, \cdots ,{\chi _{1n}}, \cdots ,{\chi _{p1}}, \cdots ,{\chi _{pn}}]:{{\underline g}_{ij}} \le {\chi _{ij}} \le {{\bar g}_{ij}},i = 1, \cdots ,p;j = 1, \cdots ,n \}. \end{equation*} |
For convenience, we define the following matrices:
\begin{equation} {T_1} = \left[\begin{matrix} {{I_{n \times n}}}\\ {{0_{p \times n}}} \end{matrix} \right], {Q_1} = \left[\begin{matrix} {{I_{n \times n}}}&{{0_{n \times p}}} \end{matrix} \right], {T_2} = \left[\begin{matrix} {{0_{n \times p}}}\\ {{I_{p \times p}}} \end{matrix} \right], {T_3} = \left[\begin{matrix} {{I_{n \times n}}}\\ {{0_{p \times n}}} \end{matrix} \right]. \end{equation} | (26) |
Theorem 1. Suppose that A1 and A2 hold. Given scalars \vartheta > 0 and \gamma > 0 , the closed-loop system (25) is asymptotically stable with H_{\infty} performance level \gamma for all admissible uncertainties \varphi , \phi , \xi , and \eta if there exist matrices {P_1} > 0 , {P_2} > 0 , X , U , and V such that
\begin{equation} \left[ \begin{matrix} {{\Theta _{11}}}&*&*&*&*&*\\ {{\Theta _{21}}}&{{\Theta _{22}}}&*&*&*&*\\ {{{\bar E}^{\rm{T}}}}&{{{\tilde E}^{\rm{T}}}}&{ - {\gamma ^2}I}&*&*&*\\ {M{P_1} + NX}&{Y{P_2}}&0&{ - I}&*&*\\ {{\Theta _{51}}}&{ - \vartheta {U^{\rm{T}}}}&0&0&{ - {\rm{Sym}}\{ \vartheta V^{\rm{T}}\} }&*\\ {\vartheta {U^{\rm{T}}}T_3^{\rm{T}}}&{{\Theta _{62}}}&0&0&0&{ - {\rm{Sym}}\{ \vartheta V^{\rm{T}}\} } \end{matrix} \right] < 0 \end{equation} | (27) |
for \forall \varphi \in {\upsilon _{{\varsigma _1}}} , \forall \phi \in {\upsilon _{{\varsigma _1}}} , \forall \xi \in {\upsilon _{{\varsigma _2}}} and \forall \eta \in {\upsilon _{{\varsigma _2}}} , where
\begin{equation*} \begin{aligned} {\Theta _{11}} & = {\rm{Sym}}\{ A(\xi ,\phi ){P_1} + \bar BX + {T_1}UG(\xi ,\eta ){Q_1}\}, \\ {\Theta _{21}} & = {P_2}{C^{\rm{T}}}(\xi )T_2^{\rm{T}} + {C^{\rm{T}}}(\xi ){U^{\rm{T}}}T_3^{\rm{T}} + F(\varphi ,\phi ){Q_1}{P_1} - UG(\xi ,\eta ){Q_1}, \\ {\Theta _{22}} & = {\rm{Sym}}\{ A(\varphi ){P_2} - UC(\xi )\}, \\ {\Theta _{51}} & = \vartheta {U^{\rm{T}}}T_1^{\rm{T}} + G(\xi ,\eta ){Q_1}{P_1} - VG(\xi ,\eta ){Q_1} , \\ {\Theta _{62}} & = - \vartheta {U^{\rm{T}}} + C(\xi ){P_2} - VC(\xi ). \end{aligned} \end{equation*} |
Furthermore, the controller and observer gain matrices are computed as K = XP_1^{ - 1} and L = U{V^{ - 1}} , respectively.
Proof. Consider the following positive-definite Lyapunov function candidate:
\begin{equation} V(\bar x(t),\dot \varepsilon (t)) = {\bar x^{\rm{T}}}(t)P_1^{ - 1}\bar x(t) + {\dot \varepsilon ^{\rm{T}}}(t)P_2^{ - 1}\dot \varepsilon (t). \end{equation} | (28) |
Inspired by [25], the asymptotic stability of the closed-loop system (25) is guaranteed under the prescribed H_{\infty} performance criterion if the following inequality holds:
\begin{equation} \dot V(\bar x(t),\dot \varepsilon (t)) + {z^{\rm{T}}}(t)z(t) - {\gamma ^2}{\varpi ^{\rm{T}}}(t)\varpi (t) \le 0. \end{equation} | (29) |
In fact, by denoting
\begin{equation*} {\Gamma _1} = \left[\begin{matrix} {{{({A_{11}}(\xi ,\phi ,\eta ) + \bar BK)}^{\rm{T}}}}&0&0\\ {A_{12}^{\rm{T}}(\xi )}&0&0\\ {{{\bar E}^{\rm{T}}}}&0&0 \end{matrix} \right], \end{equation*} |
\begin{equation*} {\Gamma _2} = \left[\begin{matrix} 0&{A_{21}^{\rm{T}}(\varphi ,\phi ,\xi ,\eta )}&0\\ 0&{A_{22}^{\rm{T}}(\varphi ,\xi )}&0\\ 0&{{{\tilde E}^{\rm{T}}}}&0 \end{matrix} \right], \end{equation*} |
\begin{equation*} {\Gamma _3} = \left[\begin{matrix} {M + NK}&Y&0 \end{matrix} \right], \end{equation*} |
\begin{equation*} {\rm X}(t) = {\left[\begin{matrix} {{{\bar x}^{\rm{T}}}(t)}&{{{\dot \varepsilon }^{\rm{T}}}(t)}&{{\varpi ^{\rm{T}}}(t)} \end{matrix} \right]^{\rm{T}}}, \end{equation*} |
we have
\begin{align} \dot V(\bar x(t),\dot \varepsilon (t)) & = {{\dot {\bar x}}^{\rm{T}}}(t)P_1^{ - 1}\bar x(t) \!+\! {\bar x^{\rm{T}}}(t)P_1^{ - 1}{\dot {\bar x}}(t) \!+\! \frac{{\rm{d}}}{{{\rm{d}}t}}{\dot \varepsilon ^{\rm{T}}}(t)P_2^{ - 1}\dot \varepsilon (t) + {\dot \varepsilon ^{\rm{T}}}(t)P_2^{ - 1}\frac{{\rm{d}}}{{{\rm{d}}t}}\dot \varepsilon (t) \\ & = {{\rm X}^{\rm{T}}}(t)({\Gamma _1}P_1^{ - 1} \!+\! P_1^{ - 1}\Gamma _1^{\rm{T}} \!+\! {\Gamma _2}P_2^{ - 1} \!+\! P_2^{ - 1}\Gamma _2^{\rm{T}}){\rm X}(t). \end{align} | (30) |
Using Eq (30), the left side of Eq (29) can be reformulated as follows:
\begin{equation} \dot V(\bar x(t),\dot \varepsilon (t)) + {z^{\rm{T}}}(t)z(t) - {\gamma ^2}{\varpi ^{\rm{T}}}(t)\varpi (t) = {{\rm X}^{\rm{T}}}(t)\Omega {\rm X}(t), \end{equation} | (31) |
where
\begin{align*} \Omega & = {\rm {Sym}}\{ {\Gamma _1}P_1^{ - 1} + {\Gamma _2}P_2^{ - 1}\} + \Gamma _3^{\rm{T}}{\Gamma _3} + diag(0,0, - {\gamma ^2}I). \end{align*} |
At this point, the problem is transformed to finding a sufficient condition for \Omega < 0 . By the Schur complement lemma, i.e., Lemma 1, the inequality \Omega < 0 is equivalent to
\begin{equation} \left[ \begin{matrix} {{\rm{Sym}}\{ P_1^{ - 1}({A_{11}}(\xi ,\phi ,\eta ) + \bar BK)\} }&*&*&*\\ {A_{12}^{\rm{T}}(\xi )P_1^{ - 1} + P_2^{ - 1}{A_{21}}(\varphi ,\phi ,\xi ,\eta )}&{{\rm{Sym}}\{ P_2^{ - 1}{A_{22}}(\varphi ,\xi )\} }&*&*\\ {{{\bar E}^{\rm{T}}}P_1^{ - 1}}&{{{\tilde E}^{\rm{T}}}P_2^{ - 1}}&{ - {\gamma ^2}I}&*\\ {M + NK}&Y&0&{ - I} \end{matrix} \right] < 0. \end{equation} | (32) |
By performing the powerful congruence transformation, i.e., premultiplying and postmultiplying the matrix on the left side of Eq (32) by the invertible matrix diag({P_1}, {P_2}, I, I) and its transpose, respectively, we obtain a sufficient condition for inequality (32):
\begin{equation} \left[ \begin{matrix} {{\rm{Sym}}\{ ({A_{11}}(\xi ,\phi ,\eta ) + \bar BK){P_1}\} }&*&*&*\\ {{P_2}A_{12}^{\rm{T}}(\xi ) + {A_{21}}(\varphi ,\phi ,\xi ,\eta ){P_1}}&{{\rm{Sym}}\{ {A_{22}}(\varphi ,\xi ){P_2}\} }&*&*\\ {{{\bar E}^{\rm{T}}}}&{{{\tilde E}^{\rm{T}}}}&{ - {\gamma ^2}I}&*\\ {(M + NK){P_1}}&{Y{P_2}}&0&{ - I} \end{matrix} \right] < 0. \end{equation} | (33) |
Using Eq (26), {A_{11}}(\xi, \phi, \eta) , {A_{12}}(\xi) , and {A_{21}}(\varphi, \phi, \xi, \eta) in Eq (33) can be rewritten as follows:
\begin{equation} {A_{11}}(\xi ,\phi ,\eta ) = A(\xi ,\phi ) + {T_1}LG(\xi ,\eta ){Q_1}, \end{equation} | (34) |
\begin{equation} {A_{12}}(\xi ) = {T_2}C(\xi ) + {T_3}LC(\xi ), \end{equation} | (35) |
\begin{equation} {A_{21}}(\varphi ,\phi ,\xi ,\eta ) = {\rm{ }}F(\varphi ,\phi ){Q_1} - LG(\xi ,\eta ){Q_1}, \end{equation} | (36) |
where
\begin{equation*} A(\xi ,\phi ) = \left[\begin{matrix} {A(\phi )}&0\\ {C(\xi )}&0 \end{matrix} \right]. \end{equation*} |
From Eqs (34)–(36), inequality (33) can be rewritten as follows:
\begin{equation} \left[ \begin{matrix} {{\Lambda _{11}}}&*&*&*\\ {{\Lambda _{21}}}&{{\rm{Sym}}\{ {A_{22}}(\varphi ,\xi ){P_2}\} }&*&*\\ {{{\bar E}^{\rm{T}}}}&{{{\tilde E}^{\rm{T}}}}&{ - {\gamma ^2}I}&0\\ {(M + NK)P_1}&{YP_2}&0&{ - I} \end{matrix} \right] < 0, \end{equation} | (37) |
where
\begin{equation*} {\Lambda _{11}} = {\rm{Sym}}\{ (A(\xi ,\phi ) + {T_1}LG(\xi ,\eta ){Q_1} + \bar BK){P_1}\}, \end{equation*} |
\begin{equation*} {\Lambda _{21}} = {P_2}{[({T_2} + {T_3}L){C(\xi )}]^{\rm{T}}} + [F(\varphi ,\phi ) - LG(\xi ,\eta )]{Q_1}{P_1}. \end{equation*} |
Denote the matrix on the left side of inequality (37) as \Phi . Because of the presence of some nonlinear coupling terms, such as {T_3}LC(\xi){P_2} , the matrix inequality \Phi < 0 cannot be solved directly. To avoid any nonlinearities and make the proposed design scheme easier to handle numerically, the change-of-variable technique and a novel auxiliary matrix approach are used to solve this problem. With the change in variable X = K{P_1} , the controller gain matrix is calculated as K = XP_1^{ - 1} . To conveniently determine the observer gain matrix, we introduce a nonsingular matrix V and define L = U{V^{ - 1}} . Then, the following equation holds:
\begin{equation} LG(\xi ,\eta ){Q_1}{P_1} = U{V^{ - 1}}[G(\xi ,\eta ){Q_1}{P_1} - VG(\xi ,\eta ){Q_1}] + UG(\xi ,\eta ){Q_1}, \end{equation} | (38) |
\begin{equation} LC(\xi ){P_2} = U{V^{ - 1}}[C(\xi ){P_2} - VC(\xi )] + UC(\xi ). \end{equation} | (39) |
From Eqs (38) and (39), the matrix \Phi on the left side of Eq (37) can be re-expressed as follows:
\begin{equation*} \Phi = {\Sigma _1} + {\rm{Sym}}\left\{ {\underbrace {\left[ \begin{matrix} {{{[G(\xi ,\eta ){Q_1}{P_1} - VG(\xi ,\eta ){Q_1}]}^{\rm{T}}}}&0\\ 0&{{{[C(\xi ){P_2} - VC(\xi )]}^{\rm{T}}}}\\ 0&0\\ 0&0 \end{matrix} \right]\left[ \begin{matrix} {{V^{ - {\rm{T}}}}}&0\\ 0&{{V^{ - {\rm{T}}}}} \end{matrix} \right]}_W\underbrace {\left[ \begin{matrix} {{U^{\rm{T}}}T_1^{\rm{T}}}&{ - {U^{\rm{T}}}}&0&0\\ {{U^{\rm{T}}}T_3^{\rm{T}}}&{ - {U^{\rm{T}}}}&0&0 \end{matrix} \right]}_H} \right\}, \end{equation*} |
where
\begin{equation*} {\Sigma _1} = \left[ \begin{matrix} {{S_{11}}}&*&*&*\\ {{S_{21}}}&{{\rm{Sym}}\{ A(\varphi ){P_2} - UC(\xi )\} }&*&*\\ {{{\bar E}^{\rm{T}}}}&{{{\tilde E}^{\rm{T}}}}&{ - {\gamma ^2}I}&*\\ {M{P_1} + NX}&{YP_2}&0&{ - I} \end{matrix} \right], \end{equation*} |
with
\begin{equation*} {S_{11}} = {\rm{Sym}}\{ A(\xi ,\phi ){P_1} + \bar BX + {T_1}UG(\xi ,\eta ){Q_1}\}, \end{equation*} |
\begin{equation*} {S_{21}} = {P_2}{C^{\rm{T}}}(\xi ){T_2}^{\rm {T}} + {C^{\rm{T}}}(\xi )U^{\rm{T}}{T_3}^{\rm{T}} + F(\varphi ,\phi ){Q_1}{P_1} - UG(\xi ,\eta ){Q_1}. \end{equation*} |
According to Lemma 2, the matrix inequality \Phi < 0 is satisfied if the following condition holds:
\begin{equation} \left[\begin{matrix} {{\Sigma _1}}&*\\ {{\Sigma _2}}&{ - {\rm{Sym}}\{ \vartheta V^{\rm {T}}\} } \end{matrix} \right] < 0, \end{equation} | (40) |
where
\begin{eqnarray*} {\Sigma _2} & = & \vartheta {H} + V^{\rm{T}}W^{\rm{T}} \\ & = & \left[\begin{matrix} {\vartheta {U^{\rm{T}}}T_1^{\rm{T}} \!+ G(\xi ,\eta ){Q_1}{P_1} - VG(\xi ,\eta ){Q_1}}&{ - \vartheta {U^{\rm{T}}}}&0&0\\ {\vartheta {U^{\rm{T}}}T_3^{\rm{T}}}&{ - \vartheta {U^{\rm{T}}} + C(\xi ){P_2} - VC(\xi )}&0&0 \end{matrix} \right]. \end{eqnarray*} |
The matrix inequality (40) is equivalent to condition (27) stated in Theorem 1. Hence, if condition (27) is satisfied, then condition (37), i.e., \Phi < 0 , is satisfied. As a result, the condition \Omega < 0 is ensured. This completes the proof of Theorem 1.
Remark 3. Notably, a direct result of the LMI condition (27) being satisfied in Theorem 1 is
\begin{equation} {[A(\varphi ) - LC(\xi )]^{\rm{T}}}P_2^{ - 1}[A(\varphi ) - LC(\xi )] - P_2^{ - 1} < 0 \end{equation} | (41) |
for \forall \xi \in {\upsilon _{{\varsigma _2}}} . Furthermore, by applying the differential mean value theorem to f(x(t)) - f(\hat x(t)) and g(x(t)) - g(\hat x(t)) in dynamic equation (4) for estimation error, the state matrix is A(\varphi) - LC(\xi) . By inequality (41), the estimation error system (4) is asymptotically stable, indicating that the proposed observer system (2) achieves an asymptotic estimation of the true state of system (1). Therefore, the LMI condition stated in Theorem 1 ensures that the state estimation and output tracking errors converge to zero simultaneously as time tends to infinity.
Remark 4. To obtain a robust tracking control structure with superior performance, the disturbance attenuation level \gamma should be reduced as much as possible. Thus, the controller design problem can be formulated as the following minimization problem:
\begin{equation*} \left\{ \begin{aligned} &{\rm{minimize}} \enspace {\gamma ^2}\\ &{\rm{subject \enspace to}} \enspace {P_1} > 0,{P_2} > 0,X,U,V, {\rm and \enspace LMI \enspace (27)} \end{aligned} \right.. \end{equation*} |
Now we discuss the controller design structure of system (1).
If the LMI problem of Theorem 1 has a feasible solution, then the controller gain matrix is calculated as K = XP_1^{ - 1} . To clearly illustrate the structure of the proposed tracking controller, the controller gain matrix K is partitioned as follows:
\begin{equation} K = \left[\begin{matrix} {K_1}&{K_2} \end{matrix} \right], \end{equation} | (42) |
where {K_1} \in {\mathbb R}^{m \times n} and {K_2} \in {\mathbb R}^{m \times p} . As a result, controller (23) can be expressed as follows:
\begin{equation} \dot u(t) = {K_1}{\dot {\hat x}}(t)+{K_2}[e(t) - \int_t^{t + {l_r}} {\dot r(s){\rm{d}}s} ]. \end{equation} | (43) |
To attain the control input u(t) of system (1), we choose a constant \ell satisfying \ell \ge {l_r} and calculate the integral of both sides of Eq (43) over [ - \ell, t] :
\begin{equation*} u(t) - u( - \ell ) = {K_1}(\hat x(t) - \hat x( - \ell )) + {K_2}\int_{ - \ell }^t {e(s){\rm{d}}s} - {K_2}\int_0^{{l_r}} {[r(t + s) - r( - \ell + s)]{\rm{d}}s}. \end{equation*} |
Notably, u(- \ell) = 0 , e(s) = 0{\rm{ }}(- \ell \le s < 0) , \hat x(- \ell) = 0 , and r(- \ell + s) = 0{\rm{ }}(0 \le s \le {l_r}) . Substituting these conditions into the above equation, the second theorem of this paper can be derived.
Theorem 2. Suppose that A1 and A2 hold. If LMI (27) in Theorem 1 has a feasible solution, then the observer-based robust preview tracking controller of system (1) is
\begin{equation} u(t) = {K_1}\hat x(t) + {K_2}\int_0^t {e(s){\rm{d}}s} - {K_2}\int_t^{t + {l_r}} {r(s){\rm{d}}s}, \end{equation} | (44) |
where the estimated state \hat x(t) is given by the observer system (2) with the observer gain matrix L = U{V^{ - 1}} and the controller gain matrices K_1 and K_2 are determined via Eq (42).
Remark 5. The innovation of this paper is the design of an observer-based robust preview controller for Lipschitz nonlinear systems in the form of (1). As shown in Eq (44), the proposed controller consists of three parts. The first part {K_1}\hat x(t) represents the observer-based state feedback control action, the second part {K_2}\int_0^t {e(s){\rm{d}}s} represents the integral control action used to eliminate the steady-state error, and the third part - {K_2}\int_t^{t + {l_r}} {r(s){\rm{d}}s} represents the preview compensation action composed of the known future information of the reference signal. The novel observer-based preview controller design significantly enhances robust tracking control performance.
Remark 6. Recently, the tracking control problem of continuous-time Lipschitz nonlinear systems has received considerable attention. Novel and interesting methods for solving related problems have been proposed [22,25]. Unlike [22], the previewable information of the reference signal is fully used in the controller design in this paper. As such, the proposed tracking controller includes a preview feedforward compensation mechanism, which can improve the output tracking performance of the closed-loop system. Furthermore, compared with the two-step algorithm in [22], the observer-based robust preview tracking controller design method in Theorem 2 is quite simple and straightforward, and the observer and tracking controller gains can be determined simultaneously through a one-step LMI algorithm. Hence, the design complexity and computational load are effectively reduced. In addition, if the full system state information cannot be measured, the preview tracking controller in [25] will not be applicable. In this case, the observer-based preview control method proposed in this paper offers an effective and practical solution. In this sense, our design can be considered an improvement and optimization of techniques in [22,25].
To illustrate the effectiveness and superiority of the proposed control scheme, simulation experiments are performed using a well-known single-link flexible joint robot system and a numerical example in this section. A simulation comparison is performed among the control scheme in [22], the proposed scheme, and the LQR scheme based on linearization via MATLAB software.
Example 1. Consider the well-known single-link flexible joint robot system[19,22,36]
\begin{equation*} \left\{ \begin{aligned} &\dot x(t) = Ax(t) + Bu(t) + f(x(t))\\ &y(t) = Cx(t) \end{aligned} \right., \end{equation*} |
where
\begin{equation*} A = \left[ \begin{matrix} 0 & 1 & 0 & 0 \\ -48.6 & -1.25 & 48.6 & 0 \\ 0 & 0 & 0 & 1 \\ 19.5 & 0 & -19.5 & 0 \\ \end{matrix} \right], B = \left[\begin{matrix} 0 \\ 21.6 \\ 0 \\ 0 \end{matrix} \right], C = \left[\begin{matrix} 12 & 0 & 4 & 0 \end{matrix} \right], f(x) = \left[\begin{matrix} 0 \\ 0 \\ 0 \\ -3.33\sin(x_3) \end{matrix} \right]. \end{equation*} |
The nonlinear term f(x) satisfies A1 with {\underline f_{41}} = {\bar f_{41}} = {\underline f_{42}} = {\bar f_{42}} = {\underline f_{44}} = {\bar f_{44}} = 0, {\underline f_{43}} = -3.33, {\bar f_{43}} = 3.33. {\underline f_{ij}} = {\bar f_{ij}} = 0, i = 1, 2, 3;j = 1, 2, 3, 4 . Suppose that the desired reference signal satisfies A2.
Set {Q_e} = 8, {Q_\varepsilon } = 0.06, R = 8, \gamma = 10, \vartheta = 0.5 . From Theorem 1, by resorting to the LMI toolbox in MATLAB, the observer and tracking controller gain matrices are calculated concurrently as follows:
\begin{equation*} L = {\left[\begin{matrix} {1.0196}&{9.5952}&{0.6080}&{0.0090} \end{matrix} \right]^{\rm{T}}}, \end{equation*} |
\begin{equation*} {K_1} = \left[\begin{matrix} { - 181.9502}&{ - 14.0566}&{ - 368.8490}&{ - 59.9944} \end{matrix} \right], {K_2} = - 51.6386. \end{equation*} |
According to Theorem 2, a robust observer-based preview tracking controller can then be derived.
For simulation, the previewable reference signal is taken as
\begin{equation*} {r(t)} = \left\{ \begin{matrix} 0, & t < 20 \\ 0.15(t-20), & 20\le t\le 40 \\ 3, & t > 40 \\ \end{matrix} \right.. \end{equation*} |
The initial state of the system is x(0) = {\left[\begin{matrix} 0 & 0 & 0 & 0 \end{matrix} \right]^{\rm{T}}} , and the initial state of the observer is set as \hat x(0) = {\left[\begin{matrix} 0.01 & 0 & 0.01 & 0.02 \end{matrix} \right]^{\rm{T}}} .
The output response curve of the closed-loop system is plotted in Figure 1, and the response curves of the tracking error and control input are shown in Figures 2 and 3, respectively. These figures reveal that the system outputs in three methods can realize asymptotic tracking of the reference signal regardless of the effects of disturbance and Lipschitz nonlinearities. Compared with the method in [22] and the LQR method based on linearization, the proposed control scheme forces the output signal to track the reference signal more rapidly and accurately. The excellent tracking performance mainly benefits from the feedforward compensation mechanism of the preview information of the reference signal.
To quantitatively demonstrate the superiority of the proposed method, the ISE, ITSE, IAE, and ITAE deviation integral indicators are evaluated (Table 1). Compared with the method in [22] and the LQR method based on linearization, the proposed method can significantly decrease the integral index values, thereby achieving excellent tracking performance.
Performance Index | Method in [22] | Proposed method l_r = 0.6 | LQR based on linearization |
ISE | 0.1621 | 0.0070 | 4.4076 |
ITSE | 4.8244 | 0.0270 | 146.1312 |
IAE | 1.8807 | 0.1928 | 10.3451 |
ITAE | 54.7718 | 3.1560 | 346.8388 |
To illustrate the excellent observation effect, Figures 4–7 show the response curves of the true and estimated system states. The estimated state provided by the observer converges quickly and accurately to the true state.
Example 2. Consider a nonlinear system in the form of Eq (1) with the following system parameters:
\begin{equation*} A = \left[ \begin{matrix} { - 12}&1\\ 1&{ - 5} \end{matrix} \right], B = \left[ \begin{matrix} 5\\ { - 2.5} \end{matrix} \right], C = \left[ \begin{matrix} 5&1 \end{matrix} \right], E = \left[ \begin{matrix} 1\\ 0 \end{matrix} \right], f(x) = \left[ \begin{matrix} 0\\ {-0.5\sin ({x_2})} \end{matrix} \right], g(x) = 0.1\arctan ({x_2}). \end{equation*} |
The nonlinear terms f(x) and g(x) satisfy A1 with {\underline f_{11}} = {\bar f_{11}} = {\underline f_{12}} = {\bar f_{12}} = {\underline f_{22}} = {\bar f_{22}} = 0, {\underline f_{21}} = -0.5 , {\bar f_{21}} = 0.5. {\underline g_{11}} = {\bar g_{11}} = 0, {\underline g_{12}} = 0, {\bar g_{12}} = 0.1 . Suppose that the desired reference signal satisfies A2.
Set {Q_e} = 1, {Q_\varepsilon} = 0.05, R = 2, \gamma = 2, \vartheta = 0.1 . By Theorem 1, using the LMI toolbox in MATLAB, the observer and tracking controller gain matrices are computed simultaneously as follows:
\begin{equation*} L = {\left[\begin{matrix} {-1.2156}&{-0.4780} \end{matrix} \right]^{\rm{T}}}, \end{equation*} |
\begin{equation*} {K_1} = \left[\begin{matrix} { - 2.7291}&{ - 1.2977} \end{matrix} \right], {K_2} = - 4.6757. \end{equation*} |
According to Theorem 2, a robust observer-based preview tracking controller can then be derived.
For simulation, the reference signal is taken as
\begin{equation*} {r(t)} = \left\{ \begin{matrix} 0, & t < 20 \\ 2, & t \ge 20 \\ \end{matrix} \right.. \end{equation*} |
The external disturbance is considered \omega (t) = \sin (t){e^{ - 0.25t}} , the initial system state is x(0) = {\left[\begin{matrix} 0 & 0 \end{matrix} \right]^{\rm{T}}} , and the initial observer state is \hat x(0) = {\left[\begin{matrix} 0.1 & 0.2 \end{matrix} \right]^{\rm{T}}} .
The output response curve of the closed-loop system is shown in Figure 8, and the response curves of the tracking error and control input are shown in Figures 9 and 10, respectively. By analyzing the simulation graphs, it is evident that compared with the control method in [22] and the LQR method based on linearization, the proposed control method reduces the effects caused by the disturbance and has a faster response speed, lower overshoot, and smaller tracking error. The significant improvement in tracking performance of the closed-loop system is mainly attributed to the feedforward compensation mechanism of the preview information of the reference signal. Numerical simulation results confirm the effectiveness and superiority of the proposed preview controller in improving the system tracking performance.
The quantitative comparison results via some direct and simple performance criteria, such as ISE, ITSE, IAE, and ITAE, are provided in Table 2. As can be seen in the table, the performance indices are decreased when using the proposed controller compared with the method in [22] and the LQR method based on linearization.
Performance Index | Method in [22] | Proposed method l_r = 0.1 | LQR based on linearization |
ISE | 1.0443 | 0.2786 | 1.1768 |
ITSE | 20.0064 | 4.4163 | 20.1584 |
IAE | 1.3770 | 0.8986 | 1.9804 |
ITAE | 18.1620 | 8.0184 | 20.9162 |
Figures 11 and 12 show the response curves of the true and estimated system states. The estimated state provided by the observer produces fast and accurate convergence to the actual system state. The observation performance of the constructed state observer is satisfactory.
Remark 7. The possible challenges for implementing the proposed method in practical applications include the following: (ⅰ) The actual system is complex and variable, making it difficult to mathematically model it in the form of system (1). (ⅱ) Model simplification may lead to deviations between theory and practice. (ⅲ) It is uncertain whether suitable sensors can be found to detect the preview information of the reference signal mentioned in A1 for specific tracking problems.
In this paper, a novel observer-based robust preview tracking controller is designed for a class of continuous-time Lipschitz nonlinear systems with external disturbances and unknown states. First, a state observer is considered to reconstruct the unmeasured system state variables. Second, based on differentiation, the state lifting technique, the differential mean value theorem, and several ingenious mathematical manipulations, an AES, which includes the preview information of a reference signal, is constructed in the form of an LPV system. Thus, the tracking problem is transformed into a robust H_\infty control problem. Based on the Lyapunov stability theory and the LMI approach, a state feedback controller is developed to guarantee that the closed-loop system is asymptotically stable with robust H_\infty performance. Then, by regressing the controller to the original system, an observer-based robust preview tracking controller design is derived. In particular, the preview information of the reference signal is used as feedforward compensation to improve the tracking performance of the system. In addition, the observer and tracking controller gains can be computed via a one-step LMI algorithm. Numerical simulation results demonstrate that the tracking performance of the proposed controller is superior to that of existing controllers.
Xiao Yu: Conceptualization, Methodology, Software, Validation, Writing-original draft, Writing-review & editing; Yan Hua: Conceptualization, Methodology, Software, Validation, Writing-original draft, Writing-review & editing; Yangrong Lu: Writing-review & editing. All authors have read and agreed to the published version of the manuscript.
This work was supported by the National Natural Science Foundation of China (No. 62303280), the Shandong Provincial Natural Science Foundation of China (No. ZR2020QA036, ZR2021MF009, ZR2023MF055), the Shandong Provincial Youth Innovation and Technology Plan for Universities (No. 2021KJ067), the Hubei Provincial Natural Science Foundation of China (No. 2022CFB139) and the Doctoral Research Fund in Shandong Jianzhu University (No. X19053Z).
All authors declare no conflicts of interest in this paper.
[1] |
M. B. Almatrafi, A. Alharbi, New soliton wave solutions to a nonlinear equation arising in plasma physics, Comput. Model. Eng. Sci., 137 (2023), 827–841. https://doi.org/10.32604/cmes.2023.027344 doi: 10.32604/cmes.2023.027344
![]() |
[2] |
C. Dai, J. Zhang, Jacobian elliptic function method for nonlinear differential-difference equations, Chaos Solitons Fract., 27 (2006), 1042–1047. https://doi.org/10.1016/j.chaos.2005.04.071 doi: 10.1016/j.chaos.2005.04.071
![]() |
[3] |
C. Wei, B. Tian, D. Yang, S. Liu, Jacobian-elliptic-function and rogue-periodic-wave solutions of a high-order nonlinear Schrödinger equation in an inhomogeneous optical fiber, Chin. J. Phys., 81 (2023), 354–361. https://doi.org/10.1016/j.cjph.2022.11.023 doi: 10.1016/j.cjph.2022.11.023
![]() |
[4] |
A. M. Wazwaz, The extended tanh method for abundant solitary wave solutions of nonlinear wave equations, Appl. Math. Comput., 187 (2007), 1131–1142. https://doi.org/10.1016/j.amc.2006.09.013 doi: 10.1016/j.amc.2006.09.013
![]() |
[5] |
M. B. Almatrafi, Solitary wave solutions to a fractional model using the improved modified extended tanh-function method, Fractal Fract., 7 (2023), 252. https://doi.org/10.3390/fractalfract7030252 doi: 10.3390/fractalfract7030252
![]() |
[6] |
S. A. Khuri, A complex tanh-function method applied to nonlinear equations of Schrödinger type, Chaos Solitons Fract., 20 (2004), 1037–1040. https://doi.org/10.1016/j.chaos.2003.09.042 doi: 10.1016/j.chaos.2003.09.042
![]() |
[7] |
A. Aasaraai, The application of modified F-expansion method solving the Maccari's system, Br. J. Math. Comput. Sci., 11 (2015), 1–14. https://doi.org/10.9734/BJMCS/2015/19938 doi: 10.9734/BJMCS/2015/19938
![]() |
[8] |
C. L. Bai, C. J. Bai, H. Zhao, A new generalized algebraic method and its application in nonlinear evolution equations with variable coefficients, Z. Naturforsch. A, 60 (2005), 211–220. https://doi.org/10.1515/zna-2005-0401 doi: 10.1515/zna-2005-0401
![]() |
[9] |
S. K. Mohanty, O. V. Kravchenko, M. K. Deka, A. N. Dev, D. V. Churikov, The exact solutions of the 2+1-dimensional Kadomtsev-Petviashvili equation with variable coefficients by extended generalized G^\prime / G-expansion method, J. King Saud Univ. Sci., 35 (2023), 102358. https://doi.org/10.1016/j.jksus.2022.102358 doi: 10.1016/j.jksus.2022.102358
![]() |
[10] |
S. K. Mohanty, O. V. Kravchenko, A. N. Dev, Exact traveling wave solutions of the Schamel Burgers' equation by using generalized-improved and generalized G^\prime / G-expansion methods, Results Phys., 33 (2022), 105124. https://doi.org/10.1016/j.rinp.2021.105124 doi: 10.1016/j.rinp.2021.105124
![]() |
[11] |
Y. Qiu, B. Tian, D. Xian, L. Xian, New exact solutions of nontraveling wave and local excitation of dynamic behavior for GGKdV equation, Results Phys., 49 (2023), 106463. https://doi.org/10.1016/j.rinp.2023.106463 doi: 10.1016/j.rinp.2023.106463
![]() |
[12] |
A. R. Alharbi, M. B. Almatrafi, Exact solitary wave and numerical solutions for geophysical KdV equation, J. King Saud Univ. Sci., 34 (2022), 102087. https://doi.org/10.1016/j.jksus.2022.102087 doi: 10.1016/j.jksus.2022.102087
![]() |
[13] |
A. R. Alharbi, Traveling-wave and numerical solutions to a Novikov-Veselov system via the modified mathematical methods, AIMS Math., 8 (2023), 1230–1250. https://doi.org/10.3934/math.2023062 doi: 10.3934/math.2023062
![]() |
[14] |
A. Alharbi, M. B. Almatrafi, M. A. E. Abdelrahman, Constructions of the travelling wave solutions to the MRLW equation and their stability and accuracy arising in plasma physics, Int. J. Appl. Comput. Math., 9 (2023), 46. https://doi.org/10.1007/s40819-023-01520-8 doi: 10.1007/s40819-023-01520-8
![]() |
[15] |
A. R. Alharbi, A study of traveling wave structures and numerical investigation of two-dimensional Riemann problems with their stability and accuracy, Comput. Model. Eng. Sci., 134 (2023), 2193–2209. https://doi.org/10.32604/cmes.2022.018445 doi: 10.32604/cmes.2022.018445
![]() |
[16] |
A. Alharbi, M. B. Almatrafi, Exact and numerical solitary wave structures to the variant Boussinesq system, Symmetry, 12 (2020), 1473. https://doi.org/10.3390/sym12091473 doi: 10.3390/sym12091473
![]() |
[17] |
T. Han, Z. Li, K. Zhang, Exact solutions of the stochastic fractional long-short wave interaction system with multiplicative noise in generalized elastic medium, Results Phys., 44 (2023), 106174. https://doi.org/10.1016/j.rinp.2022.106174 doi: 10.1016/j.rinp.2022.106174
![]() |
[18] |
T. Han, Z. Li, C. Li, Bifurcation analysis, stationary optical solitons and exact solutions for generalized nonlinear Schrödinger equation with nonlinear chromatic dispersion and quintuple power-law of refractive index in optical fibers, Phys. A, 615 (2023), 128599. https://doi.org/10.1016/j.physa.2023.128599 doi: 10.1016/j.physa.2023.128599
![]() |
[19] |
T. Han, L. Zhao, Bifurcation, sensitivity analysis and exact traveling wave solutions for the stochastic fractional Hirota-Maccari system, Results Phys., 47 (2023), 106349. https://doi.org/10.1016/j.rinp.2023.106349 doi: 10.1016/j.rinp.2023.106349
![]() |
[20] |
T. Han, Z. Zhao, K. Zhang, C. Tang, Chaotic behavior and solitary wave solutions of stochastic-fractional Drinfel'd-Sokolov-Wilson equations with Brownian motion, Results Phys., 51 (2023), 106657. https://doi.org/10.1016/j.rinp.2023.106657 doi: 10.1016/j.rinp.2023.106657
![]() |
[21] |
K. K. Ali, R. Yilmazer, A. Yokus, H. Bulut, Analytical solutions for the (3+1)-dimensional nonlinear extended quantum Zakharov-Kuznetsov equation in plasma physics, Phys. A, 548 (2020), 124327. https://doi.org/10.1016/j.physa.2020.124327 doi: 10.1016/j.physa.2020.124327
![]() |
[22] |
C. Gilson, A. Pickering, Factorization and Painlevé analysis of a class of nonlinear third-order partial differential equations, J. Phys. A, 28 (1995), 2871. https://doi.org/10.1088/0305-4470/28/10/017 doi: 10.1088/0305-4470/28/10/017
![]() |
[23] |
N. A. Mohamed, A. S. Rashed, A. Melaibari, H. M. Sedighi, M. A. Eltaher, Effective numerical technique applied for Burgers' equation of (1+1)-, (2+1)-dimensional, and coupled forms, Math. Meth. Appl. Sci., 44 (2021), 10135–10153. https://doi.org/10.1002/mma.7395 doi: 10.1002/mma.7395
![]() |
[24] |
N. A. Mohamed, Solving one and two-dimensional unsteady Burgers' equation using fully implicit finite difference schemes, Arab J. Basic Appl. Sci., 26 (2019), 254–268. https://doi.org/10.1080/25765299.2019.1613746 doi: 10.1080/25765299.2019.1613746
![]() |
[25] |
N. Mohamed, Fully implicit scheme for solving Burgers' equation based on finite difference method, Egypt. Int. J. Eng. Sci. Technol., 26 (2018), 1687–8493. https://doi.org/10.21608/eijest.2018.97263 doi: 10.21608/eijest.2018.97263
![]() |
[26] |
M. Mohamed, S. M. Mabrouk, A. S. Rashed, Mathematical investigation of the infection dynamics of COVID-19 using the fractional differential quadrature method, Computation, 11 (2023), 198. https://doi.org/10.3390/computation11100198 doi: 10.3390/computation11100198
![]() |
[27] |
T. G. Alharbi, A. Alharbi, A study of traveling wave structures and numerical investigations into the coupled nonlinear Schrödinger equation using advanced mathematical techniques, Mathematics, 11 (2023), 4597. https://doi.org/10.3390/math11224597 doi: 10.3390/math11224597
![]() |
[28] |
A. R. Alharbi, M. B. Almatrafi, Analytical and numerical solutions for the variant Boussinseq equations, J. Taibah Univ. Sci., 14 (2020), 454–462. https://doi.org/10.1080/16583655.2020.1746575 doi: 10.1080/16583655.2020.1746575
![]() |
[29] | A. R. Alharbi, Numerical solution of thin-film flow equations using adaptive moving mesh methods, Keele University Press, 2016. |
[30] |
A. Alharbi, S. Naire, An adaptive moving mesh method for thin film flow equations with surface tension, J. Comput. Appl. Math., 319 (2017), 365–384. https://doi.org/10.1016/j.cam.2017.01.019 doi: 10.1016/j.cam.2017.01.019
![]() |
[31] | C. J. Budd, W. Huang, R. D. Russell, Adaptivity with moving grids, Acta Numer., 18 (2009), 111–241. https://doi.org/10.1017/S0962492906400015 |
[32] | W. Huang, R. D. Russell, Adaptive moving mesh methods, Springer, 2010. https://doi.org/10.1007/978-1-4419-7916-2 |
[33] |
S. H. Alhejaili, A. Alharbi, Structure of analytical and numerical wave solutions for the nonlinear (1+1)-coupled Drinfel'd-Sokolov-Wilson system arising in shallow water waves, Mathematics, 11 (2023), 4598. https://doi.org/10.3390/math11224598 doi: 10.3390/math11224598
![]() |
[34] | A. R. Alharbi, Numerical investigation for the GRLW equation using parabolic Monge Ampere equation, Int. J. Math. Comput. Sci., 15 (2020), 443–462. |
[35] |
C. J. Budd, J. F. Williams, Moving mesh generation using the parabolic Monge-Ampère equation, SIAM J. Sci. Comput., 31 (2009), 3438–3465. https://doi.org/10.1137/080716773 doi: 10.1137/080716773
![]() |
[36] |
A. R. Alharbi, Numerical solutions to two-dimensional fourth order parabolic thin film equations using the Parabolic Monge-Ampere method, AIMS Math., 8 (2023), 16463–16478. https://doi.org/10.3934/math.2023841 doi: 10.3934/math.2023841
![]() |
[37] |
K. L. di Pietro, A. E. Lindsay, Monge-Ampére simulation of fourth order PDEs in two dimensions with application to elastic-electrostatic contact problems, J. Comput. Phys., 349 (2017), 328–350. https://doi.org/10.1016/j.jcp.2017.08.032 doi: 10.1016/j.jcp.2017.08.032
![]() |
[38] |
A. Chen, W. Huang, S. Tang, Bifurcations of travelling wave solutions for the Gilson-Pickering equation, Nonlinear Anal., 10 (2009), 1468–1218. https://doi.org/10.1016/j.nonrwa.2008.07.005 doi: 10.1016/j.nonrwa.2008.07.005
![]() |
[39] |
P. A. Clarkson, E. L. Mansfield, T. J. Priestley, Symmetries of a class of nonlinear third-order partial differential equations, Math. Comput. Modell., 25 (1997), 195–212. https://doi.org/10.1016/S0895-7177(97)00069-1 doi: 10.1016/S0895-7177(97)00069-1
![]() |
[40] | K. K. Ali, H. Dutta, R. Yilmazer, S. Noeiaghdam, Wave solutions of Gilson-Pickering equation, arXiv, 2019. https://doi.org/10.48550/arXiv.1907.06254 |
[41] |
M. Bilal, A. R. Seadawy, M. Younis, S. T. R. Rizvi, K. El-Rashidy, S. F. Mahmoud, Analytical wave structures in plasma physics modelled by Gilson-Pickering equation by two integration norms, Results Phys., 23 (2021), 103959. https://doi.org/10.1016/j.rinp.2021.103959 doi: 10.1016/j.rinp.2021.103959
![]() |
[42] |
H. M. Baskonus, Complex soliton solutions to the Gilson-Pickering model, Axioms, 8 (2019), 18. https://doi.org/10.3390/axioms8010018 doi: 10.3390/axioms8010018
![]() |
[43] |
Y. Kai, Y. Li, L. Huang, Topological properties and wave structures of Gilson-Pickering equation, Chaos Solitons Fract., 157 (2022), 111899. https://doi.org/10.1016/j.chaos.2022.111899 doi: 10.1016/j.chaos.2022.111899
![]() |
[44] |
A. Yokuş, H. Durur, K. A. Abro, D. Kaya, Role of Gilson-Pickering equation for the different types of soliton solutions: a nonlinear analysis, Eur. Phys. J. Plus, 135 (2020), 657. https://doi.org/10.1140/epjp/s13360-020-00646-8 doi: 10.1140/epjp/s13360-020-00646-8
![]() |
[45] |
K. K. Ali, H. Dutta, R. Yilmazer, S. Noeiaghdam, On the new wave behaviors of the Gilson-Pickering equation, Front. Phys., 8 (2020), 54. https://doi.org/10.3389/fphy.2020.00054 doi: 10.3389/fphy.2020.00054
![]() |
[46] |
K. K. Ali, M. S. Mehanna, Traveling wave solutions and numerical solutions of Gilson-Pickering equation, Results Phys., 28 (2021), 104596. https://doi.org/10.1016/j.rinp.2021.104596 doi: 10.1016/j.rinp.2021.104596
![]() |
[47] |
M. M. A. Khater, Physics of crystal lattices and plasma; analytical and numerical simulations of the Gilson-Pickering equation, Results Phys., 44 (2023), 106193. https://doi.org/10.1016/j.rinp.2022.106193 doi: 10.1016/j.rinp.2022.106193
![]() |
[48] | K. W. Morton, D. F. Mayers, Numerical solution of partial differential equations: an introduction, Cambridge University Press, 2005. https://doi.org/10.1017/CBO9780511812248 |
[49] | L. R. Petzold, Description of DASSL: a differential/algebraic system solver, Sandia Natl. Labs., 1982. |
[50] |
P. N. Brown, A. C. Hindmarsh, L. R. Petzold, Using Krylov methods in the solution of large-scale differential-algebraic systems, SIAM J. Sci. Comput., 15 (1994), 1467–1488. https://doi.org/10.1137/0915088 doi: 10.1137/0915088
![]() |
[51] | E. J. Walsh, C. Budd, Moving mesh methods for problems in meteorology, University of Bath Press, 2011. |
Performance Index | Method in [22] | Proposed method l_r = 0.6 | LQR based on linearization |
ISE | 0.1621 | 0.0070 | 4.4076 |
ITSE | 4.8244 | 0.0270 | 146.1312 |
IAE | 1.8807 | 0.1928 | 10.3451 |
ITAE | 54.7718 | 3.1560 | 346.8388 |
Performance Index | Method in [22] | Proposed method l_r = 0.1 | LQR based on linearization |
ISE | 1.0443 | 0.2786 | 1.1768 |
ITSE | 20.0064 | 4.4163 | 20.1584 |
IAE | 1.3770 | 0.8986 | 1.9804 |
ITAE | 18.1620 | 8.0184 | 20.9162 |
Performance Index | Method in [22] | Proposed method l_r = 0.6 | LQR based on linearization |
ISE | 0.1621 | 0.0070 | 4.4076 |
ITSE | 4.8244 | 0.0270 | 146.1312 |
IAE | 1.8807 | 0.1928 | 10.3451 |
ITAE | 54.7718 | 3.1560 | 346.8388 |
Performance Index | Method in [22] | Proposed method l_r = 0.1 | LQR based on linearization |
ISE | 1.0443 | 0.2786 | 1.1768 |
ITSE | 20.0064 | 4.4163 | 20.1584 |
IAE | 1.3770 | 0.8986 | 1.9804 |
ITAE | 18.1620 | 8.0184 | 20.9162 |