Next Article in Journal
Analytical Solution of the Two-Dimensional Steady-State Seepage Field of a Seepage Anisotropy Pit Considering the Free Surface
Previous Article in Journal
PDE-Based Two-Dimensional Radiomagnetotelluric forward Modelling Using Vertex-Centered Finite-Volume Scheme
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Robust Stability Analysis of Switched Neural Networks with Application in Psychological Counseling Evaluation System

1
School of Education Science, Hanshan Normal University, Chaozhou 521041, China
2
School of Mathematics and Statistics, Hanshan Normal University, Chaozhou 521041, China
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(13), 2097; https://doi.org/10.3390/math12132097
Submission received: 22 May 2024 / Revised: 29 June 2024 / Accepted: 1 July 2024 / Published: 3 July 2024
(This article belongs to the Special Issue New Advances and Challenges in Neural Networks and Applications)

Abstract

:
In this work, the effectiveness and stability of psychological counseling are evaluated using the switched complex-valued neural networks (SCVNN) model, which includes parameter disturbances, impulsive perturbations, variable and continuously distributed delays in the system state, and impulsive delay. How to analyze and judge the stability of the network simply and effectively is the primary prerequisite for its successful application. Therefore, we explore the dynamic behavior of SCVNN with both variable and distributed delays along with impulsive effect. Initially, the proposed conditions for the existence and uniqueness of equilibrium in SCVNN are presented. Subsequently, employing the inequality technique and impulsive average dwell time approach, sufficient conditions for the robust exponential stability of SCVNN under both arbitrary and restricted switching are obtained. Lastly, the psychological counseling evaluation system (PCES) is established, and a simulation example is used to verify the correctness and effectiveness of the presented findings.

1. Introduction

Neural networks have recently been utilized for the assessment and analysis of mental health and psychological counseling [1,2,3]. In [3], a method of emotional analysis based on the CNN–BiLSTM hybrid neural network has been developed. As shown in Figure 1, suppose that the neural networks have n neurons, denoted by x 1 , x 2 , , x n , which, respectively, represent n evaluation indexes in the PCES. The link weight between any two neurons x i and x j in the networks is denoted as a i j . To assess the effectiveness of psychological counseling, we should first evaluate the evaluation indicators and evaluation objectives according to the evaluation indicator standards of psychological counseling and form sample data. Then, the connection weights of neurons will be determined according to the relationship between evaluation indexes. Psychological counseling is a process, and the effectiveness of counseling also needs a process of accumulation. The previous counseling is the stage of collecting information and establishing relationships. Psychological counseling usually takes effect after several consecutive efforts. And every counseling is affected by some subjective and objective factors, so the correlation weights of evaluation indicators are generally different. As is widely recognized, the connections between neurons in neural networks are often unstable, leading to link failures and the formation of new connections. Consequently, sudden changes in neural network architectures and parameters frequently occur, causing switching between various topologies. Therefore, evaluation of the whole psychological counseling must use the switched network system, as shown in the Figure 2. Switched neural networks are hybrid systems that fundamentally consist of multiple subnetworks and a switching signal, which designates a specific subnetwork to be activated at any given time. The properties of a switched system are much more complex than those of each individual subsystem. For instance, even if all subsystems are stable, an unconstrained switching signal may destabilize the entire system. Conversely, even if all subsystems are unstable, an appropriate switching signal can stabilize the system. Therefore, studying of the stability, controller design, and switching signal design for switched systems are challenging tasks that present significant difficulties. It is shown that the application of neural networks depends greatly on their dynamic behavior [4]. For example, in the creation of associative memory for neural networks, refs. [5,6] require that the state of each neuron converge to the network’s unique equilibrium point. Consequently, the exploration of neural network stability carries significant theoretical and practical implications. In [7], the exponential stability of switched neural networks is evaluated by combining the dwell time technique with discretized Lyapunov–Krasovskii functions. The Lyapunov function approach, the comparison principle, and an impulsive delay differential inequality are used to investigate the synchronization of coupled switching neural networks [8].
Complex-valued neural networks (CVNN) are extremely important to research since they are widely used in many domains, including signal processing, remote sensing, voice synthesis, filtering, and others, and they cannot be fully evaluated using simply their real-valued counterparts [9,10,11,12,13]. Due to their more complex characteristics and methodologies for analyzing dynamic behaviors, such as synchronization, stability, and periodicity of system states, CVNN are not merely straightforward extensions of real-valued systems. Consequently, a multitude of significant studies has emerged over recent years, delving into the analysis of dynamic behavior in CVNN. The study in [14] investigated the finite-/fixed-time synchronization of CVNN with diffusion and discontinuities. The study in [15] explored the finite-time stability of a specific category of CVNN with fractional order. Using integral inequalities, the robust stability of stochastic CVNN was investigated in [16]. Nevertheless, the models discussed in the aforementioned references did not incorporate a switching signal.
In actuality, time delays in the electrical implementation of neural networks are unavoidable. These delays typically lead to a degradation in model performance, and as the delays increase, the stability of the models may even be compromised [17]. Neural networks typically feature spatial aspects because of the numerous parallel paths with varying axon sizes and lengths. In light of this, it becomes necessary to apply continually distributed delays over a predetermined period of time to reflect the fact that actions from remote past states are less significant than those from the present [18,19]. In real-world neural networks, the impulsive impact is unavoidable. For example, system states are impulsively affected by instantaneous perturbations, which might be brought on by a sudden noise or a change in frequency. Exponential convergence of time-varying delayed T-S fuzzy CVNN with impulsive effects was explored in [20]. Exponential stability of time-delayed impulsive CVNN was examined in [21]. Furthermore, certain parameters cannot be precisely specified due to a lack of knowledge and information. Additionally, various factors, including modeling errors and external perturbations, are inescapable. As a result, the models inherently possess uncertainty, leading to a significant influence on the dynamic behaviors of the systems. Assuming the parameters are contained inside a specific interval is an acceptable way to assess the robustness of the models [22].
Inspired by the previous explanation, an investigation into the robust stability of a class of SCVNN featuring variable and distributed delays together with impulsive impact on the field C is planned. The contributions of this paper are as follows: (1) In this work, robust stability of the SCVNN under arbitrary switching is studied. Addressing robust stability under arbitrary switching poses substantial theoretical challenges, necessitating innovative approaches in Lyapunov function construction, system modeling, and uncertainty management. Overcoming these challenges not only refines the existing theoretical framework but also advances stability theories for switched systems, offering new perspectives and methods for future research. (2) In the stability analysis of the system, more influential factors are taken into account (including parameter disturbances and impulsive perturbations, variable and continuously distributed delays of system state, and impulsive delay), which makes the model more close to the actual operation conditions and broadens its applicability. (3) The results obtained using the LMI (linear matrix inequality) approach often require manual determination of certain parameters. In contrast, the sufficient conditions proposed in this paper are algebraic expressions, making them more intuitive and advantageous for practical applications.
Notations: Let the real number set be represented by R and the complex number set by C . Let z = x + y i C , where ‘i’ represents imaginary unit and x , y R . Indicate by | z | x 2 + y 2 the module of z and by z ¯ x y i its conjugate complex number, respectively, assuming that the column vector of C n is z = z 1 , z 2 , , z n T , where ‘T’ stands for transposition. The vector norm denoted by z = j = 1 n | z j | 2 and | z | represents z 1 , z 2 , , z n T . | C | represents ( | c i j | ) n × n R n × n for the complex number matrix C = ( c i j ) n × n C n × n . Re(·) and Im(·) are the real component and imaginary component of a complex number, respectively.

2. Preliminaries

The SCVNN model can be formulated through the utilization of delayed differential equations in the following:
d z ˜ i t d t = h ˜ i σ t z ˜ i ( t ) d ˜ i σ t z ˜ i t + j = 1 n [ a i j σ t g j σ t z ˜ j t + b i j σ t g j σ t z ˜ j t τ i j σ t t + c i j σ t t χ i j σ t t s g j σ t z ˜ j s d s + I i σ t ] } , t t k ,
z ˜ i t k = ϕ ˜ 1 i k z ˜ 1 ( t k ) , , z ˜ n ( t k ) + ϕ ˜ 2 i k z ˜ 1 ( t k τ i 1 t k ) , , z ˜ n ( t k τ i n t k ) + J i k ,
where i = 1 , 2 , , n , k = 1 , 2 , . z ˜ i t C represents the state of neuron i. h ˜ i σ t , d ˜ i σ t , and g i σ t are amplification functions, self-feedback functions, and activation functions that depend on σ t , respectively. σ t is a right-continuous function that maps from 0 , + to the set Ξ 1 , 2 , , m , exhibiting a piecewise constant nature. σ t is called a switching law or switching signal, and σ t = q Ξ indicates the activation of the qth subnetwork. A q = ( a i j q ) n × n C n × n , B q = ( b i j q ) n × n C n × n , and C q = ( c i j q ) n × n C n × n are complex-valued matrices representing the connection weights of the qth subnetwork. χ i j q : 0 , + 0 , + is the kernel function of the qth subnetwork satisfy 0 e ϑ s χ i j q s d s = Υ i j q ϑ , where Υ i j q 0 = 1 and ∀ δ > 0 , Υ i j q ϑ is continuous on 0 , δ . I q = I 1 q , I 2 q , , I n q T C n is a constant external input vector of the qth subnetwork. τ i j ( t k ) and τ i j q ( t ) are bounded delay function with 0 τ i j ( t k ) τ and 0 τ i j q ( t ) τ q , respectively. Equation (1b) describes the sudden alteration in the state occurring at t k , where ϕ ˜ 1 i z ˜ 1 t k , , z ˜ n t k is the impulsive perturbation of neuron i at t k with z ˜ i t k = lim t t k z ˜ i t ; ϕ ˜ 2 i ( z ˜ 1 ( t k τ i 1 t k ) , , z ˜ n ( t k τ i n t k ) ) is the impulsive perturbation of neuron i at t k , which is triggered by transmission delays; and J i k is impulsive inputs at t k . z ˜ i s + t 0 = φ ˜ i s is taken to be the initial condition of Equations (1a) and (1b), here φ ˜ i C , t 0 , C , i = 1 , 2 , , n .
In the process of psychological counseling, the effect of counseling is subject to uncertain external disturbance. So σ t is a function of time that is unknown in advance. Under the assumption that the i p th subnetwork is turned on when t t p , t p + 1 , we can derive the switching sequence t 0 , i 0 , , t p , i p , | i p Σ , p = 0 , 1 , . We further assume that there exists only a finite number of switches within any finite interval, and that the following conditions are met.
Assumption 1 
([23]). For any u ( t ) , v ( t ) C , positive numbers D i q ( q Ξ ; i = 1 , 2 , , n ) exist such that
d ˜ i q u ( t ) d ˜ i q v ( t ) u ( t ) v ( t ) D i q
holds. Let D q = diag D 1 q , D 2 q , , D n q .
Assumption 2. 
For any u ( t ) , v ( t ) C , positive numbers L i q ( q Ξ ; i = 1 , 2 , , n ) exist such that
| g i q u ( t ) g i q v ( t ) | L i q | u ( t ) v ( t ) |
holds. Let L q = diag L 1 q , L 2 q , , L n q .
Assumption 3. 
For amplification function h ˜ i q z ˜ i ( t ) , real numbers H i q > 0   ( q Ξ ; i = 1 , 2 , , n ) exist such that h ˜ i q z ˜ i ( t ) H i q > 0 holds.
Remark 1. 
Assumptions 1–3 are general conditions (see, e.g., [23,24,25,26,27,28,29,30,31]). In the dynamic behavior analysis of CVNN, there are many studies, such as [24,25,26,27,28,29,30], which must explicitly decompose the activation function, amplification function, and self feedback function into real part and imaginary part. And they also assume that these functions are differentiable and bounded. It is crucial to acknowledge, however, that these divisions are not always expressible in an analytical sense [23,31]. In this work, the activation function simply needs to fulfill the Lipschitz condition, and the amplification function only needs to have a lower bound.
Assumption 4. 
There are non-negative square matrices Φ ˜ 1 k = ( φ ˜ i j 1 k ) and Φ ˜ 2 k = ( φ ˜ i j 2 k ) of order n over R , such that for any z 1 = ( z 11 , , z 1 n ) T and z 2 = ( z 21 , , z 2 n ) T C n ,
ϕ ˜ 1 i k z 11 , , z 1 n ϕ ˜ 1 i k z 21 , , z 2 n j = 1 n φ ˜ i j 1 k z 1 j z 2 j ,
ϕ ˜ 2 i k z 11 , , z 1 n ϕ ˜ 2 i k z 21 , , z 2 n j = 1 n φ ˜ i j 2 k z 1 j z 2 j
hold, where i = 1 , 2 , , n and k = 1 , 2 , .
Remark 2. 
The impulsive phenomena is assumed to exclusively occur in switching instants for the sake of simplicity in the analysis that follows. Indeed, the impulse disturbance can be regarded as a form of system switching. However, during these specific switching moments, the subsystems remain unchanged.
Considering the parameter uncertainty in (1a) and (1b), the interval weight matrices for every subnetwork q, q Ξ are constructed as follows:
A q A q I = | A q | = ( | a i j q | ) n × n : | A q | | A q | | A ˜ q | , i . e . , | a i j q | | a i j q | | a ˜ i j q | , i , j = 1 , 2 , , n , B q B q I = | B q | = ( | b i j q | ) n × n : | B q | | B q | | B ˜ q | , i . e . , | b i j q | | b i j q | | b ˜ i j q | , i , j = 1 , 2 , , n , C q C q I = | C q | = ( | c i j q | ) n × n : | C q | | C q | | C ˜ q | , i . e . , | c i j q | | c i j q | | c ˜ i j q | , i , j = 1 , 2 , , n ,
where a i j q , b i j q , c i j q , a ˜ i j q , b ˜ i j q , and c ˜ i j q are all known complex value constants.
Definition 1. 
Let z be the equilibrium point of (1a) and (1b). For A q A q I , B q B q I , and C q C q I ( q Ξ ), if λ > 0 and M > 1 are constants such that
z t z M sup s , t 0 ϕ ( s ) z exp ( λ ( t t 0 ) ) , t t 0 ,
then z is considered to be robustly exponentially stable.
Lemma 1 
([32]). Consider a square matrix B of order n over the field of real numbers, which has non-positive off-diagonal entries. The assertions that follow are synonymous:
1. 
B is an M-matrix;
2. 
A positive real vector ξ exists such that B ξ > 0 ξ T B > 0 .
Lemma 2 
([23,33]). If F ( z ) is a continuous function over the complex n-space C n that fulfills both of the following two requirements:
1. 
F ( z ) is univalent injective on C n ;
2. 
F z as z ,
then F ( z ) is a homeomorphism mapping form C n onto itself.

3. Main Results

By leveraging the distinctive properties of M-matrix and homeomorphism, it will first be demonstrated that each subnetwork q ( q Ξ ) has an equilibrium point z q , and that each point is unique, implying that (1a) and (1b) has an equilibrium point.
Theorem 1. 
It is supposed that the Assumptions mentioned above are satisfied. If for any q Ξ , D q = ( d i j q ) n × n are nonsingular M-matrices, here, d i i q = D i q and d i j q = L j q ( | a ˜ i j q | + | b ˜ i j q | + | c ˜ i j q | ) , i j . Then, for A q A q I , B q B q I , C q C q I and every given switching signal σ t , (1a) and (1b) possesses a unique equilibrium point.
Proof of Theorem 1. 
Define a map
F q z ˜ t = F 1 q z ˜ t , F 2 q z ˜ t , , F n q z ˜ t T ,
associated with (1a) and (1b) as the forms:
F i q z ˜ t = d ˜ i q z ˜ i ( t ) + j = 1 n a i j q + b i j q + c i j q g j q z ˜ j t + I i q .
As is widely known, if for all q Ξ , F q z ˜ t are homeomorphism maps on C n , then each subnetwork of (1a) and (1b) possesses a distinct equilibrium point [34].
Initially, we demonstrate that F q z ˜ ( t ) are univalent injective mappings on C n . Effectively, if there are vectors z ˜ and z ˜ over the complex n-space C n and z ˜ z ˜ such that
d ˜ i q z ˜ i ( t ) + j = 1 n a i j q + b i j q + c i j q g j q z ˜ j t + I i q = d ˜ i q z ˜ i ( t ) + j = 1 n a i j q + b i j q + c i j q g j q z ˜ j t + I i q ,
then considering Assumptions 1 and 2, as well as (1a) and (1b), we arrive at
D i q z ˜ i z ˜ i j = 1 n L j q | a ˜ i j p | + | b ˜ i j q | + | c ˜ i j q | z ˜ j z ˜ j 0 , i = 1 , 2 , , n .
It is clear that inequalities (4) can be written in vector form:
D q | z ˜ z ˜ | 0 .
From D q , a nonsingular M-matrix, it follows that det D q > 0 and D q 1 > 0 exists. One may determine that | z ˜ z ˜ | = 0 . This is in conflict with z ˜ z ˜ . Therefore, for all q Ξ , F q z ˜ ( t ) are univalent injective on C n .
We shall demonstrate in the following that F q z ˜ ( t ) as z ˜ ( t ) . Let F ˜ i q z ˜ ( t ) = F i q z ˜ ( t ) F i q 0 , i.e.,
F ˜ i q z ˜ ( t ) = d ˜ i q z ˜ i ( t ) d ˜ i q 0 + j = 1 n a i j q + b i j q + c i j q g j q z ˜ j t g j q 0 ,
where q Ξ , i = 1 , 2 , , n . Taking Assumptions 1 and 2 and (1a) and (1b) into account, and multiplying both sides of (6) by z ˜ ¯ i , we arrive at
Re F ˜ i q z ˜ ( t ) z ˜ ¯ i ( t ) = Re d ˜ i q z ˜ i ( t ) d ˜ i q 0 z ˜ ¯ i ( t ) + Re z ˜ ¯ i ( t ) j = 1 n a i j q + b i j q + c i j q g j q z ˜ j t g j q 0 D i q | z ˜ i ( t ) | 2 + | z ˜ ¯ i ( t ) | j = 1 n L j q | a ˜ i j q | + | b ˜ i j q | + | c ˜ i j q | | z ˜ j ( t ) | .
As we are aware, there exist positive matrices P q = diag { ξ 1 q , ξ 2 q , , ξ n q } , q Ξ such that P q D q + D q T P q are positive definite matrices based on the criteria of Theorem 1. Multiplying by ξ i q on both sides of (7) and taking the sum, we obtain
i = 1 n ξ i q Re F ˜ i q z ˜ ( t ) z ˜ ¯ i ( t ) i = 1 n ξ i q D i q | z ˜ i ( t ) | 2 + | z ˜ ¯ i ( t ) | j = 1 n L j q | a ˜ i j q | + | b ˜ i j q | + | c ˜ i j q | | z ˜ j ( t ) | = z 1 ( t ) , z 2 ( t ) , , z n ( t ) P q D q z 1 ( t ) , z 2 ( t ) , , z n ( t ) T = 1 2 z ( t ) T P q D q + D q T P q z ( t ) 1 2 λ min P q D q + D q T P q z ( t ) 2 ,
i.e.,
λ min P q D q + D q T P q z ( t ) 2 2 i = 1 n ξ i q Re F ˜ i q z ˜ ( t ) z ˜ ¯ i ( t ) ξ max q i = 1 n F ˜ i q z ˜ ( t ) z ˜ ¯ i ( t ) ξ max q i = 1 n F ˜ i q z ˜ ( t ) 2 + ξ max q i = 1 n z ˜ ¯ i ( t ) 2 ,
where ξ max q = max 1 i n { ξ i } and λ min P q D q + D q T P q represents the minimum eigenvalue of P q D q + D q T P q . It follows from (9) that
z ˜ ( t ) 2 λ min P q D q + D q T P q ξ max q 1 ξ max q F ˜ q z ˜ ( t ) 2 .
Obviously, it follows from (10) that F ˜ q z ˜ ( t ) as z ˜ ( t ) , which implies that F q z ˜ ( t ) as z ˜ ( t ) . In light of Lemma 2, for all q Ξ , F q z ˜ t are homeomorphism maps on C n . Therefore, every subnetwork possesses a unique equilibrium point. Further, we can determine that (1a) and (1b) has a unique equilibrium point for each given switching signal. □
Let z = ( z 1 , z 2 , , z n ) T and z ˜ ( t ) = ( z ˜ 1 ( t ) , z ˜ 2 ( t ) , , z ˜ n ( t ) ) T be an equilibrium point and any solution of (1a) and (1b), respectively. Denote
z i ( t ) = z ˜ i ( t ) z i , h i q z i ( t ) = h ˜ i q z i ( t ) + z i , d i q z i ( t ) = d ˜ i q z i ( t ) + z i d ˜ i q z i , f j q ( z j ( t ) ) = g j q ( z j ( t ) + z j ) g j q ( z j ) , ϕ 1 i k z 1 ( t k ) , , z n ( t k ) = ϕ ˜ 1 i k z 1 ( t k ) + z 1 , , z n ( t k ) + z n ϕ ˜ 1 i k z 1 , , z n , ϕ 2 i k z 1 t k τ i 1 t k , , z n t k τ i n t k = ϕ ˜ 2 i k z 1 t k τ i 1 t k + z 1 , , z n t k τ i n t k + z n ϕ ˜ 2 i k z 1 , , z n ,
then, (1a) and (1b) is readily converted to the forms as follows:
d z i t d t = h i σ t z i ( t ) d i σ t z i t + j = 1 n [ a i j σ t f j σ t z j t + b i j σ t f j σ t z j t τ i j σ t t + c i j σ t t χ i j σ t t s f j σ t z j s d s ] } , t t k ,
z i t k = ϕ 1 i k z 1 ( t k ) , , z n ( t k ) + ϕ 2 i k z 1 ( t k τ i 1 t k ) , , z n ( t k τ i n t k ) ,
where i = 1 , 2 , , n , k = 1 , 2 , . Let φ i s = φ ˜ i s z i be the initial condition of (11a) and (11b).
Define the indicator function ς t = ς 1 t , ς 2 t , , ς m t T , where
ς q t = 1 , when the q - th subnetworks is activated ; 0 , otherwise .
Therefore, (11a) and (11b) without impulsive effect is converted to the form:
d z i t d t = q = 1 m ς q ( t ) h i q z i ( t ) { d i q z i t + j = 1 n [ a i j q f j q z j t + b i j q f j q z j t τ i j q t + c i j q t χ i j q t s f j q z j s d s ] } , i = 1 , 2 , , n .
Lemma 3. 
It is assumed that Assumptions 1–3 are true. If ξ = ( ξ 1 , ξ 2 , , ξ n ) T is a positive vector over the real n-space R n , and λ is a positive real number, such that for all q Ξ , inequalities
λ H i q D i q ξ i + j = 1 n L j q ξ j | a i j q | + exp ( λ 2 τ q ) | b i j q | + | c i j q | Υ i j q ( λ 2 ) < 0
hold; then, for A q A q I , B q B q I , and C q C q I , the equilibrium point of (12) is robustly exponentially stable under arbitrary switching.
Proof of Lemma 3. 
Choose a candidate vector Lyapunov function as depicted below:
V i ( t , z i ( t ) ) = exp λ ( t t 0 ) z i t 2 .
After taking Assumptions 1–3 into account and computing the upper right derivative of V i ( t , z i ( t ) ) along (12), we obtain
D + V i t , z i ( t ) = λ exp ( λ ( t t 0 ) ) z i ( t ) 2 + exp λ ( t t 0 ) Re z i ( t ) ¯ z ˙ i ( t ) = λ exp ( λ ( t t 0 ) ) z i ( t ) 2 + exp λ ( t t 0 ) Re z i ( t ) ¯ q = 1 m ς q ( t ) h i q z i ( t ) ( d i q z i t + j = 1 n ( a i j q f j q z j t + b i j q f j q z j t τ i j q t + c i j q t χ i j q t s f j q z j s d s ) ] } λ exp ( λ ( t t 0 ) ) z i ( t ) 2 + exp λ ( t t 0 ) q = 1 m ς q ( t ) h i q z i ( t ) ( D i q | z i t | 2 + | z i ( t ) ¯ | j = 1 n L j q ( | a i j q | | z j t | + | b i j q | | z j t τ i j q | + | c i j q | t χ i j q t s | z j s | d s ) ] } exp ( λ 2 ( t t 0 ) ) z i ( t ) q = 1 m ς q ( t ) h i q z i ( t ) exp ( λ 2 ( t t 0 ) ) λ H i q D i q | z i t | + exp ( λ 2 ( t t 0 ) ) j = 1 n L j q ( | a ˜ i j q | | z j t | + | b ˜ i j q | | z j t τ i j q | + | c ˜ i j q | t χ i j q t s | z j s | d s ) ] V i ( t , z i ( t ) ) q = 1 m ς q ( t ) h i q z i ( t ) λ H i q D i q V i ( t , z i ( t ) ) + j = 1 n L j q ( | a ˜ i j q | V j ( t , z j ( t ) ) + exp ( λ 2 τ q ) | b ˜ i j q | V j ( t τ i j q , z j ( t τ i j q ) ) + | c ˜ i j q | t χ i j q t s exp ( λ 2 ( t s ) ) V j ( s , z j ( s ) ) d s ) ,
where i = 1 , 2 , , n . Let U i ( t , z i ( t ) ) = V i ( t , z i ( t ) ) . If there is no ambiguity, we indicate U i ( t ) = U i ( t , z i ( t ) ) for convenience. Substituting them into inequalities (15), we obtain
D + U i ( t ) 1 2 q = 1 m ς q ( t ) h i q z i ( t ) λ H i q D i q U i ( t ) + j = 1 n L j q ( | a ˜ i j q | U j ( t ) + exp ( λ 2 τ q ) | b ˜ i j q | sup t τ q s t U j ( s ) + | c ˜ i j q | t χ i j q t s exp ( λ 2 ( t s ) ) U j ( s ) d s ) ,
for i = 1 , 2 , , n .
Defining a curve = x ( l ) : x i = ξ i l , l > 0 , i = 1 , 2 , , n over R n and a set Λ x = u : 0 u x ,   x . Let l 0 = ψ t 0 / ξ min , where ψ t 0 = sup s , t 0 ψ ( s ) and ξ min = min 1 i n ξ i . Evidently, Λ x l Λ x l as l > l . Defining the set
U = U : U i = exp ( λ 2 s t 0 ) ψ i s , i = 1 , 2 , , n , < s t 0 .
Obviously, U Λ x l 0 , i.e.,
U i ( s ) = exp ( λ 2 s t 0 ) ψ i s < ξ i l 0 , < s t 0 , i = 1 , 2 , , n .
Furthermore, we assert that U i ( t ) < ξ i l 0 for t t 0 ; here, i = 1 , 2 , , n . In case it is false, there is at least one indicator p { 1 , 2 , , n } and the corresponding moment t > t 0 such that U p ( t ) = ξ p l 0 , D + U p ( t ) 0 and U i ( t ) < ξ i l 0 ( i = 1 , 2 , , n , i p ) for t 0 t t . Substituting them into (16) and considering (13), we have
D + U p ( t ) 1 2 q = 1 m ς q ( t ) h p q z p ( t ) λ H p q D p q U p ( t ) + j = 1 n L j q ( | a ˜ p j q | U j ( t ) + exp ( λ 2 τ q ) | b ˜ p j q | sup t τ q s t U j ( s ) + | c ˜ p j q | t χ p j q t s exp ( λ 2 ( t s ) ) U j ( s ) d s ) 1 2 q = 1 m ς q ( t ) h p q z p ( t ) λ H p q D p q ξ p l 0 + j = 1 n L j q ξ j l 0 | a ˜ p j q | + exp ( λ 2 τ q ) | b ˜ p j q | + | c ˜ p j q | Υ p j q ( λ 2 ) < 0 .
This conflicts with the statement D + U p ( t ) 0 . Therefore, we obtain U i ( t ) < ξ i l 0 , i = 1 , 2 , , n , i.e., for t t 0
| z i ( t ) | < exp ( λ 2 ( t t 0 ) ) ξ i l 0 = ξ i ξ min ψ t 0 exp ( λ 2 ( t t 0 ) ) , i = 1 , 2 , , n .
Let M = max 1 i n { ξ i } / ξ min lead to
z ( t ) < M ψ t 0 exp ( λ 2 ( t t 0 ) ) , t t 0 .
According to Definition 1, the equilibrium point of (12) demonstrates robust exponential stability, with the exponential convergence rate being λ / 2 . □
Let M and N be a non-negative M-matrix and a matrix with non-negative entries, respectively. We refer to 1 ( M ) = Δ ξ R n | M ξ > 0 , ξ > 0 and 2 ( N ) = Δ ξ R n | N ξ = ρ N ξ , ξ > 0 . In the following, we shall derive criteria that guarantee the robustly exponential stability of (12) using the characteristics of the M-matrix and the result of Lemma 3.
Theorem 2. 
It is supposed that Assumptions 1–3 hold. Provided the following conditions are met:
1. 
D q = ( d i j q ) n × n , q Ξ are nonsingular M-matrices, where
d i i q = D i q , i = 1 , 2 , , n ,
d i j q = L j q ( | a ˜ i j q | + | b ˜ i j q | + | c ˜ i j q | ) , i , j = 1 , 2 , , n and i j ;
2. 
D = q = 1 m 1 ( D q ) is nonempty;
then, for A q A q I , B q B q I , and C q C q I , the equilibrium point of (12) not only exists but is also unique, exhibiting robust exponential stability under arbitrary switching. Additionally, the exponential convergence rate λ for (12) can be determined by the inequality (13), corresponding to a given vector ξ D .
Proof of Theorem 2. 
From condition 1 in Theorem 2, along with Theorem 1, it can be deduced that for any given switching signal, (12) has a unique equilibrium point. Since D = q = 1 m 1 ( D q ) is nonempty, it can be concluded from Lemma 3 that there exists at least one vector ξ = ξ 1 , ξ 2 , , ξ n T D 1 ( D q ) such that
ξ i D i q + j = 1 n ξ j L j q ( | a ˜ i j q | + | b ˜ i j q | + | c ˜ i j q | ) < 0 ,
for i = 1 , 2 , , n and q Ξ .
Consider functions
F i q ( λ ) = λ H i q D i q ξ i + j = 1 n L j q ξ j | a ˜ i j q | + exp ( λ 2 τ q ) | b ˜ i j q | + | c ˜ i j q | Υ i j q ( λ 2 ) , i = 1 , 2 , , n ; q Ξ .
It follows from (18) and (19) that F i q λ C 0 and F i q 0 < 0 . Calculating the derivative of F i q ( λ ) , we obtain d F i q λ / d λ > 0 . Therefore, there are constants λ i q > 0 , such that
F i q ( λ i q ) = λ i q H i q D i q ξ i + j = 1 n L j q ξ j | a ˜ i j q | + exp ( λ i q 2 τ q ) | b ˜ i j q | + | c ˜ i j q | Υ i j q ( λ i q 2 ) = 0 ,
for i = 1 , 2 , , n ; q Ξ .
Let 0 < λ min < min 1 i n , 1 q m λ i q ; then, for i = 1 , 2 , , n and q Ξ
F i q ( λ min ) = λ min H i q D i q ξ i + j = 1 n L j q ξ j | a ˜ i j q | + exp ( λ min 2 τ q ) | b ˜ i j q | + | c ˜ i j q | Υ i j q ( λ min 2 ) < 0 .
With reference to (21) and Lemma 3, it is evident that the unique equilibrium point of (12) is robustly exponentially stable under arbitrary switching. □
Remark 3. 
In Theorem 2, the existence of the positive real number λ in Lemma 3 is proved, which depends on the given vector ξ D . Therefore, to determine the maximum convergence rate of the system λ max , we can address the optimization problem under the constraint condition F i q λ , ξ < 0 , here i = 1 , 2 , , n , q Ξ , and ξ D .
Definition 2. 
Let IP = { t 1 , t 2 , } be an impulsive sequence. The number of impulsive times during the interval t , t is shown as Π t , t for any t t 0 . If there are constant T IP > 0 and N IP 0 such that
Π IP t , t N IP + t t T IP ,
then T IP is referred to as impulsive average dwell time of IP .
Theorem 3. 
Under Assumptions 1–4, if
1. 
G q = D q L q ( | A ˜ q | + | B ˜ q | + | C ˜ q | ) , q Ξ are nonsingular M-matrices,
2. 
S q = k = 1 2 ( Φ 1 k ) 2 ( Φ 2 k ) 1 ( G q ) , q Ξ are nonempty,
3. 
Impulsive average dwell time T IP > T IP = ln γ max β , where β > 0 is determined by inequalities
β H i q D i q ξ i + j = 1 n L j q ξ j | a ˜ i j q | + exp ( β 2 τ q ) | b ˜ i j q | + | c ˜ i j q | Υ i j q ( β 2 ) < 0 ,
for some given vectors ξ S q and γ max = max γ k , γ k max 1 , ρ ( Φ 1 k ) + exp ( β 2 τ ) ρ ( Φ 2 k ) ,
then, for A q A q I , B q B q I , C q C q I , and any switching signal, the equilibrium point of (1a) and (1b) is robustly exponentially stable.
Proof of Theorem 3. 
Since G q are nonsingular M-matrices and sets S q are nonempty (here, q Ξ ), it follows from Theorem 2 that there are at least one vector ξ i 0 S i 0 1 ( G i 0 ) and a constant β > 0 such that for i = 1 , 2 , , n and q Ξ , inequalities
β H i q D i q ξ i q + j = 1 n L j q ξ j q | a ˜ i j q | + exp ( β 2 τ q ) | b ˜ i j q | + | c ˜ i j q | Υ i j q ( β 2 ) < 0
hold. Assuming the i p th subnetwork is activated when t t p , t p + 1 , then we can obtain a switching sequence t 0 , i 0 , , t p , i p , | i p Σ , p = 0 , 1 , . This, together with the proof of Lemma 3, leads to
U i ( t ) < ξ i i 0 l 0 , t ( , t 0 ] ( t 0 , t 1 ] ,
where l 0 = φ ˜ z t 0 / min 1 q m , 1 i n { ξ i q } .
The following will demonstrate that
z i ( t ) < γ 0 γ 1 γ p 1 ξ i l 0 exp ( β 2 t t 0 ) , i = 1 , 2 , , n ,
for t p 1 < t t p ( p = 1 , 2 , ) with the help of mathematical induction, where γ 0 = 1 and ξ i = max 1 q m { ξ i q } .
When p = 1 , through (23), we know that (24) holds. Now, suppose that for any switching signal and p = 1 , 2 , , h , inequalities
z i t < γ 0 γ 1 γ p 1 ξ i i p 1 l 0 exp ( β 2 t t 0 ) , i = 1 , 2 , , n ; t p 1 < t t p
hold.
We know from (25) and Assumption 4 that the discrete component of (11a) and (11b) satisfies the following:
z i t h + = ϕ 1 i h z 1 ( t h ) , , z n ( t h ) + ϕ 2 i h z 1 ( t h τ i 1 t h ) , , z n ( t h τ i n t h ) j = 1 n φ i j 1 h z j t h + j = 1 n φ i j 2 h z j ( t h τ i j ( t h ) ) j = 1 n φ i j 1 h γ 0 γ 1 γ h 1 ξ j i h 1 l 0 exp ( β 2 t h t 0 ) + j = 1 n φ i j 2 h γ 0 γ 1 γ h 1 ξ j i h 1 l 0 exp ( β 2 t h τ i j ( t h ) t 0 ) j = 1 n φ i j 1 h ξ j i h 1 + exp ( β 2 τ ) j = 1 n φ i j 2 h ξ j i h 1 γ 0 γ 1 γ h 1 l 0 exp ( β 2 t h t 0 ) ,
where i = 1 , 2 , , n . Since Φ 1 k ( Φ 2 k ) is non-negative matrix, there is at least one positive eigenvector which corresponds to the non-negative eigenvalue ρ ( Φ 1 k ) ( ρ ( Φ 2 k ) ) of Φ 1 k ( Φ 2 k ) [35]. By the definition of S q , we know that ξ i h 1 = ( ξ 1 i h 1 , ξ 2 i h 1 , , ξ n i h 1 ) T 2 ( Φ 1 h ) and ξ i h 1 2 ( Φ 2 h ) . Furthermore, we have
Φ 1 h ξ i h 1 = ρ Φ 1 h ξ i h 1 , Φ 2 h ξ i h 1 = ρ Φ 2 h ξ i h 1 ,
i.e.,
j = 1 n φ i j 1 h ξ j i h 1 = ρ Φ 1 h ξ i i h 1 , j = 1 n φ i j 2 h ξ j i h 1 = ρ Φ 2 h ξ i i h 1 ,
where i = 1 , 2 , , n . This, together with γ k max 1 , ρ ( Φ 1 k ) + exp ( β 2 τ ) ρ ( Φ 2 k ) and (26), leads to
z i t h + ρ ( Φ 1 k ) + exp ( β 2 τ ) ρ ( Φ 2 k ) γ 0 γ 1 γ h 1 l 0 ξ i i h 1 exp ( β 2 t h t 0 ) < γ 0 γ 1 γ h ξ i i h 1 l 0 exp ( β 2 t h t 0 ) γ 0 γ 1 γ h ξ i l 0 exp ( β 2 t h t 0 ) ,
for i = 1 , 2 , , n .
The following will demonstrate that for t h < t t h + 1 ,
U i t < γ 0 γ 1 γ h ξ i i h l 0 , i = 1 , 2 , , n .
In the event that (29) is not true, it implies the existence of certain i and t t h , t h + 1 such that D + U i t 0 , and
U i t = γ 0 γ 1 γ h ξ i i h l 0 ,
U j t < γ 0 γ 1 γ h ξ j i h l 0 for t < t , j = 1 , 2 , , n .
However, by (16) and (21), it is evident that
D + U i t 1 2 h i i h z i ( t ) β H i i h D i i h ξ i i h + j = 1 n L j i h ξ j i h | a ˜ i j i h | + exp ( β 2 τ i h ) | b ˜ i j i h | + | c ˜ i j i h | Υ i j i h ( β 2 ) γ 0 γ 1 γ h l 0 < 0 .
This contradicts the condition D + U i t 0 . As such, inequalities (29) hold.
That is for i = 1 , 2 , , n and t h < t t h + 1 ,
z i t < γ 0 γ 1 γ h ξ i i h l 0 exp ( β 2 ( t t 0 ) ) .
We may determine that inequalities (24) hold by using mathematical induction. So for t t 0
z i t < γ 0 γ 1 γ k 1 ξ i i k 1 l 0 exp ( β 2 ( t t 0 ) ) = exp p = 0 k 1 ln γ p β 2 ( t t 0 ) ξ i i k 1 l 0 exp Π t 0 , t ln γ max β 2 t t 0 ξ i i k 1 l 0 ξ i l 0 γ max N IP exp ( β 2 ln γ max T IP ) t t 0 = ξ i γ max N IP min 1 q m , 1 i n { ξ i q } φ ˜ z t 0 exp ( β 2 ln γ max T IP ) t t 0 .
Let M = ξ i γ max N IP min 1 q m , 1 i n { ξ i q } and ε = β 2 ln γ max T IP , then we can obtain
z ˜ ( t ) z < M sup s , t 0 φ ˜ ( s ) z exp ε t t 0 .
When T IP > T IP = ln γ max β , ε > 0 . In line with Definition 1, the equilibrium point of (1a) and (1b) is robustly exponentially stable, and the exponential convergence rate is β 2 ln γ max T IP . □
Remark 4. 
The SCVNN model in this paper, represented by Equations (1a) and (1b), is more general and encompasses several related existing models. For example, ref. [36] investigated the input-to-state stability of a class of switched impulsive memristive neural networks with time-varying delay and stochastic disturbance over R , where only the interconnected matrices within these networks contained switched signals. Additionally, in the field R of real numbers, ref. [19] studied the stability of impulsive switched neural networks with multiple time delays. Furthermore, refs. [23,28] examined the exponential stability of a class of CVNN with variable and continuously distributed delays of the system state and impulsive effects, without considering switching signals and impulsive delays in the networks.
Remark 5. 
Compared to [31], this paper employs novel analytical methods and introduces a new vector Lyapunov function. These innovations result in equilibrium existence conditions and stability conditions with lower conservatism. Additionally, the model (1) in [31] can be viewed as a special case of the SCVNN model presented in this paper when h ˜ i σ t z ˜ i ( t ) = 1 , d ˜ i σ t z ˜ i t = e i σ t z ˜ i t , and B σ t = 0 .

4. Model Design and Empirical Analysis of PCES

In order to demonstrate the usefulness of the sufficient conditions set in the previous part, a PCES example with simulation results is provided in this section.
First of all, the index system should be determined, which embodies the scientific and comprehensive principle, and the index system determines the network structure of PCES. The indicators of psychological problem characterization shown in Table 1 are listed after the psychological state has been analyzed. The development of psychological counseling is then examined, and the indicators of factors influencing the effectiveness of psychological counseling are then listed in Table 2. The two indicator systems’ complete correlation intuitively illustrates the link between the characteristics of psychological problems and the variables affecting how effective psychological counseling is. It is feasible to ascertain the weights between the secondary indicators in Table 1 and Table 2 and combine them to produce connection weight matrices for the key indicators after examining the client’s first evaluation and a number of consultations. The connection weight matrices for the various states will be determined by the evaluation of the various visitation phases. Then, the parameters of each subnetwork can be obtained.
Empirical Analysis: The work process in counseling may be simply split into three phases: initial interview, problem-solving, and end-of-counseling. By weighing the two phases of initial interview and problem solution, we can obtain two subnetworks at different stages. Therefore, consider a PCES with five evaluation indexes and two subnetworks, and the connection weight matrices of each index are given as follows:
Amplification function h i q ( z i ( t ) ) = 2 + sin ( | z i ( t ) | ) , self-feedback function d 1 1 ( z 1 ( t ) ) = 2.1 z 1 ( t ) , d 2 1 ( z 2 ( t ) ) = 2.2 z 2 ( t ) , d 3 1 ( z 3 ( t ) ) = 1.9 z 3 ( t ) , d 4 1 ( z 4 ( t ) ) = 1.8 z 4 ( t ) , d 5 1 ( z 5 ( t ) ) = 2.2 z 5 ( t ) , d 1 2 ( z 1 ( t ) ) = 2.3 z 1 ( t ) , d 2 2 ( z 2 ( t ) ) = 2.2 z 2 ( t ) , d 3 2 ( z 3 ( t ) ) = 1.9 z 3 ( t ) , d 4 2 ( z 4 ( t ) ) = 1.6 z 4 ( t ) , d 5 2 ( z 5 ( t ) ) = 2.6 z 5 ( t ) , kernel functions χ i j q ( s ) = exp ( s ) , s [ 0 , + ) , activation functions f j q z j ( t ) = 1 3 | x j | + | y j | i , where z j = x j + y j i , i , j = 1 , , 5 , q = 1 , 2 .
| A 1 I | = 0.8 , 1.0 0.5 , 0.7 0.6 , 0.8 0.2 , 0.4 0.1 , 0.3 0.4 , 0.6 0.0 , 0.2 0.3 , 0.5 0.2 , 0.4 0.6 , 0.8 0.8 , 1.0 0.3 , 0.5 0.6 , 0.8 0.2 , 0.4 0.1 , 0.3 0.1 , 0.3 0.6 , 0.8 1.0 , 1.2 0.6 , 0.8 0.2 , 0.4 0.6 , 0.8 0.4 , 0.6 1.1 , 1.3 0.0 , 0.2 0.3 , 0.5
| A 2 I | = 1.0 , 1.2 0.5 , 0.7 0.4 , 0.6 0.4 , 0.6 0.2 , 0.4 0.5 , 0.7 0.3 , 0.5 0.8 , 1.0 0.1 , 0.3 0.4 , 0.6 0.2 , 0.4 1.1 , 1.3 0.5 , 0.7 0.0 , 0.2 0.3 , 0.5 0.3 , 0.5 0.9 , 1.1 0.7 , 0.9 0.1 , 0.3 0.4 , 0.6 0.2 , 0.4 0.0 , 0.2 0.6 , 0.8 0.7 , 0.9 0.8 , 1.0
| B 1 I | = | B 2 I | = 0
| C 1 I | = 0.2 , 0.4 0.9 , 1.1 1.1 , 1.3 0.0 , 0.2 0.1 , 0.3 1.0 , 1.2 0.0 , 0.2 0.5 , 0.7 0.3 , 0.5 0.2 , 0.4 0.3 , 0.5 1.1 , 1.3 1.1 , 1.3 0.0 , 0.2 0.1 , 0.3 0.1 , 0.3 0.9 , 1.0 0.7 , 0.9 1.0 , 1.2 0.6 , 0.8 0.5 , 0.7 0.4 , 0.6 0.6 , 0.8 0.2 , 0.4 0.4 , 0.6
| C 2 I | = 0.5 , 0.7 0.6 , 0.8 1.0 , 1.2 0.1 , 0.3 0.3 , 0.5 0.3 , 0.5 0.2 , 0.4 0.6 , 0.8 0.4 , 0.6 0.4 , 0.6 0.6 , 0.8 0.6 , 0.8 0.7 , 0.9 0.5 , 0.7 0.2 , 0.4 0.2 , 0.4 0.5 , 0.7 0.4 , 0.6 0.6 , 0.8 0.4 , 0.6 1.2 , 1.4 0.5 , 0.7 1.1 , 1.3 0.4 , 0.6 0.6 , 0.8
Simple calculating yields L q = diag 1 3 , 1 3 , 1 3 , 1 3 , 1 3 , H i q = 1 , where i = 1 , , 5 , q = 1 , 2 ; D 1 = diag 2.1 , 2.2 , 1.9 , 1.8 , 2.2 , D 2 = diag 2.3 . , 2.2 , 1.9 , 1.6 , 2.6 , and
G 1 = 2.0 0.6 0.7 0.2 0.2 0.6 2.6 0.4 0.3 0.4 0.5 0.6 1.6 0.2 0.2 0.2 0.6 0.7 1.2 0.4 0.5 0.4 0.7 0.2 2.2 , G 2 = 2.3 0.5 0.6 0.3 0.3 0.4 2.4 0.6 0.3 0.4 0.4 0.7 1.6 0.3 0.3 0.3 0.6 0.5 1.0 0.4 0.6 0.3 0.7 0.5 2.5 .
Obviously, D 1 and D 2 are M-matrices. Let ξ = 1.1570 , 1.0000 , 1.3434 , 2.0960 , 1.1930 T q = 1 2 1 ( D q ) , so D is nonempty. We may infer from Theorem 2 that the system under consideration has a single equilibrium point that is robustly exponentially stable under any switching.
However, in the actual process of psychological counseling, it is found that the process and effect of psychological counseling will be affected by some unpredictable factors, such as unexpected events in the visitor’s real situation, especially major life events or experiences that will trigger the former traumatic experience, or external objective factors, such as seasonal changes, natural disasters, social hot spots, etc., so that the effect of psychological counseling will show a certain impulse effect. Consider impulsive functions
ϕ 1 i k = 3.5 z i t k , ϕ 2 i k = 2.5 z i ( t k 0.5 ) ,
as unpredictable factors of psychological counseling, where i = 1 , , 5 , k = 1 , 2 , . Obviously, Φ 1 k = 3.5 E , Φ 2 k = 2.5 E , and k = 1 2 Φ 1 k 2 Φ 2 k = ξ R n | ξ i > 0 , i = 1 , 2 , , 5 , That is, for q = 1 , 2 ,
S q = k = 1 2 ( Φ 1 k ) 2 ( Φ 2 k ) 1 ( D q )
are nonempty.
Let ξ 1 = ( 1.0000 , 1.0383 , 1.1085 , 1.7874 , 1.0249 ) T , ξ 2 = ( 1.0000 , 1.0181 , 1.3230 , 2.0727 , 1.1734 ) T , and β = 0.99 . Through calculations, we can derive that γ max = 3.5 + exp ( 0.9 2 0.5 ) 2.5 = 6.6308 and T IP = 1.9108 . According to Theorem 3, if the impulsive average dwell time exceeds 1.9108 , then the equilibrium point of the investigated system is robustly exponentially stable. In other words, this psychological counseling is effective and stable. Figure 3, Figure 4, Figure 5, Figure 6, Figure 7 and Figure 8 present the simulation outcomes for the robust stability of the PCES. The presented results are based on the initial conditions, self-feedback coefficients, and connection matrices outlined in Table 3.
Theoretical analysis and simulation results indicate that psychological counseling has effective and stable effects on individuals. During counseling, if no external negative stimuli (interference) are present, the counseling effect stabilizes gradually to an acceptable state. If occasional interference occurs during counseling, as long as its intensity does not exceed 2.6 times the original assessment state and no more than one interference happens in two consecutive counseling sessions, the counseling effect also tends to stabilize.
Remark 6. 
Theorems 2 and 3 illustrate the relationship between the robust exponential stability of SCVNN under arbitrary and restricted switching. If D q , q Ξ consists of nonsingular M-matrices, and SCVNN is at least stable under slow switching. Furthermore, confirming that D = q = 1 m 1 ( D q ) is nonempty guarantees that SCVNN remains stable under arbitrary switching. Since ξ = 1.1570 , 1.0000 , 1.3434 , 2.0960 , 1.1930 T q = 1 2 1 ( D q ) , we may infer from Theorem 2 that the system under consideration has a single equilibrium point that is robustly exponentially stable under any switching. However, the methods from [37,38] only yields stability under restricted switching. In Example 4.1 of [39], setting X 2 = diag { 0.4 , 0.4 } , Theorem 2 of this paper shows that the considered system is robustly exponentially stable under arbitrary switching. In contrast, the method from [39] also only achieves stability under restricted switching. These indicate that the conclusions obtained in this paper are less conservative compared to those in [37,38,39].
Remark 7. 
Manually determining specific parameters is often necessary to achieve desired results when utilizing the LMI technique. In contrast, the sufficient conditions presented in this study are algebraic expressions, making them more practical and intuitive. However, they have the drawback of ignoring the signs of entries in the connection weight matrices. As a result, differences between inhibitory and excitatory effects may therefore go unnoticed.
Remark 8. 
In practical applications of PCES, the primary challenges involve selecting appropriate amplification functions, self-feedback functions, and activation functions. These choices significantly influence the model’s performance and convergence speed. These functions should be selected based on the specific requirements of the task. Different tasks may necessitate different functions to achieve optimal performance.

5. Conclusions

The robust stability of a class of SCVNN with variable and distributed delays, as well as an impulsive influence on the field C of complex numbers, has been examined in this study. A set of sufficient conditions, employing homeomorphism mapping theory, M-matrix theory, and impulsive average dwell time method, have been formulated to guarantee the existence, uniqueness, and robust exponential stability of the equilibrium point of SCVNN. Based on the analysis of factors related to psychological states and those affecting the effectiveness of psychological counseling, indicators representing psychological problems and factors influencing the effectiveness of psychological counseling have been identified. Furthermore, the correlation between these two types of indicators has been analyzed, leading to the establishment of the PCES. The example of PCES with simulation results is provided to demonstrate the validity and correctness of the presented theories.

Author Contributions

Conceptualization, Y.L. and H.X.; methodology, Y.L. and H.X.; software, H.X.; investigation, Y.L.; writing—original draft preparation, Y.L. and H.X.; writing—review and editing, Y.L. and H.X.; funding acquisition, Y.L. and H.X. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by the National Natural Science Foundation (NSF) of China under Grant 12372009, in part by the NSF of Guangdong under Grant 2022A1515011971, in part by the NSF of Hanshan Normal University under Grant PNB221103, in part by the Philosophy and Social Science Planning Project of Guangdong under Grant GD20XGL25, in part by the Education Science Planning Project of Guangdong under Grant 2023GXJK385, and in part by the Behavioral Science Research Center of Hanshan Normal University under Grant PSB2101.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Li, P.; Liang, F. An assessment and analysis model of psychological health of college students based on convolutional neural networks. Comput. Intel. Neurosc. 2022, 2022, 7586918. [Google Scholar] [CrossRef]
  2. Fei, Z.; Yang, E.; Li, D.D.U.; Butler, S.; Ijomah, W.; Li, X.; Zhou, H. Deep convolution network based emotion analysis towards mental health care. Neurocomputing 2020, 388, 212–227. [Google Scholar] [CrossRef]
  3. Liu, Z.X.; Zhang, D.G.; Luo, G.Z.; Lian, M.; Liu, B. A new method of emotional analysis based on CNN–BiLSTM hybrid neural network. Cluster Comput. 2020, 23, 2901–2913. [Google Scholar] [CrossRef]
  4. Ou, S.; Guo, Z.; Ci, J.; Gong, S.; Wen, S. Multistability of switched complex-valued neural networks with state-dependent switching rules. Neurocomputing 2023, 551, 126499. [Google Scholar] [CrossRef]
  5. Grassi, G. On discrete-time cellular neural networks for associative memories. IEEE T. Circuits-I 2001, 48, 107–111. [Google Scholar] [CrossRef]
  6. Zeng, Z.; Wang, J. Design and analysis of high-capacity associative memories based on a class of discrete-time recurrent neural networks. IEEE Trans. Syst. Man Cybern. Part B Cybern. 2008, 38, 1525–1536. [Google Scholar] [CrossRef]
  7. Xiao, H.; Zhu, Q.; Karimi, H.R. Stability of stochastic delay switched neural networks with all unstable subsystems: A multiple discretized Lyapunov-Krasovskii functionals method. Inform. Sci. 2022, 582, 302–315. [Google Scholar] [CrossRef]
  8. Long, H.; Ci, J.; Guo, Z.; Wen, S.; Huang, T. Synchronization of coupled switched neural networks subject to hybrid stochastic disturbances. Neural Netw. 2023, 166, 459–470. [Google Scholar] [CrossRef]
  9. Hirose, A. Recent progress in applications of complex-valued neural networks. In Proceedings of the International Conference on Artificial Intelligence and Soft Computing, Berlin/Heidelberg, Germany, 13 June 2010. [Google Scholar]
  10. Voigtlaender, F. The universal approximation theorem for complex-valued neural networks. Appl. Comput. Harmon. Anal. 2023, 64, 33–61. [Google Scholar] [CrossRef]
  11. Geuchen, P.; Voigtlaender, F. Optimal approximation using complex-valued neural networks. NeurIPS 2023, 36, 1681–1737. [Google Scholar]
  12. Zhao, W.; Huang, H. Adaptive stepsize estimation based accelerated gradient descent algorithm for fully complex-valued neural networks. Expert Syst. Appl. 2024, 236, 121166. [Google Scholar] [CrossRef]
  13. Wang, Y.; Zheng, C.D.; Lin, M. Robust stability of semi-markovian complex-valued neural networks with generally uncertain transition rates. Circ. Syst. Signal Pr. 2024, 43, 2723–2757. [Google Scholar] [CrossRef]
  14. Duan, L.; Shi, M.; Huang, C.; Fang, X. Synchronization in finite-/fixed-time of delayed diffusive complex-valued neural networks with discontinuous activations. Chaos Soliton. Fract. 2021, 142, 110386. [Google Scholar] [CrossRef]
  15. You, X.; Song, Q.; Zhao, Z. Existence and finite-time stability of discrete fractional-order complex-valued neural networks with time delays. Neural Netw. 2020, 123, 248–260. [Google Scholar] [CrossRef]
  16. Cao, Y.; Sriraman, R.; Shyamsundarraj, N.; Samidurai, R. Robust stability of uncertain stochastic complex-valued neural networks with additive time-varying delays. Math. Comput. Simulat. 2020, 171, 207–220. [Google Scholar] [CrossRef]
  17. Xue, H.; Zhang, J. Robust exponential stability of interconnected switched systems with mixed delays and impulsive effect. Nonlinear Dynam. 2019, 97, 679–696. [Google Scholar] [CrossRef]
  18. Song, Q.; Cao, J. Stability analysis of cohen-grossberg neural network with both time-varying and continuously distributed delays. J. Comput. Appl. Math. 2006, 197, 188–203. [Google Scholar] [CrossRef]
  19. Xue, H.; Xu, X.; Zhang, J.; Yang, X. Robust stability of impulsive switched neural networks with multiple time delays. Appl. Math. Comput. 2019, 359, 456–475. [Google Scholar] [CrossRef]
  20. Jian, J.; Wan, P. Global exponential convergence of fuzzy complex-valued neural networks with time-varying delays and impulsive effects. Fuzzy Set. Syst. 2018, 338, 23–39. [Google Scholar] [CrossRef]
  21. Song, Q.; Yu, Q.; Zhao, Z.; Liu, Y. Alsaadi, F.E. Dynamics of complex-valued neural networks with variable coefficients and proportional delays. Neurocomputing 2018, 275, 2762–2768. [Google Scholar] [CrossRef]
  22. Li, N.; Cao, J. Switched exponential state estimation and robust stability for interval neural networks with the average dwell time. IMA J. Math. Control Inf. 2015, 32, 257–276. [Google Scholar] [CrossRef]
  23. Xu, X.; Zhang, J.; Xu, Q.; Chen, Z.; Zheng, W. Impulsive disturbances on the dynamical behavior of complex-valued cohen-grossberg neural networks with both time-varying delays and continuously distributed delays. Complexity 2017, 2017, 3826729. [Google Scholar] [CrossRef]
  24. Hu, J.; Wang, J. Global stability of complex-valued recurrent neural networks with time-delays. IEEE T. Neur. Net. Lear. 2012, 23, 853–865. [Google Scholar] [CrossRef]
  25. Huang, Y.; Zhang, H.; Wang, Z. Multistability of complex-valued recurrent neural networks with real-imaginary-type activation functions. Appl. Math. Comput. 2014, 229, 187–200. [Google Scholar] [CrossRef]
  26. Rakkiyappan, R.; Cao, J.; Velmurugan, G. Existence and uniform stability analysis of fractional-order complex-valued neural networks with time delays. IEEE T. Neur. Net. Lear. 2014, 26, 84–97. [Google Scholar] [CrossRef]
  27. Xu, X.; Zhang, J.; Shi, J. Exponential stability of complex-valued neural networks with mixed delays. Neurocomputing 2014, 128, 483–490. [Google Scholar] [CrossRef]
  28. Xu, X.; Zhang, J.; Shi, J. Dynamical behaviour analysis of delayed complex-valued neural networks with impulsive effect. Int. J. Syst. Sci. 2017, 48, 686–694. [Google Scholar] [CrossRef]
  29. Rakkiyappan, R.; Velmurugan, G.; Cao, J. Multiple μ-stability analysis of complex-valued neural networks with unbounded time-varying delays. Neurocomputing 2015, 149, 594–607. [Google Scholar] [CrossRef]
  30. Zhang, Z.; Yu, S. Global asymptotic stability for a class of complex-valued cohen–grossberg neural networks with time delays. Neurocomputing 2016, 171, 1158–1166. [Google Scholar] [CrossRef]
  31. Zhang, L.; Xue, H.; Li, Z.; Wei, Y. Robust stability analysis of switched grey neural network models with distributed delays over C. Grey Syst. 2022, 12, 879–896. [Google Scholar] [CrossRef]
  32. Šiljak, D. Large-Scale Dynamic Systems, Stability and Structure; Elsevier: Amsterdam, The Netherlands, 1978. [Google Scholar]
  33. Forti, M.; Tesi, A. New conditions for global stability of neural networks with application to linear and quadratic programming problems. IEEE T. Circuits-I 1995, 42, 354–366. [Google Scholar] [CrossRef]
  34. Zhang, J.; Suda, Y.; Iwasa, T. Absolutely exponential stability of a class of neural networks with unbounded delay. Neural Netw. 2004, 17, 391–397. [Google Scholar] [CrossRef]
  35. Minc, H. Nonnegative Matrices; Wiley: New York, NY, USA, 1988. [Google Scholar]
  36. Li, C.; Lian, J.; Wang, Y. Stability of switched memristive neural networks with impulse and stochastic disturbance. Neurocomputing 2018, 275, 2565–2573. [Google Scholar] [CrossRef]
  37. Wu, Y.; Cao, J.; Alofi, A.; Abdullah, A.M.; Elaiw, A. Finite-time boundedness and stabilization of uncertain switched neural networks with time-varying delay. Neural Netw. 2015, 69, 135–143. [Google Scholar] [CrossRef]
  38. Shen, W.; Zeng, Z.; Wang, L. Stability analysis for uncertain switched neural networks with time-varying delay. Neural Netw. 2016, 83, 32–41. [Google Scholar] [CrossRef]
  39. Ali, M.S.; Saravanan, S. Finite-time stability for memristor based switched neural networks with time-varying delays via average dwell time approach. Neurocomputing 2018, 275, 1637–1649. [Google Scholar] [CrossRef]
Figure 1. Topological structure diagram of neural networks.
Figure 1. Topological structure diagram of neural networks.
Mathematics 12 02097 g001
Figure 2. Topological structure diagram of switched neural networks.
Figure 2. Topological structure diagram of switched neural networks.
Mathematics 12 02097 g002
Figure 3. State curves of subnetwork 1.
Figure 3. State curves of subnetwork 1.
Mathematics 12 02097 g003
Figure 4. State curves of subnetwork 2.
Figure 4. State curves of subnetwork 2.
Mathematics 12 02097 g004
Figure 5. Real-part curves and imaginary-part curves of the considered system.
Figure 5. Real-part curves and imaginary-part curves of the considered system.
Mathematics 12 02097 g005
Figure 6. Partial enlarged view of Figure 5.
Figure 6. Partial enlarged view of Figure 5.
Mathematics 12 02097 g006
Figure 7. State module curves of the considered system.
Figure 7. State module curves of the considered system.
Mathematics 12 02097 g007
Figure 8. Partial enlarged view of Figure 7.
Figure 8. Partial enlarged view of Figure 7.
Mathematics 12 02097 g008
Table 1. Characterization of psychological problems.
Table 1. Characterization of psychological problems.
Level 1 IndicatorsLevel 2 Indicators
Cognitive FunctionsMemory skills
Attention
Comprehension
Expression
Emotional ResponsesAnxiety depression
Irritability
Mental instability
Maladjustment
Interpersonal CommunicationInterpersonal alienation
Interpersonal conflict
Intimacy
Obsessive-compulsive behavior
BehaviorSleepiness
Crying
Self-injury/suicide
Aggressive behavior
Physical ReactionsDizziness and headaches
Muscle reactions
Memory skills
Table 2. Factors influencing the effectiveness of counseling.
Table 2. Factors influencing the effectiveness of counseling.
Level 1 IndicatorsLevel 2 Indicators
The Factors of the ClientMotivation for change
Personality factors
Reflection and Self-reflection
Duration of psychological
Severity of psychological
The Factors of CounselorsCompetencies for counselors
Theoretical techniques of selected counseling
Counselor’s personality traits
Degree of compatibility with visitors
Relationship between Consultants and ClientSafe
Holding
Sincerely open
Consultation SsettingsCounseling environment
Counseling Frequency
Duration
Ethical setting
Other factorsSocial support systems
Placebo effect
Unknown factors
Table 3. Initial states and interconnection matrices for numerical simulation.
Table 3. Initial states and interconnection matrices for numerical simulation.
Subnetwork 1Subnetwork 2
A 0.6 + 0.9 i 0.3 + 0.6 i 0.4 + 0.7 i 0.2 + 0.3 i 0.2 + 0.2 i 0.6 0.2 i 0.2 + 0.1 i 0.4 0.3 i 0.3 0.3 i 0.7 0.3 i 0.5 0.9 i 0.3 + 0.2 i 0.7 + 0.4 i 0.1 0.4 i 0.1 0.3 i 0.2 0.2 i 0.5 0.6 i 0.8 + 0.9 i 0.7 0.4 i 0.4 0.1 i 0.4 0.7 i 0.4 0.5 i 0.8 i 0.1 0.2 i 0.4 0.3 i 1.1 0.5 i 0.2 + 0.7 i 0.5 0.4 i 0.2 0.6 i 0.4 + 0.2 i 0.2 + 0.7 i 0.4 + 0.3 i 0.8 + 0.7 i 0.1 0.3 i 0.2 + 0.6 i 0.2 0.4 i 1.3 0.5 i 0.5 0.5 i 0.1 + 0.2 i 0.2 0.5 i 0.3 + 0.4 i 0.5 1.0 i 0.5 0.8 i 0.3 0.1 i 0.3 + 0.5 i 0.4 0.2 i 0.2 0.1 i 0.6 0.6 i 0.5 0.8 i 0.8 0.6 i
C 0.3 0.2 i 0.9 + 0.6 i 0.6 + 1.2 i 0.2 i 0.2 0.1 i 0.5 + 1.1 i 0.2 0.1 i 0.4 0.6 i 0.4 + 0.3 i 0.3 + 0.3 i 0.5 + 0.1 i 0.7 1.1 i 0.2 + 1.3 i 0.2 + 0.1 i 0.3 + 0.1 i 0.3 0.1 i 0.8 + 0.7 i 0.4 0.8 i 0.5 + 1.1 i 0.7 0.4 i 0.7 0.2 i 0.3 + 0.5 i 0.7 0.4 i 0.4 0.1 i 0.5 0.4 i 0.5 0.5 i 0.4 + 0.7 i 0.3 1.2 i 0.2 + 0.2 i 0.5 0.2 i 0.3 + 0.4 i 0.3 0.3 i 0.7 + 0.4 i 0.6 + 0.2 i 0.3 0.5 i 0.8 + 0.2 i 0.4 + 0.7 i 0.2 + 0.9 i 0.7 + 0.2 i 0.3 0.2 i 0.3 0.3 i 0.5 0.5 i 0.5 0.3 i 0.7 + 0.4 i 0.5 0.4 i 1.3 0.6 i 0.6 0.3 i 1.2 0.6 i 0.5 0.3 i 0.7 0.4 i
φ ( s ) ( 0.5 i , 1 + 1.2 i , 1 + 1.5 i , 0.8 , 0.7 ) T ( 0.1 + 0.5 i , 1.2 , 1.5 , 0.9 , 0.3 ) T
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Li, Y.; Xue, H. Robust Stability Analysis of Switched Neural Networks with Application in Psychological Counseling Evaluation System. Mathematics 2024, 12, 2097. https://doi.org/10.3390/math12132097

AMA Style

Li Y, Xue H. Robust Stability Analysis of Switched Neural Networks with Application in Psychological Counseling Evaluation System. Mathematics. 2024; 12(13):2097. https://doi.org/10.3390/math12132097

Chicago/Turabian Style

Li, Yajuan, and Huanbin Xue. 2024. "Robust Stability Analysis of Switched Neural Networks with Application in Psychological Counseling Evaluation System" Mathematics 12, no. 13: 2097. https://doi.org/10.3390/math12132097

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop