
We propose a numerical-based approach extending the conditional MVAR Granger causality (MVGC) analysis for the construction of directed connectivity networks in the presence of both exogenous/stimuli and modulatory inputs. The performance of the proposed scheme is validated using both synthetic stochastic data considering also the influence of haemodynamics latencies and a benchmark fMRI dataset related to the role of attention in the perception of visual motion. The particular fMRI dataset has been used in many studies to evaluate alternative model hypotheses using the Dynamic Causal Modelling (DCM) approach. Based on the use of the Bayes factor, we show that the obtained GC connectivity network compares well to a reference model that has been selected through DCM analysis among other candidate models. Thus, our findings suggest that the proposed scheme can be successfully used as a stand-alone or complementary to DCM approach to find directed causal connectivity patterns in task-related fMRI studies.
Citation: Evangelos Almpanis, Constantinos Siettos. Construction of functional brain connectivity networks from fMRI data with driving and modulatory inputs: an extended conditional Granger causality approach[J]. AIMS Neuroscience, 2020, 7(2): 66-88. doi: 10.3934/Neuroscience.2020005
[1] | Humaira Kalsoom, Muhammad Amer Latif, Muhammad Idrees, Muhammad Arif, Zabidin Salleh . Quantum Hermite-Hadamard type inequalities for generalized strongly preinvex functions. AIMS Mathematics, 2021, 6(12): 13291-13310. doi: 10.3934/math.2021769 |
[2] | Yousaf Khurshid, Muhammad Adil Khan, Yu-Ming Chu . Conformable integral version of Hermite-Hadamard-Fejér inequalities via η-convex functions. AIMS Mathematics, 2020, 5(5): 5106-5120. doi: 10.3934/math.2020328 |
[3] | Nattapong Kamsrisuk, Donny Passary, Sotiris K. Ntouyas, Jessada Tariboon . Quantum calculus with respect to another function. AIMS Mathematics, 2024, 9(4): 10446-10461. doi: 10.3934/math.2024510 |
[4] | Thongchai Botmart, Soubhagya Kumar Sahoo, Bibhakar Kodamasingh, Muhammad Amer Latif, Fahd Jarad, Artion Kashuri . Certain midpoint-type Fejér and Hermite-Hadamard inclusions involving fractional integrals with an exponential function in kernel. AIMS Mathematics, 2023, 8(3): 5616-5638. doi: 10.3934/math.2023283 |
[5] | Muhammad Uzair Awan, Muhammad Aslam Noor, Tingsong Du, Khalida Inayat Noor . On M-convex functions. AIMS Mathematics, 2020, 5(3): 2376-2387. doi: 10.3934/math.2020157 |
[6] | Suphawat Asawasamrit, Muhammad Aamir Ali, Hüseyin Budak, Sotiris K. Ntouyas, Jessada Tariboon . Quantum Hermite-Hadamard and quantum Ostrowski type inequalities for s-convex functions in the second sense with applications. AIMS Mathematics, 2021, 6(12): 13327-13346. doi: 10.3934/math.2021771 |
[7] | Muhammad Umar, Saad Ihsan Butt, Youngsoo Seol . Milne and Hermite-Hadamard's type inequalities for strongly multiplicative convex function via multiplicative calculus. AIMS Mathematics, 2024, 9(12): 34090-34108. doi: 10.3934/math.20241625 |
[8] | Miguel Vivas-Cortez, Muhammad Aamir Ali, Ghulam Murtaza, Ifra Bashir Sial . Hermite-Hadamard and Ostrowski type inequalities in h-calculus with applications. AIMS Mathematics, 2022, 7(4): 7056-7068. doi: 10.3934/math.2022393 |
[9] | Deniz Uçar . Inequalities for different type of functions via Caputo fractional derivative. AIMS Mathematics, 2022, 7(7): 12815-12826. doi: 10.3934/math.2022709 |
[10] | Jamshed Nasir, Shahid Qaisar, Saad Ihsan Butt, Hassen Aydi, Manuel De la Sen . Hermite-Hadamard like inequalities for fractional integral operator via convexity and quasi-convexity with their applications. AIMS Mathematics, 2022, 7(3): 3418-3439. doi: 10.3934/math.2022190 |
We propose a numerical-based approach extending the conditional MVAR Granger causality (MVGC) analysis for the construction of directed connectivity networks in the presence of both exogenous/stimuli and modulatory inputs. The performance of the proposed scheme is validated using both synthetic stochastic data considering also the influence of haemodynamics latencies and a benchmark fMRI dataset related to the role of attention in the perception of visual motion. The particular fMRI dataset has been used in many studies to evaluate alternative model hypotheses using the Dynamic Causal Modelling (DCM) approach. Based on the use of the Bayes factor, we show that the obtained GC connectivity network compares well to a reference model that has been selected through DCM analysis among other candidate models. Thus, our findings suggest that the proposed scheme can be successfully used as a stand-alone or complementary to DCM approach to find directed causal connectivity patterns in task-related fMRI studies.
In recent decades, there has been considerable focus on the control challenges associated with nonlinear systems, driven by the widespread occurrence of nonlinear behavior in modern control systems [1]. Various control strategies, including adaptive output feedback control, adaptive event-triggered control, adaptive backstepping control, and adaptive sliding mode control have been developed [2,3]. The backstepping control technique offers a systematic approach to tackling tracking control problems in nonlinear systems without the need to satisfy matching conditions. This technique involves breaking down the intricate nonlinear system into multiple subsystems and subsequently designing a virtual controller for each subsystem until the actual control law is derived [4]. In previous works, adaptive backstepping controllers and variable structure adaptive backstepping controllers were introduced to address the control problems of specific systems. However, for certain nonlinear systems, obtaining accurate dynamic models proves exceedingly challenging. To address this challenge, researchers have introduced neural networks (NNs) and fuzzy logic systems (FLSs) [5]. Given their ability to identify unknown nonlinear functions, the application of NNs and FLSs in the control of nonlinear systems has garnered significant interest and various studies in this domain have been conducted [6,7,8]. For example, an adaptive NN-based decentralized control approach has been formulated for interconnected nonlinear systems [9]. Additionally, an adaptive method has been reported for stochastic nonlinear systems by using fuzzy approximation and output feedback control [10]. However, it is important to clarify that the studies mentioned above did not consider the fault-tolerance aspect of the controlled system.
Actuators and sensors regularly experience operational disruptions and faults in real-world manufacturing environments, such as those involving flight control systems, satellite operations, and nuclear power facilities [11]. These faults can result in unsatisfactory system performance and, in severe cases, lead to instability. Ensuring system reliability and stability under all circumstances is crucial. As a result, it is crucial to devise an effective fault-tolerant control scheme that ensures the maintenance of stable and satisfactory control performance, even when faults are present [12]. Actuators ultimately age or breakdown entirely due to the increasing complexity and automation of modern control systems, particularly when they are subjected to demanding and prolonged continuous operations [13]. Actuator failures are common in many real-world applications, such as offshore ship-mounted cranes, two-stage chemical reactors and highly adaptable airplanes [14]. To minimize the negative impacts of faults on the system and get it as close to its pre-fault state as possible, fault-tolerant control is required. Adaptive control can simultaneously achieve optimal performance by dynamically modifying the controller design. As a result, combining fault-tolerant control with adaptive control has become a primary area of research to improve the security and dependability of industrial systems [15]. For instance, using the command filter technique, an adaptive fault-tolerant control issue for switched nonlinear systems has been reported [16]. Furthermore, an adaptive fault-tolerant control problem has been explored for a class of nonlinear large-scale systems under the impact of dead-zone nonlinearity [17]. In addition, under the influence of uncertainties in mismatched parameters and disturbances, an adaptive fault-tolerant control problem has been explored for nonaffine nonlinear systems [18]. A model-free adaptive fault-tolerant control technique, relying on NNs, has been documented for discrete-time nonlinear systems in the presence of sensor faults [19]. Despite these accomplishments, to the best of our knowledge, there has been no attention given to fault-tolerant control considering input delay in the existing literature.
Moreover, input delays can stem from the inherent characteristics of the plant or external factors within the system, such as computation time or sensor measurements [20]. This occurrence has the potential to result in a decline in system performance, or even induce instability [21]. Recent efforts have introduced various approaches to tackle adaptive control schemes for nonlinear systems grappling with input delays [22,23]. In [24], the authors have presented a NN-based adaptive control strategy for nonlinear systems facing state constraints and input delays. For single-input single-output uncertain systems with unmodeled dynamics and encompassing unknown constant time delays, an adaptive controller has been formulated using a backstepping design [25]. To address the adaptive fuzzy tracking control problem for nonlinear systems with input delays and output constraints, Pade approximation has been employed [26]. Furthermore, the exploration of adaptive output tracking control for disturbed multiple-input multiple-output switched uncertain nonlinear systems with input delays has been reported [27]. The authors of [28] proposed an adaptive fuzzy control methodology specifically for high-order nonlinear time-delay systems characterized by input saturation and state constraints.
Inspired by these considerations, here, we have undertaken the challenge of formulating an adaptive controller for nonstrict-feedback nonlinear systems featuring actuator faults, external disturbances, and input delays. Notably, considering the existing literature, the following contributions distinguish this work:
(1) Compared with the existing results [1,15], this paper addresses the problem of nonlinear systems with a nonstrict-feedback structure. The proposed control scheme deals with both input delay and actuator faults in nonlinear systems. Instead of employing the auxiliary system from previous research [29], this study utilizes the Pade approximation method to address the issue of input delay. It introduces the variable xn+1 to handle input delay, thereby simplifying the design process. In addition, external disturbance is also considered in this work. This demonstrates the versatility and real-world usefulness of the proposed control strategy.
(2) By utilizing the capabilities of radial basis function NNs, this study employs a backstepping method to create an adaptive fault-tolerant controller through the application of Lyapunov stability theory. The controller ensures that all signals in the closed-loop systems are bounded and tracking errors converge to a small area around the starting point. The effectiveness of the proposed method is confirmed through comparisons with existing results by using error assessment criteria.
This article is organized into the following sections. The problem formulation and preliminary information are provided in Section 2. Section 3 presents the main results. The results of the simulation are then covered in Section 4, and the conclusion is given in Section 5.
Consider the following type of nonstrict-feedback nonlinear system with input delays and actuator faults:
{˙xi=fi(x)+xi+1+di(t),1≤i≤n−1,˙xn=fn(x)+u(v(t−τ))+dn(t),y=x1, | (2.1) |
where x=[x1,…,xn]T is the state variable, fi(.) denotes the unknown nonlinear function with fi(0)=0, v is the controller input to be designed, u is the system input that is subject to actuator fault, τ is the input delay, which is a positive constant, y is the system output, di(.) represents the external disturbance, and di(.) satisfies |di(.)|≤ˉdi, with ˉdi being the constant.
In this study, the input delay problem is addressed by estimating the input delay of the systems using the Pade approximation, as described in [30]. The Pade approximation is characterized as follows:
L{u(v(t−τ))}=exp(−τs)L{u(v(t))}≈1−τs21+τs2L{u(v(t))}, | (2.2) |
where s is the Laplace variable and L{u(v(t))} is the Laplace transform of u(t).
Describe the new variable xn+1 as follows:
L{xn+1(t)}=1−τs21+τs2L{u(v(t))}+L{u(v(t))}. | (2.3) |
By the inverse Laplace transform and ρ=2td, one has
˙xn+1=4τu(v(t))−2τxn+1=2ρu(v(t))−ρxn+1. | (2.4) |
By using (2.2)–(2.4), the system (2.1) can be rewritten as follows:
{˙xi=fi(xi)+xi+1+di(t),1≤i≤n−1,˙xn=fn(xn)+xn+1−u(v(t))+dn(t),˙xn+1=−ρxn+1+2ρu(v(t)),y=x1, | (2.5) |
where u(v(t)) denotes the system input that is subject to actuator fault described by
u(v(t))=λ(t,tλ)v+ur(t,tr), | (2.6) |
where λ(t,tλ)∈[0,1] indicates the effectiveness of the actuation. v is a control signal, and tλ denotes the time instant at which an actuation effectiveness fault will occur. An uncontrollable additive actuation fault is represented by ur(t,tr), and the instant an additive actuation fault occurs is indicated by tr [31].
By using (2.6), the nonlinear system (2.5) can be rewritten as follows:
{˙xi=fi(xi)+xi+1+di(t),1≤i≤n−1,˙xn=fn(xn)+xn+1−λ(t,tλ)v−ur(t,tr)+dn(x,t),˙xn+1=−ρxn+1+2ρλ(t,tλ)v+2ρur(t,tr),y=x1. | (2.7) |
Remark 2.1. xn+1 is a newly introduced variable that manages the input delay. xn+1 can be considered an intermediate rather than the system state variable [30].
The control goal is to formulate an adaptive fault-tolerant controller for the system (2.1) ensures that all signals within the closed-loop exhibit semi-globally uniformly ultimately bounded (SGUUB) behavior, and that the tracking error converges to a compact region around the origin. To achieve this goal, the following assumptions and lemmas are necessary.
Assumption 2.1. [1] The desired trajectory signal yd(t) and its time derivatives up to the nth order are assumed to be continuous and bounded.
Assumption 2.2. [31] The unknown time-varying functions λ(t,tλ) and ur(t,tr) are bounded. Thus, there exist positive constants λmin and umax such that λmin<λ(t,tλ)≤1 and |ur(t,tr)|≤umax.
Remark 2.2. Assumption 2.1 ensures the boundedness of the reference signal yd(t) and its time derivatives y(n)d(t), thus guaranteeing the boundedness of all variables throughout the backstepping derivation. This assumption is a standard practice in the design of adaptive controllers, has been demonstrated in various works, including [1,2,5,6]. The control gain λ(t,tλ) and the uncontrollable additive actuation fault ur(t,tr) are unknown, as stated in Assumption 2.2. As such, the traditional stability requirement is no longer applicable [31].
Radial basis function neural networks (RBFNNs). In this work, an RBFNN [32] is used to approximate the continuous function fi(X):Rn→R. The RBFNN is expressed in the following form:
f(X)=WTS(X), | (2.8) |
where X∈ΩX⊂Rq represents the input vector and W=[w1,…,wl]T∈Rl denotes the weight vector of the RBFNN, where l(>1) is the number of nodes. Additionally, S(X)=[s1(X),…,sl(X)]T∈Rl is the basis function vector, and si(X) is given by
si(X)=exp(−(X−μi)T(X−μi)ζ2),1≤i≤l, | (2.9) |
where μi=[μi1,…,μiq]T and ζ denotes the center and the width of the Gaussian function.
As illustrated in [32], the function f(X) is continuous and defined on a compact set ΩX. For any ε>0, there exists an RBFNN represented as W∗TS(X) such that the following relationship holds:
f(X)=W∗TS(X)+δ(X),∀X∈ΩX, | (2.10) |
where δ(X) represents the approximation error with |δ(X)|<ε i, W∗ is the ideal weight vector defined as
W∗=argminW∈RlsupX∈ΩX|f(X)−WTS(X)|. | (2.11) |
Lemma 2.1. [32] Let S(X)=[s1(X),…,sl(X)]T denote the basis function vector of the RBFNN, and X=[x1,…,xn]T represent the input vector. For an arbitrary integer m≤n, let Xm=[x1,…,xm]T. The following inequality holds:
‖S(X)‖2≤‖S(Xm)‖2. | (2.12) |
Lemma 2.2. [4] For all (m,n)∈R2 and ϵ>0, the following inequality holds:
mn≤ϵpp|m|p+1qϵp|n|q, | (2.13) |
where p>1, q>1, and (p−1)(q−1)=1.
Remark 2.3. Lemma 2.1 explains an important and basic structural feature of RBFNNs. It is important to emphasize that, in the context of backstepping design, Lemma 2.1 plays a crucial role in managing the complete state variables [32].
In this section, a design procedure for an adaptive fault-tolerant controller based on the backstepping method for the system (2.1) will be developed. The proposed design procedure consists of n steps, designed for an n-th order system. To design the controller, the first step involves a change of coordinates given by
{e1=x1−yd,ei=xi−αi−1,i=1,2,…,n−1,en=xn−αn−1+xn+1ρ, | (3.1) |
where αi−1 stands for the virtual control law that will be introduced later. To obtain the main results, the controller design process is separated into n steps.
Step 1. By using (2.7) and (3.1), the time derivative of e1 is given by
˙e1=˙x1−˙yd=f1(x)+x2+d1(t)−˙yd. | (3.2) |
Choose the following Lyapunov function V1 as follows:
V1=12e21+12r1˜θ21, | (3.3) |
where e1=x1−yd, r1>0 is a design constant, and ˜θ1=θ1−ˆθ1 represents the estimation error, with ˆθ1 denoting the estimate of the unknown parameter θ1, defined as θ1=‖W∗1‖2.
Then, by taking the time derivative of V1, one has
˙V1=e1˙e1−1r1˜θ1˙ˆθ1=e1(f1(x)+e2+α1+d1(t)−˙yd)−1r1˜θ1˙ˆθ1=e1(ˉf1(X1)+e2+α1+d1(t))−12e21−1r1˜θ1˙ˆθ1, | (3.4) |
where ˉf1(X1)=f1(x)+12e1−˙yd.
In (3.4), it is evident that ˉf1(X1) contains the unknown smooth function f1. Consequently, the RBFNN W∗T1S(X1) is employed to characterize ˉf1(X1) in such a way that, for any given constant ε1>0,
ˉf1(X1)=W∗T1S1(X1)+δ1(X1),|δ1(X1)|≤ε1, | (3.5) |
where X1=[x1,…,xn]T, and δ1(Z1) represents the estimation error.
By utilizing Lemmas 2.1 and 2.2, one has
e1ˉf1(X1)=e1(W∗T1S1(X1)+δ1(X1))≤|e1|(‖W∗1‖‖S1(X1)‖+ε1)≤|e1|(‖W∗1‖‖S1(Z1)‖+ε1)≤12a21e21θ1ST1(Z1)S1(Z1)+a212+e212+ε212, | (3.6) |
where θ1=‖W∗1‖2, Z1=[x1]T, and a1>0 is a constant.
By using Young's inequality, one has
e1d1(t)≤e212+ˉd212, | (3.7) |
where ˉd1>0 is a constant.
The design of the virtual control law α1 is formulated as follows:
α1=−k1e1−12a21e1ˆθ1ST1(Z1)S1(Z1), | (3.8) |
where k1>0 and a1>0 are the design parameters.
By using Lemma 2.2 and (3.8), one has
e1α1≤=−k1e21−12a21e21ˆθ1ST1(Z1)S1(Z1). | (3.9) |
By incorporating (3.6)–(3.9) into (3.4), we have
˙V1≤−k1e21+(12a21e21ST1(Z1)S1(Z1))(θ1−ˆθ1)+ˉd212+a212+e212+ε212−1r1˜θ1˙ˆθ1. | (3.10) |
Given that ˜θ1=θ1−ˆθ1, (3.10) becomes
˙V1≤−k1e21+ˉd212+a212+e212+ε212+1r1˜θ1(12a21r1e21ST1(Z1)S1(Z1)−˙ˆθ1). | (3.11) |
The adaptive law ˙ˆθ1 is formulated as follows:
˙ˆθ1=r12a21e21ST1(Z1)S1(Z1)−ϑ1ˆθ1,ˆθ1(0)≥0, | (3.12) |
where r1>0 and a1>0 represent the design parameters.
By substituting (3.12) into (3.11), one has
˙V1≤−k1e21+e1e2+1r1ϑ1˜θ1ˆθ1+a12+ε212+ˉd212. | (3.13) |
Step i (i=1,2,…,n−1). According to (3.1) and (2.7), the time derivative of ei is given by
˙ei=˙xi−˙αi−1=fi(x)+xi+1+di(t)−˙αi−1. | (3.14) |
We can obtain the derivative of αi−1 as follows:
˙αi−1=i−1∑j=0∂αi−1∂y(j)dy(j+1)r+i−1∑j=1∂αi−1∂xj(fj(x)+xj+1+dj(x,t))+i−1∑j=1∂αi−1∂θj˙θj. | (3.15) |
Consider a Lyapunov function as follows:
Vi=Vi−1+12e2i+12ri˜θ2i, | (3.16) |
where ei=xi−αi−1, ˜θi=θi−ˆθi is the estimation error, and ri>0 is a design constant.
Further, the dynamics of Vi are given by
˙Vi≤˙Vi−1+ei(fi(x)+ei+1+αi+di(t)−˙αi−1)−1ri˜θi˙ˆθi. | (3.17) |
The derivative of Vi−1 is given as follows:
˙Vi−1≤−i−1∑j=1kje2j+ei−1ei+i−1∑j=11rjϑj˜θjˆθj+i−1∑j=1(a2j2+ε2j2+ˉd2j2). | (3.18) |
By incorporating (3.16) into (3.15), one has
˙Vi≤−i−1∑j=1kje2j+ei−1ei+i−1∑j=11rjδj˜θjˆθj+i−1∑j=1(a2j2+ε2j2+ˉd2j2)+zi(ˉfi(Xi)+ei+1+di(t)+αi)−1ri˜θi˙ˆθi−12e2i, | (3.19) |
where ˉfi(Xi)=fi(x)−˙αi−1+12ei. The function ˉfi(Xi) involves the unknown smooth function fi. Consequently, the RBFNN W∗TiSi(Xi) is utilized to approximate the unknown function ˉfi(Xi), ensuring that, for any positive εi>0,
ˉfi(Xi)=W∗TiSi(Xi)+δi(Xi),|δi(Xi)|<εi, | (3.20) |
where Xi=[x1,…,xn,ˆθ1,…,ˆθi−1,λ1,…,λi]T.
Applying a similar approach as in (3.6), one has
eiˉfi≤12a2iz2iθiSTi(Zi)Si(Zi)+a2i2+e2i2+ε2i2, | (3.21) |
where Zi=[x1,…,xi,ˆθ1,…,ˆθi−1]T, θi=‖W∗i‖2, and ai>0 is a design parameter.
Applying Young's inequality, we have
eidi(t)≤e2i2+ˉd2i2, | (3.22) |
where ˉdi>0 is a constant.
The virtual control input signal αi can be selected as follows:
αi=−kiei−ei−1−12a2ieiˆθiSTi(Zi)Si(Zi), | (3.23) |
where ki and ai are positive design constants.
By using Lemma 2.2 and (3.23), one has
eiαi≤=−kie2i−12a2ie2iˆθiSTi(Zi)Si(Zi). | (3.24) |
By incorporating (3.21)–(3.24) into (3.19), we have
˙Vi≤−i∑j=1kje2j+ei+1ei+i−1∑j=11rjϑj˜θjˆθj+i∑j=1(a2j2+ε2j2+ˉd2j2)+(12a2ie2iSTi(Zi)Si(Zi))(θi−ˆθi)−1ri˜θi˙ˆθi. | (3.25) |
Given that ˜θi=θi−ˆθi, (3.25) becomes
˙Vi≤−i∑j=1kje2j+ei+1ei+i−1∑j=11rjϑj˜θjˆθj+i∑j=1(a2j2+ε2j2+ˉd2j2)+1r1˜θi(12a2irie2iSTi(Zi)Si(Zi)−˙ˆθi). | (3.26) |
The adaptive law ˙ˆθi can be selected as follows:
˙ˆθi=ri2a2ie2iSTi(Zi)Si(Zi)−ϑiˆθi, | (3.27) |
where ri and ϑi are positive design constants.
Moreover, by substituting (3.27) into (3.26), one has
˙Vi≤−i∑j=1kje2j+ei+1ei+i∑j=11rjϑj˜θjˆθj+i∑j=1(a2j2+ε2j2+ˉd2j2). | (3.28) |
Step n. According to (3.1) and (2.7), the time derivative of en is given by
˙en=˙xn−˙αn−1=fn(xn)+xn+1−λ(t,tλ)v−ur(t,tr)+dn(t)−˙αn−1+˙xn+1ρ, | (3.29) |
where αn−1 is defined as follows:
˙αn−1=n−1∑j=0∂αn−1∂y(j)dy(j+1)r+n−1∑j=1∂αn−1∂xj(fj(x)+xj+1+dj(t))+n−1∑j=1∂αn−1∂θj˙θj. | (3.30) |
Take the Lyapunov function as follows:
Vn=Vn−1+12e2n+12rn˜θ2n, | (3.31) |
where ˜θn=θn−ˆθn represents the estimation error and rn>0 represents the design constant.
Further, the dynamics of Vn are given by
˙Vn≤˙Vn−1+en(fn(xn)+xn+1−λ(t,tλ)v−ur(t,tr)+dn(t)−˙αn−1+−ρxn+1ρ+2ρλ(t,tλ)vρ+2ρur(t,tr)ρ)−1rn˜θn˙ˆθn≤˙Vn−1+en(fn(xn)+xn+1−λ(t,tλ)v−ur(t,tr)+dn(t)−˙αn−1−xn+1+2λ(t,tλ)v+2ur(t,tr))−1rn˜θn˙ˆθn≤˙Vn−1+en(fn(xn)+λ(t,tλ)v+ur(t,tr)+dn(t)−˙αn−1)−1rn˜θn˙ˆθn. | (3.32) |
The derivative of Vn−1 is given as follows:
˙Vn−1≤−n−1∑j=1kje2j+n−1∑j=11rjϑj˜θjˆθj+n−1∑j=1(a2j2+ε2j2+ˉd2j2). | (3.33) |
By incorporating (3.29) into (3.28), one has
˙Vn≤−n−1∑j=1kje2j+n−1∑j=11rjδj˜θjˆθj+n−1∑j=1(a2j2+ε2j2+ˉd2j2)+en(ˉfn(Xn)+λ(t,tλ)v+ur(t,tr)+dn(t))−1rn˜θn˙ˆθn−12e2n, | (3.34) |
where ˉfn(Xn)=fn(x)−˙αn−1+12en. The function ˉfn(Xn) involves the unknown smooth function fn. Therefore, the RBFNN W∗TnSn(Xn) is employed to estimate the unknown function ˉfn(Xn), ensuring that, for any positive εn>0,
ˉfn(Xn)=WTnSn(Xn)+δn(Xn),|δn(Xn)|<εn, | (3.35) |
where Xn=[x1,…,xn,ˆθ1,…,ˆθn−1]T.
Applying a similar approach as in (3.6), one has
enˉfn≤12a2nz2nθnSTn(Zn)Sn(Zn)+a2n2+e2n2+ε2n2, | (3.36) |
where Zn=[x1,…,xn,ˆθ1,…,ˆθn−1]T, θn=‖W∗n‖2, and an>0 is a design parameter.
Applying Young's inequality, we have
endn(t)≤e2n2+ˉd2n2, | (3.37) |
where ˉdn>0 is a constant.
Utilizing Lemma 2.2 and considering Assumption 2.2, we have
enur(t,tr)≤e2n2+u2max2. | (3.38) |
The real control law v can be selected as follows:
v=−knen−en−1−12a2nenˆθnSTn(Zn)Sn(Zn), | (3.39) |
where kn and an are positive design constants.
By using Lemma 2.2, Assumption 2.2 and (3.39), one has
env≤=−knλmine2n−enen−1−12a2ne2nˆθnSTn(Zn)Sn(Zn). | (3.40) |
By incorporating (3.36)–(3.40) into (3.34), we have
˙Vi≤−n−1∑j=1kje2j−knλmine2n+i−1∑j=11rjϑj˜θjˆθj+i∑j=1(a2j2+ε2j2+ˉd2j2)+u2max2+(12a2ne2nSTn(Zn)Sn(Zn))(θn−ˆθn)−1rn˜θi˙ˆθn. | (3.41) |
Given that ˜θn=θn−ˆθn, (3.41) becomes
˙Vn≤−n−1∑j=1kje2j−knλmine2n+n−1∑j=11rjϑj˜θjˆθj+n∑j=1(a2j2+ε2j2+ˉd2j2)+u2max2+1rn˜θn(12a2nrne2nSTn(Zn)Sn(Zn)−˙ˆθn). | (3.42) |
The adaptive law ˙ˆθn can be selected as follows:
˙ˆθn=rn2a2ne2nSTn(Zn)Sn(Zn)−ϑnˆθn, | (3.43) |
where rn and ϑn are positive design constants.
Furthermore, it results from substituting (3.43) into (3.42) and applying Assumption 2.2 that
˙Vn≤−n−1∑j=1kje2j−knλmine2n+n∑j=11rjϑj˜θjˆθj+n∑j=1(a2j2+ε2j2+ˉd2j2)+u2max2. | (3.44) |
Theorem 3.1. Consider the nonstrict feedback nonlinear system (2.1) with input delay and actuator faults under Assumptions 2.1 and 2.2, the real controller (3.39), the virtual control laws (3.8) and (3.23), and the adaptive laws (3.12), (3.27) and (3.43). The presented control scheme guarantees the achievement of the following control objectives: (1) The SGUUB nature of all variables within the closed-loop system. (2) The convergence of the system's tracking error to a compact region around the origin.
Proof. By studying the definition of ˜θj, one has
˜θjˆθj≤θ2j−˜θ2j. | (3.45) |
By substituting (3.45) into (3.44), we have
˙Vn≤−n−1∑j=1kje2j+knλmine2n+n∑j=11rjϑjθ2j−n∑j=11rjϑj˜θ2j+n∑j=1(a2j2+ϵ2j2+ˉd2j2)+u2max2=−n−1∑j=1kje2j+knλmine2n−n∑j=11rjϑj˜θ2j+n∑j=1(1rjϑjθ2j+a2j2+ϵ2j2+ˉd2j2)+u2max2≤−a0n∑j=1(12e2j+12rj˜θ2j)+b0≤−a0Vn+b0, | (3.46) |
where a0=2m, m=min{k1,…,knλmin,ϑ1,…,ϑn}, and b0=∑nj=1(ϑjθ2jrj+a2j2+ϵ2j2+ˉd2j2)+u2max2.
Integrating (3.46) over the interval [0,t], we can derive the following inequality:
Vn(t)≤Vn(0)e−a0t+b0a0(1−e−a0t). | (3.47) |
Considering the definition of Vn in (3.31) and the inequality (3.47), it can be inferred that ei (i=1,…,n) and θi (i=1,…,n) are bounded. Taking e1=x1−yd and the boundedness of e1 and yd into account, it implies that the state x1 is bounded. For ei=xi−αi−1 and the definition of the virtual control signal αi (i=1,…,n−1) along with Assumption 2.1, it can be concluded that xi (i=2,…,n) remains bounded. Additionally, from (3.39), it can be deduced that the control v is also bounded. Therefore, all signals in the closed-loop system are SGUUB. Moreover, based on (3.47), one has
e21≤2(V(0)−b0a0)e−a0t+b0a0. | (3.48) |
Hence, the proof is completed.
Figure 1 depicts the architecture of the control scheme that is being discussed.
Remark 3.1. Improved tracking performance is achievable by reducing the IC values. However, it is crucial to carefully select the appropriate ascertained. Furthermore, as can be ascertained from (3.46), the tracking error decreases as the parameters ki, ϑi increase and bi decreases. It is important to keep in mind that selecting a sufficiently high value for ki and ϑi results in a larger control energy. Typically, both initial conditions and design parameters are determined through a trial-and-error method, where system performance is observed and adjustments are made accordingly. Therefore, it is essential to design the parameters appropriately in real-world engineering settings to achieve improved transient performance and efficient control action while avoiding excess control energy.
In this section, the efficacy of the presented control schemes will be assessed through the two examples. The methodology outlined in Theorem 3.1 will be employed to formulate controllers to regulate the considered systems.
Example 4.1. Consider the following nonstrict-feedback nonlinear system:
{˙x1=x2+1−cos(x1x3)+x3+x2+0.5cos(t),˙x2=x3+x21x3e−x22+sin(0.5t),˙x3=u(v(t−τ))+x1x22e−x23+x3sin(x1x2),y=x1, | (4.1) |
where f1(x)=1−cos(x1x3)+x3+x2, f2(x)=x21x3e−x22, f3(x)=x1x22e−x23+x3sin(x1x2), d1(t)=0.5cos(t), d2(t)=sin(0.5t), d3(t)=0, τ=1.5s.
The reference signal was set as yd=0.5(sin(t)+0.5sin(0.5t)). The system input subject to actuator fault described by u(v(t))=λ(t,tλ)v+ur(t,tr) with λ(t,tλ)=0.4+0.6exp(−0.2t), and ur(t,tr)=cos2(x1)x2. The following virtual control laws, real control law and, adaption laws are considered:
αi=−kiei−ei−1−12a2ieiˆθiSTi(Zi)Si(Zi),i=1,2.v=−k3e3−e2−12a23e3ˆθ3ST3(Z3)S3(Z3),˙ˆθi=ri2a2ie2iSTi(Zi)Si(Zi)−ϑiˆθi,i=1,2,3. | (4.2) |
The center of the receptive field was chosen as μi=[−1.5,−1,−0.5,0,0.5,1,1.5]T for i=1,2,3, and the Gaussian function's width was set to ζ=2. In the simulation, the design parameters were determined using the trial-and-error method, as follows: k1=k2=3, k3=6, a1=a2=a3=3, ϑ1=1, ϑ2=1, ϑ3=1, r1=1, r2=1, r3=1. The simulation began with ICs set via the trial-and-error method as [x1(0),x2(0),x3(0)]T=[0.5,0.5,0.5]T and [ˆθ1(0),ˆθ2(0),ˆθ3(0)]=[0,0,0].
The simulation results are depicted in Figures 2–7. Figure 2 illustrates the trajectories of the system output y=x1 and the reference signal yd. As observed in Figure 2, the output y=x1 adeptly tracks the reference signal yd with bounded error, and the tracking error e1 is depicted in Figure 3. The trajectories of x2 and x3 are presented in Figure 4. Figure 5 showcases the bounded adaptive laws ˆθ1, ˆθ2, and ˆθ3, while Figure 6 displays the control input v and system input u. The simulation results affirm that the proposed controller ensures the boundedness of all signals within the closed-loop system.
In this study, the effectiveness of the proposed method was validated through a comparison with an existing control approach [29] that utilizes auxiliary systems to minimize the effects of input delay. In contrast to the established control method, the proposed approach integrates Pade approximation. The comparison results, illustrated in Figure 7, clearly demonstrate a slight yet consistent improvement in tracking error under the proposed control method relative to the existing approach [29].
Figures 2–7 collectively highlight that, through judicious parameter adjustments, the designed controller effectively constrains all closed-loop system signals. This validation demonstrates the effectiveness of the proposed controller.
Moreover, error assessment criteria [33] were employed to substantiate the effectiveness of the proposed method in comparison to the existing approach [29]. For a given pair of data points (yi(t),yid(t)) in the interval t∈[1,P] with P as the observations in the data set, the assessment error criteria were as follows:
Mean squared error (MSE):=P∑t=1(yi(t)−yid)2P;Root mean squared error (RMSE):=√1PP∑t=1(yi(t)−yid(t))2;Maximum absolute error (MAE):=max1≤t≤P|yi(t)−yid(t)|;Normalized mean squared error (NMSE):=∑Pt=1(yi(t)−yid(t))2∑Pt=1(yi(t)−¯yid)2;Sum of squared rrror (SSE):=P∑t=1(yi(t)−yid(t))2;Best fit rate (BFR):=1−∑Pt=1(yi(t)−yid(t))2∑Pt=1(yi(t)−¯yid)2×100%, |
where ¯yid represents the mean of yid(t).
The results, as depicted in Table 1, demonstrate a marginal improvement in the proposed control scheme relative to the existing control method [29]. This enhancement provides compelling evidence of the effectiveness of the proposed control approach.
Methods | MSE | RMSE | MAE | NMSE | SSE | BFR |
Proposed method | 0.0160 | 0.1266 | 0.5375 | 0.0998 | 6.6997 | 99.90% |
Existing method in [29] | 0.0171 | 0.1307 | 0.5187 | 0.1045 | 8.2522 | 99.90% |
Remark 4.1. Understanding the convergence dynamics of the system components is largely dependent on the time constant and half-life analyses. In Figure 2, the modest convergence speed for x1 is indicated by a time constant of 19.6239 seconds, indicating that it takes about 0.3651 seconds to reach half of its initial value. In Figure 3, a longer time constant of 32.6245 seconds is shown by the tracking error (e1), which suggests a slower rate of convergence with a half-life of roughly 0.2685 seconds. In Figure 5, ˆθ1, ˆθ2, and ˆθ3 are shown to have time constants of 121.8149 seconds, 11.4806 seconds, and 2.8463 seconds in that ratio. Additionally, the half-life of 0.0000 seconds that was consistently reported for each parameter points to nuances in their convergence dynamics that are not explained by the conventional half-life criterion of attaining half of the initial value.
Example 4.2. To further illustrate the effectiveness of the proposed method, the electromechanical system in [34] was employed. It is governed by the following dynamic equations:
{M¨q+B˙q+Nsin(q)=I,L˙I=Vϵ−RI−KB˙q, | (4.3) |
where
M=JKt+mL203Kt+2M0R205Kt,N=mL0G2Kt+M0L0GKt,B=B0Kt, |
and ¨q, ˙q, q stand for the link acceleration, velocity, and position, respectively. Vϵ represents the input. J=0.001625, Kt=0.9, m=0.506, L0=0.305, M0=0.434, R0=0.023, G=9.8, and B0=0.01625. The physical meaning of the electromechanical system can be found in [34]. Defining x1=q, x2=˙q, x3=I, and u(v(t−τ))=Vϵ, the (4.3) can be rewritten as follows:
{˙x1=x2+0.2sin(t),˙x2=x3M−NMsinx1−BMx2+BMcosx2sinx3,˙x3=u(v(t−τ))L−KLx2−RLx3+sin(2t),y=x1, | (4.4) |
where f1(x)=0, f2(x)=−NMsinx1−BMx2+BMcosx2sinx3, f3(x)=−KLx2−RLx3, d1(t)=0.2sin(t), d2(t)=0, d3(t)=sin(2t), τ=1.5s.
The reference signal is set as yd=0.5sin(t)−cos(0.5t). The system input subject to actuator fault described by u(v(t))=λ(t,tλ)v+ur(t,tr) with λ(t,tλ)=0.4+0.6exp(−0.2t), and ur(t,tr)=cos2(x1)x2. The following virtual control laws, real control law and adaption laws are considered:
αi=−kiei−ei−1−12a2ieiˆθiSTi(Zi)Si(Zi),i=1,2.v=−k3e3−e2−12a23e3ˆθ3ST3(Z3)S3(Z3),˙ˆθi=ri2a2ie2iSTi(Zi)Si(Zi)−ϑiˆθi,i=1,2,3. | (4.5) |
The receptive field center is defined as μi=[−1.5,−1,−0.5,0,0.5,1,1.5]T for i=1,2,3, with a Gaussian function width of ζ=2. In the simulation, design parameters are determined through the trial-and-error method: k1=8, k2=7, k3=8, a1=a2=a3=1, ϑ1=1, ϑ2=1, ϑ3=1, r1=1, r2=1, r3=1. ICs for the simulation are set by using the trial-and-error method: [x1(0),x2(0),x3(0)]T=[0.5,0.5,−0.5]T and [ˆθ1(0),ˆθ2(0),ˆθ3(0)]=[0,0,0].
The simulation outcomes are displayed in Figures 8–13. Figure 8 demonstrates the effective tracking of the output y=x1 to the reference signal yd with bounded error. Further insights into the tracking error e1 are provided in Figure 9. Trajectories of x2 and x3 are depicted in Figure 10. Figure 11 presents the bounded adaptive laws ˆθ1, ˆθ2, and ˆθ3, while Figure 12 exhibits the control input v and system input u.
In this study, the effectiveness of the proposed method was validated through a comparison with an existing control approach [29] that utilizes auxiliary systems to minimize the effects of input delay. In contrast to the established control method, the proposed approach integrates Pade approximation. The comparison results, illustrated in Figure 13, clearly demonstrate a slight yet consistent improvement in tracking error under the proposed control method relative to the existing approach [29]. The simulation results affirm that the proposed controller ensures the boundedness of all signals within the closed-loop system. Figures 8–13 collectively highlight that, through judicious parameter adjustments, the designed controller effectively constrains all closed-loop system signals. This validation demonstrates the effectiveness of the proposed controller.
In this illustrative example, the error assessment criteria defined in Example 4.1 were utilized to establish the effectiveness of the proposed method as compared to the existing approach [29].
The results, as depicted in Table 2, demonstrate a marginal improvement in the proposed control scheme relative to the existing control method [29]. This enhancement provides compelling evidence of the effectiveness of the proposed control approach.
Methods | MSE | RMSE | MAE | NMSE | SSE | BFR |
Proposed method | 0.0287 | 0.1695 | 1.5000 | 0.0590 | 119.8038 | 99.94% |
Existing method in [29] | 0.0417 | 0.2042 | 1.5000 | 0.0970 | 136.1849 | 99.90% |
Remark 4.2. Comprehending the convergence dynamics of system elements heavily relies on the examination of time constants and half-life analyses. In Figure 8, the relatively moderate pace at which x1 converges is indicated by a time constant of 2.6835 seconds, and it took about 0.0504 seconds to become half of its initial value. In Figure 9, the tracking error (e1) demonstrates a lengthier time constant of 11.8472 seconds, suggesting a slower convergence rate with a half-life of approximately 0.1387 seconds. In Figure 11, ˆθ1, ˆθ2, and ˆθ3 have time constants of 23.7414 seconds, 3.7447 seconds, and 1.2005 seconds, respectively. Moreover, the consistently reported half-life of 0.0000 seconds for each parameter underscores intricacies in their convergence dynamics that are not fully explicable by the conventional half-life criterion associated with achieving half of the initial value.
The adaptive control problem for nonstrict-feedback nonlinear systems with actuator faults, input delays, and external disturbances has been the primary focus of this study. The use of an RBFNN and the Padé approximation, respectively, helped to resolve the difficulties brought forth by input delay and unknown functions. An adaptive controller has been developed by applying the Lyapunov stability theorem with the backstepping approach. The tracking error of the suggested controller converges to a small neighborhood around the origin, guaranteeing the boundedness of all signals in the closed-loop system. The efficacy of the suggested control method has been confirmed by the simulation results. Future research will concentrate on nonlinear systems with sensors and actuator faults, including providing true and estimated values of the nonlinear function to improve overall performance.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This work was funded by the Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2024R528), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.
The authors confirm no conflicts of interest.
[1] |
Friston KJ (1994) Functional and effective connectivity in neuroimaging: A synthesis. Hum Brain Mapp 2: 56-78. doi: 10.1002/hbm.460020107
![]() |
[2] |
Friston KJ (2011) Functional and effective connectivity: A review. Brain Connect 1: 13-36. doi: 10.1089/brain.2011.0008
![]() |
[3] |
Friston K, Moran R, Seth AK (2013) Analysing connectivity with granger causality and dynamic causal modelling. Curr Opin Neurobiol 23: 172-178. doi: 10.1016/j.conb.2012.11.010
![]() |
[4] |
Siettos C, Starke J (2016) Multiscale modeling of brain dynamics: from single neurons and networks to mathematical tools. Wiley Interdiscip Rev Syst Biol Med 8: 438-458. doi: 10.1002/wsbm.1348
![]() |
[5] |
Smith SM, Miller KL, Salimi-Khorshidi G, et al. (2011) Network modelling methods for fmri. Neuroimage 54: 875-891. doi: 10.1016/j.neuroimage.2010.08.063
![]() |
[6] |
Brazier MA (1972) Spread of seizure discharges in epilepsy: Anatomical and electrophysiological considerations. Exp Neurol 36: 263-272. doi: 10.1016/0014-4886(72)90022-2
![]() |
[7] |
Gerstein GL, Perkel DH, Subramanian K (1978) Identification of functionally related neural assemblies. Brain Res 140: 43-62. doi: 10.1016/0006-8993(78)90237-8
![]() |
[8] |
Zalesky A, Fornito A, Bullmore E (2012) On the use of correlation as a measure of network connectivity. NeuroImage 60: 2096-2106. doi: 10.1016/j.neuroimage.2012.02.001
![]() |
[9] |
Siggiridou E, Kugiumtzis D, Kimiskidis V (2014) Correlation networks for identifying changes in brain connectivity during epileptiform discharges and transcranial magnetic stimulation. Sensors 14: 12585-12597. doi: 10.3390/s140712585
![]() |
[10] | Hockett CF (1953) The mathematical theory of communication. |
[11] |
Vlachos I, Kugiumtzis D (2010) Nonuniform state-space reconstruction and coupling detection. Phys Rev E 82: 016207. doi: 10.1103/PhysRevE.82.016207
![]() |
[12] |
Vicente R, Wibral M, Lindner M, et al. (2011) Transfer entropy—a model-free measure of effective connectivity for the neurosciences. J Comput Neurosci 30: 45-67. doi: 10.1007/s10827-010-0262-3
![]() |
[13] |
Savva AD, Mitsis GD, Matsopoulos GK (2019) Assessment of dynamic functional connectivity in resting-state fMRI using the sliding window technique. Brain Behav 9: e01255. doi: 10.1002/brb3.1255
![]() |
[14] |
Lachaux JP, Rodriguez E, Martinerie J, et al. (1999) Measuring phase synchrony in brain signals. Hum Brain Mapp 8: 194-208. doi: 10.1002/(SICI)1097-0193(1999)8:4<194::AID-HBM4>3.0.CO;2-C
![]() |
[15] |
Stam CJ, Nolte G, Daffertshofer A (2007) Phase lag index: Assessment of functional connectivity from multi channel EEG and MEG with diminished bias from common sources. Hum Brain Mapp 28: 1178-1193. doi: 10.1002/hbm.20346
![]() |
[16] |
Glerean E, Salmi J, Lahnakoski JM, et al. (2012) Functional magnetic resonance imaging phase synchronization as a measure of dynamic functional connectivity. Brain Connect 2: 91-101. doi: 10.1089/brain.2011.0068
![]() |
[17] |
Mylonas DS, Siettos CI, Evdokimidis I, et al. (2015) Modular patterns of phase desynchronization networks during a simple visuomotor task. Brain Topogr 29: 118-129. doi: 10.1007/s10548-015-0451-5
![]() |
[18] |
Calhoun VD, Adali T, Pearlson GD, et al. (2001) A method for making group inferences from functional mri data using independent component analysis. Human Brain Mapp 14: 140-151. doi: 10.1002/hbm.1048
![]() |
[19] |
Calhoun VD, Liu J, Adali T (2009) A review of group ica for fmri data and ica for joint inference of imaging, genetic, and erp data. Neuroimage 45: S163-S172. doi: 10.1016/j.neuroimage.2008.10.057
![]() |
[20] |
Reidl J, Starke J, Omer DB, et al. (2007) Independent component analysis of high-resolution imaging data identifies distinct functional domains. Neuroimage 34: 94-108. doi: 10.1016/j.neuroimage.2006.08.031
![]() |
[21] | Anderson A, Cohen MS (2013) Decreased small-world functional network connectivity and clustering across resting state networks in schizophrenia: an fmri classification tutorial. Front Hum Neurosci 7: 520. |
[22] |
Tenenbaum JB, De Silva V, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290: 2319-2323. doi: 10.1126/science.290.5500.2319
![]() |
[23] |
Duncan D, Talmon R, Zaveri HP, et al. (2013) Identifying preseizure state in intracranial EEG data using diffusion kernels. Math Biosci Eng 10: 579-590. doi: 10.3934/mbe.2013.10.579
![]() |
[24] |
Granger CW (1969) Investigating causal relations by econometric models and cross-spectral methods. Econometrica 424-438. doi: 10.2307/1912791
![]() |
[25] |
Granger C, Newbold P (1974) Spurious regressions in econometrics. J Econom 2: 111-120. doi: 10.1016/0304-4076(74)90034-7
![]() |
[26] |
Geweke J (1982) Measurement of linear dependence and feedback between multiple time series. J Am Stat Assoc 77: 304-313. doi: 10.1080/01621459.1982.10477803
![]() |
[27] |
Seth AK (2010) A matlab toolbox for granger causal connectivity analysis. J Neurosci Methods 186: 262-273. doi: 10.1016/j.jneumeth.2009.11.020
![]() |
[28] |
Barnett L, Seth AK (2014) The mvgc multivariate granger causality toolbox: A new approach to granger-causal inference. J Neurosci Methods 223: 50-68. doi: 10.1016/j.jneumeth.2013.10.018
![]() |
[29] |
Seth AK, Barrett AB, Barnett L (2015) Granger causality analysis in neuroscience and neuroimaging. J Neurosci 35: 3293-3297. doi: 10.1523/JNEUROSCI.4399-14.2015
![]() |
[30] |
Friston KJ, Harrison L, Penny W (2003) Dynamic causal modelling. Neuroimage 19: 1273-1302. doi: 10.1016/S1053-8119(03)00202-7
![]() |
[31] |
Keller CJ, Bickel S, Honey CJ, et al. (2013) Neurophysiological investigation of spontaneous correlated and anticorrelated fluctuations of the BOLD signal. J Neurosci 33: 6333-6342. doi: 10.1523/JNEUROSCI.4837-12.2013
![]() |
[32] |
Megumi F, Yamashita A, Kawato M, et al. (2015) Functional MRI neurofeedback training on connectivity between two regions induces long-lasting changes in intrinsic functional network. Front Hum Neurosci 9: 160. doi: 10.3389/fnhum.2015.00160
![]() |
[33] | Wiener N (1956) The theory of prediction. Modern Math Eng 1: 125-139. |
[34] |
Barrett AB, Murphy M, Bruno MA, et al. (2012) Granger causality analysis of steady-state electroencephalographic signals during propofol-induced anaesthesia. PloS One 7: e29072. doi: 10.1371/journal.pone.0029072
![]() |
[35] |
Barnett L, Seth AK (2011) Behaviour of granger causality under filtering: theoretical invariance and practical application. J Neurosci Methods 201: 404-419. doi: 10.1016/j.jneumeth.2011.08.010
![]() |
[36] |
Gow DW, Segawa JA, Ahlfors SP, et al. (2008) Lexical influences on speech perception: a granger causality analysis of meg and eeg source estimates. Neuroimage 43: 614-623. doi: 10.1016/j.neuroimage.2008.07.027
![]() |
[37] |
Keil A, Sabatinelli D, Ding M, et al. (2009) Re-entrant projections modulate visual cortex in affective perception: Evidence from granger causality analysis. Hum Brain Mapp 30: 532-540. doi: 10.1002/hbm.20521
![]() |
[38] |
Nicolaou N, Hourris S, Alexandrou P, et al. (2012) Eeg-based automatic classification of ‘awake’ versus ‘anesthetized’ state in general anesthesia using granger causality. PloS One 7: e33869. doi: 10.1371/journal.pone.0033869
![]() |
[39] |
De Tommaso M, Stramaglia S, Marinazzo D, et al. (2013) Functional and effective connectivity in eeg alpha and beta bands during intermittent flash stimulation in migraine with and without aura. Cephalalgia 33: 938-947. doi: 10.1177/0333102413477741
![]() |
[40] |
Protopapa F, Siettos CI, Evdokimidis I, et al. (2014) Granger causality analysis reveals distinct spatio-temporal connectivity patterns in motor and perceptual visuo-spatial working memory. Front Comput Neurosci 8: 146. doi: 10.3389/fncom.2014.00146
![]() |
[41] |
Protopapa F, Siettos CI, Myatchin I, et al. (2016) Children with well controlled epilepsy possess different spatio-temporal patterns of causal network connectivity during a visual working memory task. Cogn Neurodyn 10: 99-111. doi: 10.1007/s11571-015-9373-x
![]() |
[42] |
Al-Aidroos N, Said CP, Turk-Browne NB (2012) Top-down attention switches coupling between low-level and high-level areas of human visual cortex. Proc Natl Acad Sci 109: 14675-14680. doi: 10.1073/pnas.1202095109
![]() |
[43] |
Florin E, Gross J, Pfeifer J, et al. (2010) The effect of filtering on granger causality based multivariate causality measures. Neuroimage 50: 577-588. doi: 10.1016/j.neuroimage.2009.12.050
![]() |
[44] |
Zhou Z, Wang X, Klahr NJ, et al. (2011) A conditional granger causality model approach for group analysis in functional magnetic resonance imaging. Magn Reson Imaging 29: 418-433. doi: 10.1016/j.mri.2010.10.008
![]() |
[45] |
Wu G, Liao W, Stramaglia S, et al. (2013) Recovering directed networks in neuroimaging datasets using partially conditioned granger causality. BMC Neurosci 14: P260. doi: 10.1186/1471-2202-14-S1-P260
![]() |
[46] |
Tang W, Bressler SL, Sylvester CM, et al. (2012) Measuring granger causality between cortical regions from voxelwise fmri bold signals with lasso. PLoS Comput Biol 8: e1002513. doi: 10.1371/journal.pcbi.1002513
![]() |
[47] |
Roebroeck A, Formisano E, Goebel R (2005) Mapping directed influence over the brain using granger causality and fmri. Neuroimage 25: 230-242. doi: 10.1016/j.neuroimage.2004.11.017
![]() |
[48] |
Sabatinelli D, McTeague LM, Dhamala M, et al. (2015) Reduced medial prefrontal–subcortical connectivity in dysphoria: Granger causality analyses of rapid functional magnetic resonance imaging. Brain Connect 5: 1-9. doi: 10.1089/brain.2013.0186
![]() |
[49] |
Miao X, Wu X, Li R, et al. (2011) Altered connectivity pattern of hubs in default-mode network with alzheimer's disease: an granger causality modeling approach. PloS One 6: e25546. doi: 10.1371/journal.pone.0025546
![]() |
[50] |
Liao W, Ding J, Marinazzo D, et al. (2011) Small-world directed networks in the human brain: Multivariate granger causality analysis of resting-state fMRI. Neuroimage 54: 2683-2694. doi: 10.1016/j.neuroimage.2010.11.007
![]() |
[51] |
Gao Q, Duan X, Chen H (2011) Evaluation of effective connectivity of motor areas during motor imagery and execution using conditional granger causality. Neuroimage 54: 1280-1288. doi: 10.1016/j.neuroimage.2010.08.071
![]() |
[52] |
Lin FH, Ahveninen J, Raij T, et al. (2014) Increasing fMRI sampling rate improves granger causality estimates. PLoS One 9: e100319. doi: 10.1371/journal.pone.0100319
![]() |
[53] |
Duggento A, Passamonti L, Valenza G, et al. (2018) Multivariate granger causality unveils directed parietal to prefrontal cortex connectivity during task-free MRI. Sci Rep 8: 1-11. doi: 10.1038/s41598-018-23996-x
![]() |
[54] |
Penny WD, Stephan KE, Mechelli A, et al. (2004) Comparing dynamic causal models. Neuroimage 22: 1157-1172. doi: 10.1016/j.neuroimage.2004.03.026
![]() |
[55] |
Friston KJ, Bastos A, Litvak V, et al. (2012) Dcm for complex-valued data: cross-spectra, coherence and phase-delays. Neuroimage 59: 439-455. doi: 10.1016/j.neuroimage.2011.07.048
![]() |
[56] |
Guo S, Seth AK, Kendrick KM, et al. (2008) Partial granger causality—eliminating exogenous inputs and latent variables. J Neurosci Methods 172: 79-93. doi: 10.1016/j.jneumeth.2008.04.011
![]() |
[57] |
Roelstraete B, Rosseel Y (2012) Does partial granger causality really eliminate the influence of exogenous inputs and latent variables? J Neurosci Methods 206: 73-77. doi: 10.1016/j.jneumeth.2012.01.010
![]() |
[58] |
Ge T, Kendrick KM, Feng J (2009) A novel extended granger causal model approach demonstrates brain hemispheric differences during face recognition learning. PLoS Comput Biol 5: e1000570. doi: 10.1371/journal.pcbi.1000570
![]() |
[59] |
Bajaj S, Adhikari BM, Friston KJ, et al. (2016) Bridging the gap: Dynamic causal modeling and granger causality analysis of resting state functional magnetic resonance imaging. Brain Connect 6: 652-661. doi: 10.1089/brain.2016.0422
![]() |
[60] |
Dhamala M, Rangarajan G, Ding M (2008) Analyzing information flow in brain networks with nonparametric granger causality. Neuroimage 41: 354-362. doi: 10.1016/j.neuroimage.2008.02.020
![]() |
[61] |
Fox MD, Snyder AZ, Vincent JL, et al. (2005) The human brain is intrinsically organized into dynamic, anticorrelated functional networks. Proc Natl Acad Sci 102: 9673-9678. doi: 10.1073/pnas.0504136102
![]() |
[62] |
Biswal BB (2012) Resting state fMRI: A personal history. Neuroimage 62: 938-944. doi: 10.1016/j.neuroimage.2012.01.090
![]() |
[63] |
Seth AK, Chorley P, Barnett LC (2013) Granger causality analysis of fMRI BOLD signals is invariant to hemodynamic convolution but not downsampling. Neuroimage 65: 540-555. doi: 10.1016/j.neuroimage.2012.09.049
![]() |
[64] |
Ding M, Chen Y, Bressler SL (2006) Granger causality: basic theory and application to neuroscience. Handbook of time series analysis: recent theoretical developments and applications 437: 437-460. doi: 10.1002/9783527609970.ch17
![]() |
[65] |
Baccalá LA, Sameshima K (2001) Partial directed coherence: A new concept in neural structure determination. Biol Cybern 84: 463-474. doi: 10.1007/PL00007990
![]() |
[66] |
Dumoulin S, Wandell B (2008) Population receptive field estimates in human visual cortex. Neuroimage 39: 647. doi: 10.1016/j.neuroimage.2007.09.034
![]() |
[67] |
Büchel C, Friston K (1997) Modulation of connectivity in visual pathways by attention: cortical interactions evaluated with structural equation modelling and fmri. Cereb Cortex 7: 768-778. doi: 10.1093/cercor/7.8.768
![]() |
[68] |
Büchel C, Josephs O, Rees G, et al. (1998) The functional anatomy of attention to visual motion. a functional mri study. Brain 121: 1281-1294. doi: 10.1093/brain/121.7.1281
![]() |
[69] |
Penny WD, Stephan KE, Mechelli A, et al. (2004) Modelling functional integration: a comparison of structural equation and dynamic causal models. Neuroimage 23: S264-S274. doi: 10.1016/j.neuroimage.2004.07.041
![]() |
[70] | Penny WD, Friston KJ, Ashburner JT, et al. (2011) Statistical parametric mapping: the analysis of functional brain images Academic press. |
[71] |
Friston KJ, Holmes AP, Worsley KJ, et al. (1994) Statistical parametric maps in functional imaging: a general linear approach. Human Brain Mapping 2: 189-210. doi: 10.1002/hbm.460020402
![]() |
[72] |
Worsley KJ, Friston KJ (1995) Analysis of fmri time-series revisited—again. Neuroimage 2: 173-181. doi: 10.1006/nimg.1995.1023
![]() |
[73] |
Zou C, Feng J (2009) Granger causality vs. dynamic bayesian network inference: A comparative study. BMC Bioinformatics 10: 122. doi: 10.1186/1471-2105-10-122
![]() |
![]() |
![]() |
1. | Saad Ihsan Butt, Muhammad Nasim Aftab, Youngsoo Seol, Symmetric Quantum Inequalities on Finite Rectangular Plane, 2024, 12, 2227-7390, 1517, 10.3390/math12101517 | |
2. | Ammara Nosheen, Sana Ijaz, Khuram Ali Khan, Khalid Mahmood Awan, Hüseyin Budak, Quantum symmetric integral inequalities for convex functions, 2024, 47, 0170-4214, 14878, 10.1002/mma.10310 | |
3. | Asawathep Cuntavepanit, Sotiris K. Ntouyas, Jessada Tariboon, Right Quantum Calculus on Finite Intervals with Respect to Another Function and Quantum Hermite–Hadamard Inequalities, 2024, 13, 2075-1680, 466, 10.3390/axioms13070466 | |
4. | Saad Ihsan Butt, Muhammad Nasim Aftab, Asfand Fahad, Yuanheng Wang, Bandar Bin Mohsin, Novel notions of symmetric Hahn calculus and related inequalities, 2024, 2024, 1029-242X, 10.1186/s13660-024-03228-9 | |
5. | Muhammad Nasim Aftab, Saad Ihsan Butt, Youngsoo Seol, Fundamentals of Dual Basic Symmetric Quantum Calculus and Its Fractional Perspectives, 2025, 9, 2504-3110, 237, 10.3390/fractalfract9040237 |
Methods | MSE | RMSE | MAE | NMSE | SSE | BFR |
Proposed method | 0.0160 | 0.1266 | 0.5375 | 0.0998 | 6.6997 | 99.90% |
Existing method in [29] | 0.0171 | 0.1307 | 0.5187 | 0.1045 | 8.2522 | 99.90% |
Methods | MSE | RMSE | MAE | NMSE | SSE | BFR |
Proposed method | 0.0287 | 0.1695 | 1.5000 | 0.0590 | 119.8038 | 99.94% |
Existing method in [29] | 0.0417 | 0.2042 | 1.5000 | 0.0970 | 136.1849 | 99.90% |
Methods | MSE | RMSE | MAE | NMSE | SSE | BFR |
Proposed method | 0.0160 | 0.1266 | 0.5375 | 0.0998 | 6.6997 | 99.90% |
Existing method in [29] | 0.0171 | 0.1307 | 0.5187 | 0.1045 | 8.2522 | 99.90% |
Methods | MSE | RMSE | MAE | NMSE | SSE | BFR |
Proposed method | 0.0287 | 0.1695 | 1.5000 | 0.0590 | 119.8038 | 99.94% |
Existing method in [29] | 0.0417 | 0.2042 | 1.5000 | 0.0970 | 136.1849 | 99.90% |