Processing math: 88%
Research article Special Issues

Event-triggered fixed/preassigned time stabilization of state-dependent switching neural networks with mixed time delays

  • This study employed an event-triggered control (ETC) strategy to investigate the problems of fixed-time stabilization (FTS) and preassigned-time stabilization (PTS) for state-dependent switching neural networks (SDSNNs) that involved mixed time delays. To enhance the network's generalization capability and accelerate convergence stabilization, a more intricate weight-switching mechanism was introduced, then to mitigate transmission energy consumption, this paper proposed a tailored event-triggering rule that triggered the ETC solely at predetermined time points. This rule ensured the stability of the system while effectively reducing energy consumption. Using the Lyapunov stability theory and various inequality techniques, this paper presented new results for FTS and PTS of SDSNNs. The validity of these findings was supported by conducting data simulations in two illustrative examples.

    Citation: Jiashu Gao, Jing Han, Guodong Zhang. Event-triggered fixed/preassigned time stabilization of state-dependent switching neural networks with mixed time delays[J]. AIMS Mathematics, 2024, 9(4): 9211-9231. doi: 10.3934/math.2024449

    Related Papers:

    [1] Shichao Li, Zeeshan Ali, Peide Liu . Prioritized Hamy mean operators based on Dombi t-norm and t-conorm for the complex interval-valued Atanassov-Intuitionistic fuzzy sets and their applications in strategic decision-making problems. AIMS Mathematics, 2025, 10(3): 6589-6635. doi: 10.3934/math.2025302
    [2] Le Fu, Jingxuan Chen, Xuanchen Li, Chunfeng Suo . Novel information measures considering the closest crisp set on fuzzy multi-attribute decision making. AIMS Mathematics, 2025, 10(2): 2974-2997. doi: 10.3934/math.2025138
    [3] Yanhong Su, Zengtai Gong, Na Qin . Complex interval-value intuitionistic fuzzy sets: Quaternion number representation, correlation coefficient and applications. AIMS Mathematics, 2024, 9(8): 19943-19966. doi: 10.3934/math.2024973
    [4] Chunfeng Suo, Yan Wang, Dan Mou . The new construction of knowledge measure on intuitionistic fuzzy sets and interval-valued intuitionistic fuzzy sets. AIMS Mathematics, 2023, 8(11): 27113-27127. doi: 10.3934/math.20231387
    [5] Ali Al Khabyah, Haseeb Ahmad, Ali Ahmad, Ali N. A. Koam . A uniform interval-valued intuitionistic fuzzy environment: topological descriptors and their application in neural networks. AIMS Mathematics, 2024, 9(10): 28792-28812. doi: 10.3934/math.20241397
    [6] Ali Ahmad, Humera Rashid, Hamdan Alshehri, Muhammad Kamran Jamil, Haitham Assiri . Randić energies in decision making for human trafficking by interval-valued T-spherical fuzzy Hamacher graphs. AIMS Mathematics, 2025, 10(4): 9697-9747. doi: 10.3934/math.2025446
    [7] Warud Nakkhasen, Teerapan Jodnok, Ronnason Chinram . Intra-regular semihypergroups characterized by Fermatean fuzzy bi-hyperideals. AIMS Mathematics, 2024, 9(12): 35800-35822. doi: 10.3934/math.20241698
    [8] Li Li, Xin Wang . Hamming distance-based knowledge measure and entropy for interval-valued Pythagorean fuzzy sets. AIMS Mathematics, 2025, 10(4): 8707-8720. doi: 10.3934/math.2025399
    [9] Maysaa Al-Qurashi, Mohammed Shehu Shagari, Saima Rashid, Y. S. Hamed, Mohamed S. Mohamed . Stability of intuitionistic fuzzy set-valued maps and solutions of integral inclusions. AIMS Mathematics, 2022, 7(1): 315-333. doi: 10.3934/math.2022022
    [10] Rajab Ali Borzooei, Hee Sik Kim, Young Bae Jun, Sun Shin Ahn . MBJ-neutrosophic subalgebras and filters in BE-algebras. AIMS Mathematics, 2022, 7(4): 6016-6033. doi: 10.3934/math.2022335
  • This study employed an event-triggered control (ETC) strategy to investigate the problems of fixed-time stabilization (FTS) and preassigned-time stabilization (PTS) for state-dependent switching neural networks (SDSNNs) that involved mixed time delays. To enhance the network's generalization capability and accelerate convergence stabilization, a more intricate weight-switching mechanism was introduced, then to mitigate transmission energy consumption, this paper proposed a tailored event-triggering rule that triggered the ETC solely at predetermined time points. This rule ensured the stability of the system while effectively reducing energy consumption. Using the Lyapunov stability theory and various inequality techniques, this paper presented new results for FTS and PTS of SDSNNs. The validity of these findings was supported by conducting data simulations in two illustrative examples.



    The idea of generalization of a commutative semigroup was first introduced by Kazim and Naseeruddin in 1972 [11]. They named it as a left almost semigroup (LA-semigroup). It is also called an Abel-Grassmann's groupoid (AG-groupoid) [18]. An AG-groupoid is a non-associative and non-commutative algebraic structure mid way between a groupoid and a commutative semigroup [15]. An AG-groupoid with left identity is called an AG-group if it has inverses [10]. An AG-groupoid is a groupoid S whose elements satisfy the left invertive law (ab)c=(cb)a for all a,b,cS. In [11], it was shown that an AG-groupoid S is medial, that is, (ab)(cd)=(ac)(bd) holds for all a,b,c,dS. A left identity may or may not exist in an AG-groupoid. The left identity of an AG-groupoid allows the inverses of elements. If an AG-groupoid has a left identity, then it is unique [15]. The paramedial law (ab)(cd)=(dc)(ba) holds for all a,b,c,dS in an AG-groupoid S with left identity. We can get a(bc)=b(ac) for all a,b,cS by applying medial law with left identity. An AG-groupoid (S,) together with a partial order on S that is compatible with an AG-groupoid operation, meaning that for x,y,zS, xyzxzy and xzyz, is called an ordered AG-groupoid [12]. Different classes of an ordered AG-groupoid such as left regular, right regular and completely regular ordered AG-groupoids have been characterized by using several ideals for example fuzzy interior ideals, fuzzy left (right) ideals and soft ideals in [1,24,25,26,27,28].

    The algebraic structures described above are usually considered as theoretical tools with merely no real application. In other words, to deal with real-world uncertain and ambiguous problems, the strategies commonly used in classical mathematics are not always useful. To utilize these tools their connection with fuzzy set theory is required. To fimiliarize the reader with fuzzy set theory we now review the brief history of fuzzy sets and their extensions.

    In 1965, Zadeh [30] proposed the concept of fuzzy sets as an extension of the classical notion of sets. In traditional set theory, an element is either in or out of the set. Fuzzy set theory, on the other hand, allows for a gradual determination of the membership of elements in a set, which is represented using a membership function having a value in the real unit interval [0,1]. Since the membership functions of fuzzy sets constrained to values 0 or 1 are special cases of the characteristic functions of classical sets, this shows that the fuzzy sets generalize the classical sets. In many cases, however, because the membership function is a single-valued function, it cannot be used to represent both support and objection evidences. The intuitionistic fuzzy set, which is a generalization of Zadeh's fuzzy set, was introduced by Atanassov [2]. It has both a membership and a non-membership function, allowing it to better express the fuzzy character of data than Zadeh's fuzzy set, which only has a membership function. The values of the membership function and the non-membership function in an IFS are some times difficult to describe as exact numbers in real-world decision problems. Instead, the ranges of their values are frequently provided. In such instances, Atanassov and Gargov generalized the idea of intuitionistic fuzzy set to interval-valued intuitionistic fuzzy set (IVIFS) [3]. In view of above information from the literature, the motivation of this paper is based upon the following points:

    ● To develop a connection between AG-groupoids and fuzzy set theory by developing a technique for ranking fuzzy numbers.

    ● The main difference between IFS and IVIFS is that the membership and non-membership functions in IFS are represented by numbers while in IVIFS they are represented as intervals. If in IVIFS the intervals of zero length (same end points) are considered they become IFS, hence they generalize the idea of IFS. So the motivation is to develop results based upon IVIFS therefore they also hold for IFS at the same time.

    This paper consist of six sections. In Section 1, the introduction to literature regarding AG-groupoids and fuzzy set theory is given. Section 2 covers the necessary background required to develop understanding for the upcoming sections. IVIF-score left (right) ideals are defined and supported with examples and visualization in Section 3. Sections 4 and 5 consist of structural properties of different IVIF-score ideals and their practical applications respectively. main findings and future research direction is given in Section 6.

    A fuzzy set [30] f on a non-empty set S is an object, with grades of membership μf(s):S[0,1] having the form

    f={(s,μf(s))/sS}.

    The membership function μf(s) assigns each element s of f a single number form [0,1]. However, as the membership function is only a single-valued function, which cannot be used to express the membership and non-membership evidences in many practical scenarios.

    An intuitionistic fuzzy set (IFS) [2] F of a non empty set S is an object having the form

    F={(x,μF(x),υF(x))/xS}.

    The functions μF:S[0,1] and υF:S[0,1] denote the degree of membership and the degree of non-membership of x in F respectively such that for all xS, we have

    0μF(x)+υF(x)1.

    An interval-valued intuitionistic fuzzy set (IVIFS) [3] I of a non empty set S is an object having the form

    I={(x,μI(x),υI(x))/xS},

    where

    μI(x)[0,1] and υI(x)[0,1], xS,

    with the condition

    supμI(x)+supυI(x)1.

    Clearly, if

    infμI(x)=supμI(x) and infυI(x)=supυI(x),

    then the IVIFS reduces to IFS [2].

    According to the above definition, the basic component of an IVIFS is an ordered pair with an interval-valued membership degree and an interval-valued nonmembership degree of x in I. An interval-valued intuitionistic fuzzy number (IVIFN) is the term given to this ordered pair [20]. For simplicity, an IVIFN is usually stated as

    ξ=([a,b],[c,d]),

    where

    [a,b][0,1],[c,d][0,1],b+d1.

    Xu also proposes a score function and an accuracy function for IVIFNs in [20] and uses them to develop an approach to multi-attribute decision making problems.

    In order to rank the IVIFNs, we now introduce the unit-valued score function, (uv-score function) as follows:

    Definition 1. Let I be the set of all IVIFNs. A uv-score function on I can be defined by the mapping

    Θ(μ,υ):I[0,1] such that Θ(μ,υ)(ξ)=|a+b||c+d|+24,

    where ξ=([a,b],[c,d]), Θ(μ,υ) is the uv-score function,   and Θ(μ,υ)(ξ) is the uv-score of ξ.

    In particular,

    if Θ(μ,υ)(ξ)=1, then the IVIFN ξ takes the largest value ξ+=([1,1],[0,0]).

    If Θ(μ,υ)(ξ)=0, then the IVIFN ξ takes the smallest value ξ=([0,0],[1,1]). Clearly, the greater the Θ(μ,υ)(ξ), the larger the ξ.

    Let

    ξ1=([0.2,0.5],[0.1,0.3]) and ξ2=([0.1,0.6],[0.1,0.2])

    be the two IVIFNs. Then the uv -scores of ξ1 and ξ2 are as follows:

    Θ(μ,υ)(ξ1)=0.575 and Θ(μ,υ)(ξ2)=0.6.

    Since, the uv-score of an IVIFN ξ2 is higher than that of an IVIFN ξ1. So

    Θ(μ,υ)(ξ2)>Θ(μ,υ)(ξ1).

    However, if we take

    ξ1=([0.2,0.6],[0.1,0.4]) and ξ2=([0,0.4],[0,0.1]),

    then

    Θ(μ,υ)(ξ2)=Θ(μ,υ)(ξ1).

    In this case, the uv-score function cannot distinguish between the IVIFNs ξ1 and ξ2. To address this issue, consider the following definition of a uv-accuracy function.

    Definition 2. [20] Let I be the set of all IVIFNs. A uv-accuracy function on I is a mapping

    Φ(μ,υ):I[0,1] such that Φ(μ,υ)(ξ)=a+b+c+d2,

    where ξ=([a,b],[c,d]), Φ(μ,υ) is the uv-accuracy function of ξ, and Φ(μ,υ)(ξ) is the uv-accuracy degree of ξ.

    From above IVIFNs

    ξ1=([0.2,0.6],[0.1,0.4]) and ξ2=([0,0.4],[0,0.3]),

    the uv-accuracy degrees of ξ1 and ξ2 are as follows:

    Φ(μ,υ)(ξ1)=0.65 and Φ(μ,υ)(ξ2)=0.25.

    Since, the uv-accuracy degree of an IVIFN ξ1 is higher than that of an IVIFN, so

    ξ2.Φ(μ,υ)(ξ1)>Φ(μ,υ)(ξ2).

    The hesitancy degree of IVIFNs can be defined by the following formula [20]

    Λ(μ,υ)(ξ)=1(b+c)+a+d.

    The relationship between the score function and the accuracy function has been established to be similar to the relationship between the mean and variance in statistics [6]. In statistics, an efficient estimator is described as a measure of the variance of an estimate's sampling distribution; the lower the variance, the better the estimator's performance. On this basis, it is reasonable and appropriate to say that the higher an IVIFN's uv-accuracy degree, the better the IVIFN.

    In 2007, a technique [20] was developed for comparing and rating two IVIFNs based on the score function and the accuracy function, which was motivated by the aforementioned study. We can now compare and rate two IVIFNs in the same way using the uv-score function and uv -accuracy function, as shown below.

    Definition 3. Let ξ1=([a1,b1],[c1,d1]) and ξ2=([a2,b2],[c2,d2]) be the two IVIFNs, Θ(μ,υ)(ξ1) and Θ(μ,υ)(ξ2) be the uv-scores of the IVIFNs ξ1 and ξ2 respectively, also Φ(μ,υ)(ξ1) and Φ(μ,υ)(ξ2) be the uv-accuracy degrees of the IVIFNs ξ1 and ξ2 respectively. Then

    If Θ(μ,υ)(ξ1)<Θ(μ,υ)(ξ2), then ξ1<ξ2.

    If Θ(μ,υ)(ξ1)=Θ(μ,υ)(ξ2), then

    i) If Φ(μ,υ)(ξ1)<Φ(μ,υ)(ξ2), then ξ1<ξ2.

    ii) If Φ(μ,υ)(ξ1)=Φ(μ,υ)(ξ2), then ξ1=ξ2.

    In this section, we have explored the notions and examples of IVIF- score left (right) ideals and IVIF-score (0, 2)-ideals in an ordered AG-groupoid.

    Definition 4. Let Θ(μ,υ) be a uv-score function of an ordered AG-groupoid S and x,yS. Then Θ(μ,υ) is called an IVIF -score left (right) ideal of S, if the following conditions are satisfied.

    i) Θ(μ,υ)(xy)Θ(μ,υ)(y) (Θ(μ,υ)(xy)Θ(μ,υ)(x));

    ii) xyΘ(μ,υ)(x)Θ(μ,υ)(y).

    Example 1. Let us consider the following collection of IVIFS I={ξj=(μξj,υξj); j=1,2,3,4,5,6} on an ordered AG-groupoid S1={a,b,c,d,e,f} with the binary operation and order defined as follows (see Tables 1 and 2):

    ≤={(a,a),(b,b),(c,c),(d,d),(e,e),(f,f),(b,a)}
    Table 1.  Composition of AG-groupoid S1.
    a b c d e f
    a a a a a a a
    b a b b b b b
    c a b f f d f
    d a b f f c f
    e a b c d e f
    f a b f f f f

     | Show Table
    DownLoad: CSV
    Table 2.  Ranking of the elements of S1.
    x ξj μξj υξj uv-score uv-accuracy Rank
    a ξ1 [0.5,0.8] [0,0.1] 0.8 ... 2nd
    b ξ2 [0.6,0.8] [0,0.1] 0.825 ... 1st
    c ξ3 [0.3,0.5] [0,0.5] 0.575 0.65 4th
    d ξ4 [0.2,0.6] [0.1,0.4] 0.575 0.65 4th
    e ξ5 [0.2,0.5] [0.1,0.5] 0.525 ... 5th
    f ξ6 [0.1,0.8] [0,0.1] 0.7 ... 3rd

     | Show Table
    DownLoad: CSV

    It is now a trivial matter to check that

    Θ(μ,υ)={0.8 if x=a0.825 if x=b0.575 if x=c,d0.525 if x=e0.7 if x=f

    is the IVIF-score left and IVIF-score right ideal of S.

    The following graph Figure 1 demonstrates the ranking comparison of each xS while generating Θ(μ,υ).

    Figure 1.  Ranking comparison of elements of AG-groupoid S.

    Remark 1. Every IVIF-score right ideal of an ordered AG-groupoid S is an IVIF-score left ideal of S but the converse is not true in general which can be seen from the following example.

    Example 2. Consider the following collection of IVIFS I={ξj=(μξj,υξj); j=1,2,3,4,5} on an ordered AG-groupoid S2={a,b,c,d,,e} with the binary operation and order defined as follows (see Tables 3 and 4):

    ≤={(a,a),(b,b),(c,c),(d,d),(e,e),(a,b),(a,e)}
    Table 3.  Composition of AG-groupoid S2.
    a b c d e
    a a a a a a
    b a e e c e
    c a e e b e
    d a b c d e
    e a e e e e

     | Show Table
    DownLoad: CSV
    Table 4.  Ranking of the elements of S2.
    x ξj μξj υξj uv-score uv-accuracy Rank
    a ξ1 [0.5,0.8] [0,0.2] 0.775 0.75 2nd
    b ξ2 [0.3,0.7] [0.1,0.3] 0.65 0.7 3rd
    c ξ3 [0.4,0.6] [0,0.4] 0.65 0.7 3rd
    d ξ4 [0.2,0.3] [0,0.3] 0.55 ... 4th
    e ξ5 [0.6,0.7] [0.1,0.3] 0.775 0.85 1st

     | Show Table
    DownLoad: CSV

    One can see that

    Θ(μ,υ)={0.775 if x=a,e0.65 if x=b,c0.55 if x=d

    is an IVIF-score left ideal of S. Note that Θ(μ,υ)(bd)Θ(μ,υ)(b) implying that Θ(μ,υ) is not an IVIF-score right ideal of S.

    Following is a graphical representation of the ranking comparison of each xS during the construction of Θ(μ,υ) (see Figure 2).

    Figure 2.  Ranking comparison of elements of AG-groupoid S.

    The aim of this section is to investigate the concept of a uv-score (uv-accuracy) function in order to develop the notions of IVIF-score left (right) ideals and IVIF-score (0,2)-ideals in an ordered AG-groupoid. We also study some important characterization problems in an ordered AG-groupoid using these newly developed IVIF-score ideals. In this regard, we intend to respond to a question about the relationship between an IVIF-idempotent subsets of an ordered AG-groupoid S and its IVIF-score (0,2)-ideals, especially when an IVIF-idempotent subset of S will be an IVIF-score (0,2)-ideal in terms of an IVIF-score right ideal and an IVIF-score left ideal of S. In addition, we also use IVIF-score left (right) ideals to characterize an intra-regular ordered AG-groupoid (AG-group) which is a semilattice of left simple AG-groupoids.

    As an extension of the findings in [13,23], it should be noted that the results of this section may be followed easily for a case of fuzzy sets in an AG-groupoid without order.

    If S is an AG-groupoid with product :S×SS, then

    abc=(ab)c and abc=a(bc)

    both will denote the product

    (ab)c and a(bc).

    Similarly

    abcd=(ab)(cd)

    will denote the product

    (ab)(cd).

    Definition 5. For AS, we define

    (A]={tS|ta,forsomeaA}.

    For A={a}, we usually written as (a].

    The following statements are true for an ordered AG-groupoid S [27], and will be used frequently without mention in the sequel.

    i) A(A] AS;

    ii) if ABS, then (A](B];

    iii) (A](B](AB] A,BS;

    iv) (A]=((A]] AS;

    vi) ((A](B]]=(AB] A,BS;

    vii) A=(A] if A is any type of ideal.

    Definition 6. A non-empty subset A of an ordered AG-groupoid S is called a left (resp. right) ideal of S, if

    i) SAA (resp. ASA);

    ii) if aA and bS such that ba, then bA, that is if (A]=A.

    Equivalently, if (SA]A (resp. (AS]A).

    Definition 7. Let S be an ordered AG-groupoid. Then S is left simple if it does not properly contain any left ideal.

    Definition 8. An AG-subgroupoid F of an an ordered AG-groupoid S is called a filter of S if

    a) x,yS, xyFxF and yF.

    b) xF, SzxzF.

    We denote by N(x) the filter of S generated by s (sS). Let N be the equivalence relation on S defined by

    N={(x,y):N(x)=N(y)}.

    Definition 9. Let S be an ordered AG-groupoid. An equivalence relation ρ on S is called congruence if

    (a,b)ρ(ac,bc)ρ,(ca,cb)ρ for all cS.

    A congruence ρ on S is called semilattice congruence if

    (a2,a)ρ,(ab,ba)ρ for all a,bS.

    Let ρ is a semilattice congruence on an ordered AG-groupoid S. Then (s)ρ is an AG-subgroupoid of S for every sS. Indeed, (s)ρS.

    Let x,yS. Since xρs and yρs, we have xyρs2. As s2ρs, we have xyρs, that is, xy(s)ρ.

    Let ρ is a congruence on an ordered AG-groupoid S. Then the multiplication "" on the set

    S/ρ={(s)ρ:sS}

    is defined by

    (a)ρ(b)ρ=(ab)ρ for all a,bS,

    and (S/ρ,) is an AG-subgroupoid.

    Definition 10. Let S be an ordered AG-groupoid. Then S is a semilattice of left simple AG-groupoids if and only if there exists a semilattice Y and a family

    {Sl:lY}

    of left simple AG-subgroupoids of S such that

    a) SkSl= for every k,lY, kl.

    b) S=lYSl.

    c) SkSlSkl for every k,lY.

    Equivalently, S is a semilattice of left simple AG-groupoids if there exists a semilattice congruence ρ on S such that the ρ -class (x)ρ of S containing x is a simple AG-subgroupoid of S for every xS.

    In [17], T. Saito has shown that a semigroup S is a semilattice of left simple semigroups if and only if the set of left ideals of S is a semilattice under the multiplication of subsets, which is similar to say that S is left regular and every left ideal of S is two-sided. In addition, S. Lajos [14] has shown that a semigroup S is left regular and its left ideals are two-sided if and only if P1P2=P1P2 for any two left ideals P1,P2 of S. We are now considering these results in the context of an ordered AG-groupoid, which will provide more comprehensive and generalized findings.

    Definition 11. [25] An ordered AG-groupoid S is intra-regular if for each aS, there exists x,yS, such that axa2y. Equivalently, if a(Sa2S] for every aS or A(SA2S] for every AS.

    Theorem 1. For an ordered AG-groupoid S with left identity, the following conditions are equivalent:

    i) S is a semilattice of left simple AG-groupoids;

    ii) S is intra-regular and every left ideal of S is two-sided;

    iii) the set of all left ideals of S is a semilattice under the multiplication of subsets;

    iv) if P1 and P2 are left ideals of S, then

    P1P2=(P1P2];

    v) if P1, P2 and P are left ideals of S, then

    (P1P2]=(P2P1] and P=(P2].

    Proof. i)v): Let P1,P2 be the left ideals of S. Then by given assumption,

    P1=Sk and P2=Sl for some k,lY.

    Let z(P1P2]. Then

    zab for some aP1,bP2.

    As

    abP1P2=SkSlSm and baP2P1=SlSkSm

    for some mY, therefore ab,baSm.

    Since Sm is left simple, then it is easy to see that, there exists xSm such that abxba.

    Thus we have

    zabxba=exba=abxe=(xeb)aSP2P1P2P1,

    which implies z(P1P2].

    Similarly we can show that

    (P2P1](P1P2].

    Hence

    (P1P2]=(P2P1],

    for any left ideals P1 and P2 of S.

    Now let P be left ideal of S and let zP=Sk for some kY. Since zP and Sk is an AG-subgroupoids of S, we have z2P.

    Since z,z2Sk, then it is easy to see that, there exists xSk such that

    zxz2=xzz=zxzPSPP2,

    we have z(P2]. On the other hand, we have

    (P2](SP]P,

    implies

    P=(P2].

    v)iv): If P1,P2 are the left ideals of S, then

    (P1P2](SP2](P2]=P2 and (P2P1](SP1](P1]=P1.

    Therefore by given condition,

    (P1P2]=(P2P1].

    Thus we have

    (P1P2]P1P2.

    Since (P1P2], we have P1P2. Therefore P1P2 is a left ideal of S, and by given condition,

    P1P2=((P1P2)(P1P2)](P1P2].

    Thus we get

    P1P2=(P1P2].

    iv)ii): Let aS. Then, (Sa] is a left ideal of S, and clearly a(Sa]. By using given assumption,

    a(Sa](Sa]=((Sa](Sa]]((SaSa]]=(SaSa]=(SSaa]=(SSa2]=(a2SS]=(Sa2S],

    which implies that axa2y for some x,yS.

    Now let P be a left ideal of S. Then

    (PS]P.

    Indeed, if aP, sS, then

    as(xa2y)s=sya2x=a2(syx)=(syx)aaSP(SP]P.

    ii)i): Let S be intra-regular. Then by using given condition, it is easy to show that (s)N is a left simple AG-subgroupoid of S for every sS.

    Hence S is a semilattice of left simple AG-groupoids.

    i)iii): Let ρ be a semilattice congruence on S such that (s)ρ is a left simple AG-subgroupoid of S for every sS and let P1, P2 and P be left ideals of S. We endow S with equality relation

    ≤={(a,b):a=b}.

    Then S is an ordered AG-groupoid, ρ is a semilattice congruence on S and (s)ρ is a left simple AG-subgroupoid of S for every sS.

    By i)v), we have

    (P1P2]=(P2P1] and P=(P2],

    implies

    (P1P2]=P1P2.

    Indeed, if a(P1P2], then abc for some bP1 and cP2.

    Since (a,bc)∈≤, we have a=bc, which implies aP1P2.

    Similarly, we have

    (P2P1]=P2P1 and P=(P2],

    which is what we set out to prove.

    iii)iv): Straightforward.

    Definition 12. The product of any uv-score functions Ω(μ,υ) and Υ(μ,υ) of S is defined by

    (Ω(μ,υ)Υ(μ,υ))(x)={(y,z)Ax{Ω(μ,υ)(y)Υ(μ,υ)(z)} if Ax0            if Ax=,,

    where

    Ax={(y,z)S×Sxyz}

    for any xS.

    The proof of the following four lemmas are same as in [25,26].

    Lemma 1. Let S be an ordered AG-groupoid. For A,BS, the following holds.

    i) CACB=CAB.

    ii) CACB=C(AB].

    Lemma 2. If Ω(μ,υ) is any uv-score function of an ordered AG-groupoid S, then Ω(μ,υ) is an IVIF-score right (left) ideal of S if and only if

    Ω(μ,υ)SΩ(μ,υ)(SΩ(μ,υ)Ω(μ,υ)).

    Lemma 3. Let S be an ordered AG-groupoid and AS. Then A is a right (left) ideal of S if and only if CA is an IVIF-score right (left) ideal of S.

    Lemma 4. If S is an intra-rgular ordered AG-groupoid with left identity and Ω(μ,υ) is an IVIF-score left (right) ideal of S, then

    Ω(μ,υ)=Ω2(μ,υ)=SΩ(μ,υ)=Ω(μ,υ)S.

    Theorem 2. Let S be an ordered AG-groupoid. Then every left ideal of S is two-sided if and only if every IVIF-score left ideal of S is two-sided.

    Proof. It is simple.

    Theorem 3. For an ordered AG-groupoid S with left identity, the following conditions are equivalent:

    i) S is a semilattice of left simple AG-groupoids;

    ii) S is intra-regular and every IVIF-score left ideal of S is an IVIF-score ideal;

    iii) for every IVIF-score left ideal Θ(μ,υ) and Ψ(μ,υ) of S;

    Θ(μ,υ)Ψ(μ,υ)=Θ(μ,υ)Ψ(μ,υ);

    iv) the set of all IVIF-score left ideals of S forms a semilattice under the composition of IVIFSs;

    v) the set of all left ideals of S forms a semilattice under the composition of subsets.

    Proof. i)ii): It can be followed from Theorems 1 and 2.

    ii)iii): Let Θ(μ,υ) and Ψ(μ,υ) be any IVIF-score left ideals of S with left identity e, and aS. Since S is intra-regular, there exist some x,yS for which

    a=xa2ey=yea2x=a2(yex)=(aye)(ax)=(xa)(yea).

    Consequently

    (Θ(μ,υ)Ψ(μ,υ))(a)=(xa,yea)Aa{Θ(μ,υ)(xa)Ψ(μ,υ)(yea)}Θ(μ,υ)(a)Ψ(μ,υ)(a)=(Θ(μ,υ)Ψ(μ,υ))(a).

    Thus

    Θ(μ,υ)Ψ(μ,υ)Θ(μ,υ)Ψ(μ,υ).

    Similarly

    Θ(μ,υ)Ψ(μ,υ)Θ(μ,υ)Ψ(μ,υ).

    As a result,

    Θ(μ,υ)Ψ(μ,υ)=Θ(μ,υ)Ψ(μ,υ)

    for every IVIF-score left ideal Θ(μ,υ) and Ψ(μ,υ) of S.

    iii)iv): It is simple.

    iv)v): Let P1 and P2 be any left ideals of S, then by given assumption, it is easy to see that P1P2 (P2P1) is a left ideal of S, and thus

    P1P2=(P1P2](P2P1=(P2P1]).

    Let x(P1P2]. Using Lemmas 1 and 3, and the given assumption, we have

    C[P1,P2](x)=(CP1CP2)(x)=(CP2CP1)(x)=C[P2,P1](x)=1.

    This indicates that

    x(P2P1]=P2P1.

    Thus

    P1P2P2P1.

    Similarly, we can show that

    P2P1P1P2.

    Therefore

    P1P2=P2P1.

    Now to prove that every left ideal P1 of S is idempotent, let xP1. Then by the given assumption, we have

    C(P21](x)=(CP1CP1)(x)=CP1(x)=1

    which shows that

    P1P21.

    Hence

    P1=P21

    for every left ideal P1 of S.

    v)i): Let aS. Since (Sa] is the left ideal of S and a(Sa], so by given assumption

    a(Sa]=(Sa](Sa](SaSa]=(SSa2]=(a2SS]=(Sa2S],

    which shows that axa2y for some x,yS. Hence S is intra-regular. Using Theorem 1, S is a semilattice of left simple AG-groupoids.

    Theorem 4. Let S be an ordered AG-group. Then the following conditions are equivalent:

    i) S is a semilattice of left simple AG-groupoids;

    ii) S is intra-regular and every IVIF-score left ideal of S is an IVIF-score ideal;

    iii) for every IVIF-score left ideal Θ(μ,υ) and Ψ(μ,υ) of S;

    Θ(μ,υ)Ψ(μ,υ)=Θ(μ,υ)Ψ(μ,υ);

    iv) the set of all IVIF-score left ideals of S forms a semilattice under the composition of IVIFSs;

    v) the set of all left ideals of S forms a semilattice under the composition of subsets;

    vi) let R and P be any left and right ideals of S respectively.

    RP2=(RP],

    Proof. (i)(ii)(iii)(iv)(v) can be followed from Theorem 3.

    (v)(vi): Let R and P be any left and right ideals of S respectively, then it is easy to see that

    (RP]RP2.

    Let aRP2, then

    aR and aP2.

    Let e be the left identity of S, then for aS there exists aS such that

    aa=aa=e.

    Therefore

    aeaaaea

    implies

    a(RSSP2]=((RS)(PPS)]=((RS)(SPP)](RSP](RP].

    (vi)(i): Since (Sa2] and (Sa] are the right and left ideals of S respectively such that

    a2(Sa2]

    and

    a2=aa(Sa](Sa]=(Sa]2,

    therefore by using given assumption, we have

    a2(Sa2](Sa]2=((Sa2](Sa]2]=((Sa2)(Sa)2]=((Sa2)(aS)(aS)]=(Sa2a2S]=((aa)(Sa2S)]=((Sa2S)aa]=((aSSa2)a]=((Sa2Sa)a]((Sa2S)a],

    which implies

    a2(xa2y)a

    for some x,yS. Thus

    a2(xa2y)a(aa)a((axa)a)a(aa)a(aa)(xa2y)axa2y.

    Hence S is intra-regular. Using Theorem 1, S is a semilattice of left simple AG-groupoids.

    Remark 2. Assume S is an ordered AG-groupoid with left identity and aS. The smallest left ideal of S containing a is thus Pa=(Sa], and the smallest right ideal of S containing a2 is Ra2=(Sa2].

    Theorem 5. Let S be an ordered AG-groupoid with left identity. Then the following conditions are equivalent:

    i) S is intra-regular.

    ii) Let Pa be the smallest left ideal of S containing a, then:

    Pa=P2a.

    iii) Let P1 and P2 be any left ideals of S, then:

    P1P2=(P2P1].

    iv) Let Ω(μ,υ) and Υ(μ,υ) are any IVIF-score left ideals of S, then:

    Ω(μ,υ)Υ(μ,υ)=Υ(μ,υ)Ω(μ,υ),

    Proof. i)iv): Let Ω(μ,υ) and Υ(μ,υ) be the IVIF-score left ideals of an intra-regular S with left identity e for all aS. Now, for aS, there exists some x,yS such that

    a(exaa)y=(eaxa)y=(yxa)(ea).

    Thus

    (Υ(μ,υ)Ω(μ,υ))(a)=(yxa,ea)Aa{Υ(μ,υ)(yxa)Ω(μ,υ)(ea)}Υ(μ,υ)(a)Ω(μ,υ)(a).

    This suggests that

    Υ(μ,υ)Ω(μ,υ)Ω(μ,υ)Υ(μ,υ).

    It is clear that

    Υ(μ,υ)Ω(μ,υ)Ω(μ,υ)Υ(μ,υ)

    by applying Lemmas 2 and 4. As a result,

    Ω(μ,υ)Υ(μ,υ)=Υ(μ,υ)Ω(μ,υ).

    iv)iii): Let P1 and P2 be any left ideals of S. Then, according to Lemma 3, CP1 and CP2 are the IVIF-score left ideals of S. If we take xP1P2 and apply Lemma 1, we get

    1=CP1P2(x)=(CP1CP2)(x)(CP2CP1)(x)=C[P2,P1](x).

    This implies

    a(P2P1]

    and, as a result,

    P1P2(P2P1].

    It is obvious

    (P2P1]P1P2.

    Hence

    P1P2=(P2P1].

    iii)ii): It is obvious.

    ii)i): Since (Sa] is the smallest left ideal of S that contains a. Using Theorem 3 v)i), S is intra-regular.

    Theorem 6. Assume S is an ordered AG-group. Then the following conditions are equivalent:

    i) S is intra-regular;

    ii) Let Ra2 is the smallest right ideal of S containing a2, then;

    Ra2=R2a2.

    iii) Let R1 and R2 be any right ideals of S, then;

    R1R2=(R2R1].

    iv) Let Ω(μ,υ) and Υ(μ,υ) be any IVIF-score right ideals of S, then;

    Ω(μ,υ)Υ(μ,υ)=Υ(μ,υ)Ω(μ,υ).

    Proof. i)iv): Let Ω(μ,υ) and Υ(μ,υ) be both IVIF-score right ideals of S with left identity e and V(a) for all aS. Now for aS, there exists some x,yS such that

    a(exaa)y=(aaxe)y=(axae)y=(yae)(ax)=(aye)(ax).

    Thus

    (Υ(μ,υ)Ω(μ,υ))(a)=(aye,ax)Aa{Υ(μ,υ)(aye)Ω(μ,υ)(ax)}Υ(μ,υ)(a)Ω(μ,υ)(a).

    Thus by using Lemmas 2 and 4, we get

    Ω(μ,υ)Υ(μ,υ)=Υ(μ,υ)Ω(μ,υ).

    iv)iii): Let R1 and R2 be any right ideals of S. Then by Lemma 3, CR1 and CR2 are IVIF-score right ideals of S. Let xR1R2. Then by using Lemma 1, we have

    1=CR1R2(x)=(CR1CR2)(x)(CR2CR1)(x)=C[R2,R1](x).

    which implies that

    a(R2R1] 

    and therefore

    R1R2(R2R1].

    It is easy to see that

    (R2R1]R1R2

    and therefore

    R1R2=(R2R1].

    iii)ii): It is obvious.

    ii)i): Since (Sa2] is the smallest right ideal of S containing a2. Therefore

    a2(Sa2]=((Sa2](Sa2]]=((Sa2)(Sa)2].

    Using Theorem 4 vi)i), S is intra-regular.

    Definition 13. A non-empty subset A of an ordered AG-groupoid S is called a (0,2) -ideal of S, if

    i) SA2A;

    ii) if aA and bS such that ba, then bA, that is if (A]=A.

    Equivalently, if (SA2]A.

    Definition 14. Let Θ(μ,υ) be a uv-score function of an ordered AG-groupoid S and x,y,zS. Then Θ(μ,υ) is called an IVIF-score (0,2)-ideal of S, if the following conditions are satisfied.

    i) Θ(μ,υ)(xyz)Θ(μ,υ)(y)Θ(μ,υ)(z);

    ii) xyΘ(μ,υ)(x)Θ(μ,υ)(y).

    The next two lemmas are straightforward, hence their proofs are omitted.

    Lemma 5. If Θ is any uv-score function of an ordered AG-groupoid S, then Θ is an IVIF-score (0,2)-ideal of S if and only if SΘ2Θ.

    Theorem 7. Let Θ be an IVIF-idempotent subset of an ordered AG-groupoid S with left identity. Then the following conditions are equivalent:

    (i) Let Ω(μ,υ) be an IVIF-score right ideal and Υ(μ,υ) be an IVIF-score left ideal of S, then

    Θ=Ω(μ,υ)Υ(μ,υ),

    (ii) Θ is an IVIF-score (0,2)-ideal of S.

    Proof. (i)(ii): We can obtain the following by using Lemma 2.

    SΘ2=(SS)(ΘΘ)=(SΘ)(SΘ)=(S(Ω(μ,υ)Υ(μ,υ)))(S(Ω(μ,υ)Υ(μ,υ)))=(Ω(μ,υ)(SΥ(μ,υ)))((SS)(Ω(μ,υ)Υ(μ,υ)))(Ω(μ,υ)S)((Υ(μ,υ)Ω(μ,υ))(SS))Ω(μ,υ)((SΩ(μ,υ))Υ(μ,υ))Ω(μ,υ)(SΥ(μ,υ))Ω(μ,υ)Υ(μ,υ)=Θ.

    As a result of Lemma 5, Θ is an IVIF-score (0,2)-ideal of S.

    (ii)(i): Setting Υ(μ,υ)=SΘ and Ω(μ,υ)=SΘ2, then using Lemma 5, we obtain

    Ω(μ,υ)Υ(μ,υ)=(SΘ2)(SΘ)=(ΘS)(Θ2S)=(ΘΘ)((ΘS)S)=(S(ΘS))ΘSΘ2Θ=ΘΘ=(ΘΘ2)(ΘΘ)(SΘ2)(SΘ)=Ω(μ,υ)Υ(μ,υ).

    This is what we set out to show.

    Many researchers have studied several real world problems in an interval-valued intuitionistic fuzzy environment by developing various decision-making techniques. For example, Yue and Jia [29] presented a soft computing model for group decision problems. Chen et al. [5] established a method for dealing with group decision problems in the context of IVIFSs. Further to that, Cai and Han [4] applied IVIFSs to a data mining-based decision-making problem by providing an example of selecting an ERP system, which validated the developed approach. Moreover, Xu and Shen [19] suggested a new outranking choice method and illustrated it with a practical supplier selection example.

    We now devise a technique to see which alternative is a good choice for further analysis on the basis of IVIF-score (0, 2)-ideals. The steps are broken down as follows:

    i) Take the collection of alternatives X={xi:i=1,2,3...,n}.

    ii) Construct an ordered AG-groupoid on collection X under a combination rule "" and order "".

    iii) Define an IVIFS on X that creates an IVIF-score (0,2)-ideal of (X,,).

    iv) Rank all the IVIFNs by using uv-score function (use uv -accuracy function if uv-scores are equal).

    To take a decision that will rank the available alternatives according to the requirements, we utilize an IVIF-score (0,2)-ideal of an ordered AG-groupoid.

    Selection of warehouse distributors

    A warehouse is made up of a variety of components, including shelves and containers for storage, air conditioning systems for temperature-sensitive products, storage management software and inventory control software to keep the two in sync, picking equipment to transport goods from one location to another, and so on. While, a distribution centre is distinct from a warehouse in that it includes components for picking, packaging, and shipping, as well as storage. However, virtually all warehouses nowadays are built to include distribution centre functionality. As a result of these overlapping goals, warehousing has come to play a significant part in the supply management process. Planning, information collecting, product procurement, inventory management, transportation, delivery, and return of items are all part of the e-commerce supply management process. A warehouse can help you handle most of these procedures smoothly and optimize your business for optimum returns. Warehousing is a critical component of the supply chain operation. Even though this is not a customer-facing activity and your consumers may never be aware of it, their purchasing experience will be impeded without it.

    Shipping a truckload of products from multiple warehouses to different marketplaces varies due to different modes of transportation and distances involved. An international corporation has five warehouses, designated by x1, x2, x3, x4 and x5, with locations as follows:

    x1:City Centre: It is located in the city centre, which is the economic, social, cultural, political, and geological soul of a metropolis.

    x2:Downtown: It is situated in downtown, which is the busiest section of a city, with the most merchants, cafés, skyscrapers, and passengers.

    x3:Suburb: It is in a suburb where citizens reside away from the middle of a major metropolitan area.

    x4:Slum: It is located in a slum, which is a tightly packed metropolitan residential area made up of low-quality dwelling units.

    x5:Midtown: It is the part of a city near the centre.

    The rankings of the IVIFNs associated with each warehouse in the collection X={x1,x2,x3,x4,x5} will decide the rankings.

    Let consider the collection of warehouses X={x1,x2,x3,x4,x5}. Let the combination rule be the time taken to pick an item form warehouse and bringing it to the selling point, e.g. time taken to picking first item from warehouse x1 then second item from x4 is same as time taken to pick a single item from x5, similarly time taken to pick two items from x1 (x1 to x1) is same as time required for picking a single item from x4. All the possible combinations are listed in table below (see Table 5):

    ≤={(x3,x3),(x2,x2),(x5,x5),(x4,x4),(x1,x1),(x2,x5),(x2,x4),(x2,x1)}
    Table 5.  Composition of warehouses.
    x3 x2 x5 x4 x1
    x3 x3 x3 x3 x3 x3
    x2 x3 x2 x2 x2 x2
    x5 x3 x2 x4 x1 x5
    x4 x3 x2 x5 x4 x1
    x1 x3 x2 x1 x5 x4

     | Show Table
    DownLoad: CSV

    It is easy to see that (X,,) is an ordered AG-groupoid.

    Consider the following collection of IVIFS I={ξj=(μξj,υξj); j=1,2,3,4,5} on X as follows (see Table 6):

    Table 6.  Ranking of warehouses along with uv-scores and uv-accuracies.
    x ξj μξj υξj uv-score uv-accuracy Rank
    x3 ξ1 [0.7,0.8] [0.1,0.2] 0.8 0.9 1st
    x2 ξ2 [0.6,0.7] [0,0.1] 0.8 0.7 2nd
    x5 ξ3 [0.3,0.8] [0.1,0.2] 0.7 0.7 3rd
    x4 ξ4 [0.4,0.7] [0,0.3] 0.7 0.7 3rd
    x1 ξ5 [0.5,0.6] [0,0.3] 0.7 0.7 3rd

     | Show Table
    DownLoad: CSV

    The above table shows that Θ(μ,υ)(I) is an IVIF-score (0,2)-ideal of (X,,).

    Sort all of the alternatives according to their respective uv-scores. If two uv-scores (Definition 1) are equal, the uv-accuracy function (Definition 2) can be used to sort the alternatives (see Figure 3).

    Figure 3.  uv-score uv-accuracy and ranking comparison of elements of ordered AG-groupoid.

    The preferences of the alternatives based on an IVIF-score (0,2)-ideal on (X,,) can be seen from the following Table 7:

    Table 7.  Preference information for the warehouses.
    Ranking 1st 2nd 3rd 4th 5th
    Warehouse x3 x2 x5 x4 x1

     | Show Table
    DownLoad: CSV

    We developed some novel characterization results for an intra-regular ordered AG-groupoid. We used the notions of uv-score and uv -accuracy functions under interval-valued intuitionistic fuzzy environment to provide a method that satisfies a decision maker while making the decision by incorporating the concept of IVIF-score (0,2)-ideals in an ordered AG-groupoid. The results of this paper are developed for ordered AG-groupoids but they also hold for un-ordered AG-groupoids, so these results could be considered as extended results. They also generalize the results already developed on the structure of AG-groupoids and ordered groupoids by considering various versions of fuzzy sets. The work carried out in this paper is in the most generalized form and is capable of extending the existing theory of AG-groupoids

    Based on our proposed concept, more applications for future research work can be found in a variety of directions. Among them are the following:

    ● Using the concepts of a Pythagorean fuzzy set (PFS) [21] and interval valued picture hesitant fuzzy set (IVPHF) [7], one can investigate an ordered AG-groupoid in detail.

    ● To characterize an ordered AG-groupoid using the notion of a q-rung orthopair fuzzy set (Cq-ROFS) [22].

    ● To investigate the concept of a linear Diophantine fuzzy set (LDFS) [16], their algebraic structures [9] and complex linear Diophantine fuzzy set (CLDFS) [8] in the framework of an ordered AG-groupoid.

    The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University, KSA for funding this work through General Research Project under grant number R.G.P.1/277/43.

    The authors declare no conflict of interest.



    [1] J. Cheng, X. Jiang, H. Zhou, J. Dong, Research progress and challenges of photoelectric intelligent computing, China Laser, 49 (2022), 327–339.
    [2] L. Chua, Memristor-the missing circuit element, IEEE Trans. Circuit Theory, 18 (1971), 507–519. https://doi.org/10.1109/TCT.1971.1083337 doi: 10.1109/TCT.1971.1083337
    [3] D. B. Strukov, G. S. Snider, D. R. Stewart, R. S. Williams, The missing memristor found, Nature, 453 (2008), 80–83.
    [4] G. Zhang, Z. Zeng, D. Ning, Novel results on synchronization for a class of switched inertial neural networks with distributed delays, Inf. Sci., 511 (2020), 114–126. https://doi.org/10.1016/j.ins.2019.09.048 doi: 10.1016/j.ins.2019.09.048
    [5] G. Zhang, J. Cao, A. Kashkynbayev, Further results on fixed/preassigned-time projective lag synchronization control of hybrid inertial neural networks with time delays, J. Franklin Inst., 360 (2023), 9950–9973. https://doi.org/10.1016/j.jfranklin.2023.07.040 doi: 10.1016/j.jfranklin.2023.07.040
    [6] G. Milano, M. Agliuzza, N. de Leo, C. Ricciardi, Speech recognition through physical reservoir computing with neuromorphic nanowire networks, 2022 International Joint Conference on Neural Networks (IJCNN), 2022. https://doi.org/10.1109/IJCNN55064.2022.9892078
    [7] J. X. Zhang, T. Yang, T. Chai, Neural network control of underactuated surface vehicles with prescribed trajectory tracking performance, IEEE Trans. Neural Networks Learn. Syst., 2022. https://doi.org/10.1109/TNNLS.2022.3223666
    [8] G. Qin, A. Lin, J. Cheng, M. Hu, I. Katib, Protocol-based fault detection filtering for memristive neural networks with dynamic quantization, J. Franklin Inst., 360 (2023), 13395–13413. https://doi.org/10.1016/j.jfranklin.2023.10.019 doi: 10.1016/j.jfranklin.2023.10.019
    [9] J. X. Zhang, T. Chai, Proportional-integral funnel control of unknown lower-triangular nonlinear systems, IEEE Trans. Autom. Control, 2023. https://doi.org/10.1109/TAC.2023.3330900
    [10] C. Xu, W. Ou, Y. Pang, Q. Cui, M. U. Rahman, M. Farman, et al., Hopf bifurcation control of a fractional-order delayed turbidostat model via a novel extended hybrid controller, MATCH Commun. Math. Comput. Chem., 91 (2024), 367–413. https://doi.org/10.46793/match.91-2.367X doi: 10.46793/match.91-2.367X
    [11] C. Xu, Z. Liu, P. Li, J. Yan, L. Yao, Bifurcation mechanism for fractional-order three-triangle multi-delayed neural networks, Neural Process. Lett., 55 (2023), 6125–6151. https://doi.org/10.1007/s11063-022-11130-y doi: 10.1007/s11063-022-11130-y
    [12] C. Xu, Q. Cui, Z. Liu, Y. Pan, X. Cui, W. Ou, et al., Extended hybrid controller design of bifurcation in a delayed chemostat model, MATCH Commun. Math. Comput. Chem., 90 (2023), 609–648. https://doi.org/10.46793/match.90-3.609X doi: 10.46793/match.90-3.609X
    [13] H. Guo, J. Han, G. Zhang, Hopf bifurcation and control for the bioeconomic predator-prey model with square root functional response and nonlinear prey harvesting, Mathematics, 11 (2023), 4958. https://doi.org/10.3390/math11244958 doi: 10.3390/math11244958
    [14] M. J. Mirzaei, E. Aslmostafa, M. Asadollahi, M. A. Badamchizadeh, Robust adaptive finite-time stabilization control for a class of nonlinear switched systems based on finite-time disturbance observer, J. Franklin Inst., 358 (2021), 3332–3352. https://doi.org/10.1016/j.jfranklin.2021.02.010 doi: 10.1016/j.jfranklin.2021.02.010
    [15] N. Xu, Y. Chen, A. Xue, G. Zong, Finite-time stabilization of continuous-time switched positive delayed systems, J. Franklin Inst., 359 (2022), 255–271. https://doi.org/10.1016/j.jfranklin.2021.04.022 doi: 10.1016/j.jfranklin.2021.04.022
    [16] S. Kanakalakshmi, R. Sakthivel, S. Karthick, A. Leelamani, A. Parivallal, Finite-time decentralized event-triggering non-fragile control for fuzzy neural networks with cyber-attack and energy constraints, Eur. J. Control, 57 (2021), 135–146, https://doi.org/10.1016/j.ejcon.2020.05.001 doi: 10.1016/j.ejcon.2020.05.001
    [17] M. M. Silva, X. Wang, F. E. Alsaadi, Y. Shen, Fixed-time synchronization and parameter identification of coupled neural networks, Neural Networks, 77 (2016), 40–47.
    [18] X. Hu, L. Wang, C. K. Zhang, X. Wan, Y. He, Fixed-time stabilization of discontinuous spatiotemporal neural networks with time-varying coefficients via aperiodically switching control, Sci. China Inf. Sci., 66 (2023), 152204. https://doi.org/10.1007/s11432-022-3633-9 doi: 10.1007/s11432-022-3633-9
    [19] Y. Bao, Y. Zhang, B. Zhang, Resilient fixed-time stabilization of switched neural networks subjected to impulsive deception attacks, Neural Networks, 163 (2023), 312–326, https://doi.org/10.1016/j.neunet.2023.04.003 doi: 10.1016/j.neunet.2023.04.003
    [20] G. Zhang, Novel results on event-triggered-based fixed-time synchronization and stabilization of discontinuous neural networks with distributed delays, Franklin Open, 4 (2023), 100032. https://doi.org/10.1016/j.fraope.2023.100032 doi: 10.1016/j.fraope.2023.100032
    [21] Y. Zhang, F. Kong, L. Wang, C. Hu, Fixed-time stabilization of generalized leakage-delayed neural networks with discontinuous disturbances via mixed-delay-product-type LKF, Eur. J. Control, 71 (2023), 100793. https://doi.org/10.1016/j.ejcon.2023.100793 doi: 10.1016/j.ejcon.2023.100793
    [22] F. Tan, L. Zhou, J. Lu, H. Zhang, Fixed-time synchronization in multilayer networks with delay cohen–grossberg neural subnets via adaptive quantitative control, Asian J. Control, 26 (2024), 446–455. https://doi.org/10.1002/asjc.3217 doi: 10.1002/asjc.3217
    [23] Q. Gan, L. Li, J. Yang, Y. Qin, M. Meng, Improved results on fixed-/preassigned-time synchronization for memristive complex-valued neural networks, IEEE Trans. Neural Networks Learn. Syst., 33 (2021), 5542–5556. https://doi.org/10.1109/TNNLS.2021.3070966 doi: 10.1109/TNNLS.2021.3070966
    [24] H. Li, C. Hu, G. Zhang, J. Hu, L. Wang, Fixed-/preassigned-time stabilization of delayed memristive neural networks, Inf. Sci., 610 (2022), 624–636. https://doi.org/10.1016/j.ins.2022.08.011 doi: 10.1016/j.ins.2022.08.011
    [25] Z. Yan, X. Huang, J. Cao, Variable-sampling-period dependent global stabilization of delayed memristive neural networks based on refined switching event-triggered control, Sci. China Inf. Sci., 63 (2020), 212201. https://doi.org/10.1007/s11432-019-2664-7 doi: 10.1007/s11432-019-2664-7
    [26] R. Zhao, Z. Zuo, Y. Wang, Event-triggered control for networked switched systems with quantization, IEEE Trans. Syst. Man Cybern., 52 (2022), 6120–6128. https://doi.org/10.1109/TSMC.2021.3139386 doi: 10.1109/TSMC.2021.3139386
    [27] J. Ping, S. Zhu, M. Shi, S. Wu, M. Shen, X. Liu, et al., Event-triggered finite-time synchronization control for quaternion-valued memristive neural networks by an non-decomposition method, IEEE Trans. Network Sci. Eng., 10 (2023), 3609–3619. https://doi.org/10.1109/TNSE.2023.3268101 doi: 10.1109/TNSE.2023.3268101
    [28] J. Ping, S. Zhu, X. Liu, Finite/fixed-time synchronization of memristive neural networks via event-triggered control, Knowl. Based Syst., 258 (2022), 110013. https://doi.org/10.1016/j.knosys.2022.110013 doi: 10.1016/j.knosys.2022.110013
    [29] Y. Zhou, H. Zhang, Z. Zeng, Synchronization of memristive neural networks with unknown parameters via event-triggered adaptive control, Neural Networks, 139 (2021), 255–264. https://doi.org/10.1016/j.neunet.2021.02.029 doi: 10.1016/j.neunet.2021.02.029
    [30] N. Li, X. Wu, J. Feng, J. Lü, Fixed-time synchronization of complex dynamical networks: a novel and economical mechanism, IEEE Trans. Cybern., 52 (2022), 4430–4440. https://doi.org/10.1109/TCYB.2020.3026996 doi: 10.1109/TCYB.2020.3026996
    [31] S. Chen, Q. Song, Z. Zhao, Y. Liu, F. E. Alsaadi, Global asymptotic stability of fractional-order complex-valued neural networks with probabilistic time-varying delays, Neurocomputing, 450 (2021), 311–318. https://doi.org/10.1016/j.neucom.2021.04.043 doi: 10.1016/j.neucom.2021.04.043
    [32] J. Han, G. Chen, L. Wang, G. Zhang, J. Hu, Direct approach on fixed-time stabilization and projective synchronization of inertial neural networks with mixed delays, Neurocomputing, 535 (2023), 97–106. https://doi.org/10.1016/j.neucom.2023.03.038 doi: 10.1016/j.neucom.2023.03.038
    [33] A. F. Filippov, Differential equations with discontinuous right-hand side, Mat. Sb., 51 (1988), 99–128.
    [34] G. Zhang, Y. Shen, Q. Yin, J. Sun, Passivity analysis for memristor-based recurrent neural networks with discrete and distributed delays, Neural Networks, 61 (2015), 49–58. https://doi.org/10.1016/j.neunet.2014.10.004 doi: 10.1016/j.neunet.2014.10.004
    [35] E. Jiménez-Rodríguez, J. D. Sánchez-Torres, A. G. Loukianov, On optimal predefined-time stabilization, Int. J. Robust Nonlinear Control, 27 (2017), 3620–3642. https://doi.org/10.1002/rnc.3757 doi: 10.1002/rnc.3757
    [36] H. Khalil, Nonlinear systems, 3 Eds., Prentice Hall, 2002.
    [37] H. Jia, D. Luo, J. Wang, H. Shen, Fixed-time synchronization for inertial cohen–grossberg delayed neural networks: an event-triggered approach, Knowl. Based Syst., 250 (2022), 109104. https://doi.org/10.1016/j.knosys.2022.109104 doi: 10.1016/j.knosys.2022.109104
    [38] F. H. Clarke, Y. S. Ledyaev, R. J. Stern, P. R. Wolenski, Nonsmooth analysis and control theory, Springer Science & Business Media, 1998. https://doi.org/10.1007/b97650
  • This article has been cited by:

    1. Faisal Yousafzai, Muhammad Danish Zia, Mohammed M. Khalaf, Esmail Hassan Abdullatif Al-Sabri, Rashad Ismail, Ewa Pawluszewicz, Applications of AG-Groupoids in Decision-Making via Linear Diophantine Fuzzy Sets, 2023, 2023, 1607-887X, 1, 10.1155/2023/3411475
    2. Jinxia Huo, Weidong Zhang, Zhenmin Chen, Enhanced decision-making through an intelligent algorithmic approach for multiple-attribute college English teaching quality evaluation with interval-valued intuitionistic fuzzy sets, 2024, 28, 13272314, 279, 10.3233/KES-230299
    3. Faisal Yousafzai, Muhammad Danish Zia, Murad-ul-Islam Khan, Mohammed. M. Khalaf, Rashad Ismail, Linear Diophantine fuzzy sets over complex fuzzy information with applications in information theory, 2024, 15, 20904479, 102327, 10.1016/j.asej.2023.102327
    4. Xiaoying Wang, Muhammad Danish Zia, Faisal Yousafzai, Sarfraz Ahmed, Muwen Wang, Complex fuzzy intelligent decision modeling for optimizing economic sustainability in transportation sector, 2024, 10, 2199-4536, 3833, 10.1007/s40747-024-01372-9
    5. Muhammad Danish Zia, Faisal Yousafzai, Saleem Abdullah, Kostaq Hila, Complex linear Diophantine fuzzy sets and their applications in multi-attribute decision making, 2024, 132, 09521976, 107953, 10.1016/j.engappai.2024.107953
    6. Ya Qin, Siti Rahayu Mohd. Hashim, Jumat Sulaiman, A new distance measure and corresponding TOPSIS method for interval-valued intuitionistic fuzzy sets in multi-attribute decision-making, 2023, 8, 2473-6988, 26459, 10.3934/math.20231351
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1065) PDF downloads(92) Cited by(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog