Processing math: 100%
Research article Special Issues

Research on multi-load AGV path planning of weaving workshop based on time priority

  • Received: 24 November 2018 Accepted: 25 February 2019 Published: 15 March 2019
  • The multi-load AGV (Automatic Guided Vehicle) is a new kind of materials handling equipment used to load cloth automatically in an intelligent weaving workshop. It can transport multiple rolls of cloth and choose the correct, most effective path to improve the transportation efficiency without people engaged in. This paper creates a feasible path topology according to the layout of the workshop and the logistics environment, and uses the Warshall-Floyd algorithm to search for the optimal route between two arbitrary points. The aim of the path planning is to maximize the machine efficiency, which is constrained by environmental limits, load limits and work limits. This paper establishes the mathematical model of the path planning problem using the mixed genetic particle swarm optimization algorithm (GA-PSO) to solve the problem, and the particle iteration mechanism based on the time priority is proposed to make the evolution more directional and accelerate the convergence speed of the algorithm. The effectiveness and practicability of the model and methods are verified by simulation and benefit analysis.

    Citation: Li-zhen Du, Shanfu Ke, Zhen Wang, Jing Tao, Lianqing Yu, Hongjun Li. Research on multi-load AGV path planning of weaving workshop based on time priority[J]. Mathematical Biosciences and Engineering, 2019, 16(4): 2277-2292. doi: 10.3934/mbe.2019113

    Related Papers:

    [1] Kazuo Sano . Intelligence and global bias in the stock market. Data Science in Finance and Economics, 2023, 3(2): 184-195. doi: 10.3934/DSFE.2023011
    [2] Aihua Li, Qinyan Wei, Yong Shi, Zhidong Liu . Research on stock price prediction from a data fusion perspective. Data Science in Finance and Economics, 2023, 3(3): 230-250. doi: 10.3934/DSFE.2023014
    [3] Jin Zeng, Yijia Zhang, Yun Yin, Peter G Moffatt . The effect of the Covid pandemic on stock market volatility: Separating initial impact from time-to-recovery. Data Science in Finance and Economics, 2024, 4(4): 531-547. doi: 10.3934/DSFE.2024022
    [4] Bilal Ahmed Memon, Hongxing Yao . Correlation structure networks of stock market during terrorism: evidence from Pakistan. Data Science in Finance and Economics, 2021, 1(2): 117-140. doi: 10.3934/DSFE.2021007
    [5] Zimei Huang, Zhenghui Li . What reflects investor sentiment? Empirical evidence from China. Data Science in Finance and Economics, 2021, 1(3): 235-252. doi: 10.3934/DSFE.2021013
    [6] Nurun Najwa Bahari, Hafizah Bahaludin, Munira Ismail, Fatimah Abdul Razak . Network, correlation, and community structure of the financial sector of Bursa Malaysia before, during, and after COVID-19. Data Science in Finance and Economics, 2024, 4(3): 362-387. doi: 10.3934/DSFE.2024016
    [7] Deniz Sevinç . Volatility spillovers among MIST stock markets. Data Science in Finance and Economics, 2022, 2(2): 80-95. doi: 10.3934/DSFE.2022004
    [8] Kuo-Shing Chen . Interlinkages between Bitcoin, green financial assets, oil, and emerging stock markets. Data Science in Finance and Economics, 2024, 4(1): 160-187. doi: 10.3934/DSFE.2024006
    [9] Yi Chen, Zhehao Huang . Measuring the effects of investor attention on China's stock returns. Data Science in Finance and Economics, 2021, 1(4): 327-344. doi: 10.3934/DSFE.2021018
    [10] Alejandro Rodriguez Dominguez, Om Hari Yadav . A causal interactions indicator between two time series using extreme variations in the first eigenvalue of lagged correlation matrices. Data Science in Finance and Economics, 2024, 4(3): 422-445. doi: 10.3934/DSFE.2024018
  • The multi-load AGV (Automatic Guided Vehicle) is a new kind of materials handling equipment used to load cloth automatically in an intelligent weaving workshop. It can transport multiple rolls of cloth and choose the correct, most effective path to improve the transportation efficiency without people engaged in. This paper creates a feasible path topology according to the layout of the workshop and the logistics environment, and uses the Warshall-Floyd algorithm to search for the optimal route between two arbitrary points. The aim of the path planning is to maximize the machine efficiency, which is constrained by environmental limits, load limits and work limits. This paper establishes the mathematical model of the path planning problem using the mixed genetic particle swarm optimization algorithm (GA-PSO) to solve the problem, and the particle iteration mechanism based on the time priority is proposed to make the evolution more directional and accelerate the convergence speed of the algorithm. The effectiveness and practicability of the model and methods are verified by simulation and benefit analysis.


    Mathematical models of physics, chemistry, ecology, physiology, psychology, engineering and social sciences have been governed by differential equation and difference equation. With the development of computers, compared with continuous-time model, discrete-time models described by difference equations are better formulated and analyzed in the past decades. Recently laser model has vast application in medical sciences, industries, highly security areas in army [1,2,3,4,5,6,7]. Laser, whose basic principal lies on the Einstein theory of light proposed in 1916, is a device that produces intense beam of monochromatic and coherent light. Since then it is developed by Gordon Gould in 1957. In 1960, the first working ruby laser was invented by Theodore Maiman. Laser light is coherent, highly directional and monochromatic which makes it different from ordinary light. The working principle of laser is based on the spontaneous absorption, spontaneous emission, stimulated emission, and population inversion are essential for the laser formation. The readers can refer to [8,9,10]. For instance, Hakin [11] proposed a simple continuous-time laser model in 1983. Khan and Sharif [12] proposed a discrete-time laser model and studied extensively dynamical properties about fixed points, the existence of prime period and periodic points, and transcritical bifurcation of a one-dimensional discrete-time laser model in R+.

    In fact, the identification of the parameters of the model is usually based on statistical method, starting from data experimentally obtained and on the choice of some method adapted to the identification. These models, even the classic deterministic approach, are subjected to inaccuracies (fuzzy uncertainty) that can be caused by the nature of the state variables, by parameters as coefficients of the model and by initial conditions. In fact, fuzzy difference equation is generation of difference equation whose parameters or the initial values are fuzzy numbers, and its solutions are sequences of fuzzy numbers. It has been used to model a dynamical systems under possibility uncertainty. Due to the applicability of fuzzy difference equation for the analysis of phenomena where imprecision is inherent, this class of difference equation is a very important topic from theoretical point of view and also its applications. Recently there has been an increasing interest in the study of fuzzy difference equations (see [13,14,15,16,17,18,19,20,21,22,23,24,25]).

    In this paper, by virtue of the theory of fuzzy sets, we consider the following discrete-time laser model with fuzzy uncertainty parameters and initial conditions.

    xn+1=Axn+BxnCxn+H,n=0,1,, (1.1)

    where xn is the number of laser photon at the nth time, A,B,C,H and the initial value x0 are positive fuzzy numbers.

    The main aim of this work is to study the existence of positive solutions of discrete-time laser model (1.1). Furthermore, according to a generation of division (g-division) of fuzzy numbers, we derive some conditions so that every positive solution of discrete-time laser model (1.1) is bounded. Finally, under some conditions we prove that discrete-time laser model (1.1) has a fixed point 0 which is asymptotically stable, and a unique positive fixed point x.

    Firstly, we give the following definitions and lemma needed in the sequel.

    Definition 2.1.[26] u:R[0,1] is said to be a fuzzy number if it satisfies conditions (i)–(iv) written below:

    (i) u is normal, i. e., there exists an xR such that u(x)=1;

    (ii) u is fuzzy convex, i. e., for all t[0,1] and x1,x2R such that

    u(tx1+(1t)x2)min{u(x1),u(x2)};

    (iii) u is upper semicontinuous;

    (iv) The support of u, suppu=¯α(0,1][u]α=¯{x:u(x)>0} is compact.

    For α(0,1], the αcuts of fuzzy number u is [u]α={xR:u(x)α} and for α=0, the support of u is defined as suppu=[u]0=¯{xR|u(x)>0}.

    A fuzzy number can also be described by a parametric form.

    Definition 2.2. [26] A fuzzy number u in a parametric form is a pair (ul,ur) of functions ul,ur,0α1, which satisfies the following requirements:

    (i) ul(α) is a bounded monotonic increasing left continuous function,

    (ii) ur(α) is a bounded monotonic decreasing left continuous function,

    (iii) ul(α)ur(α),0α1.

    A crisp (real) number x is simply represented by (ul(α),ur(α))=(x,x),0α1. The fuzzy number space {(ul(α),ur(α))} becomes a convex cone E1 which could be embedded isomorphically and isometrically into a Banach space (see [26]).

    Definition 2.3.[26] The distance between two arbitrary fuzzy numbers u and v is defined as follows:

    D(u,v)=supα[0,1]max{|ul,αvl,α|,|ur,αvr,α|}. (2.1)

    It is clear that (E1,D) is a complete metric space.

    Definition 2.4.[26] Let u=(ul(α),ur(α)),v=(vl(α),vr(α))E1,0α1, and kR. Then

    (i) u=v iff ul(α)=vl(α),ur(α)=vr(α),

    (ii) u+v=(ul(α)+vl(α),ur(α)+vr(α)),

    (iii) uv=(ul(α)vr(α),ur(α)vl(α)),

    (iv) ku={(kul(α),kur(α)),k0;(kur(α),kul(α)),k<0,

    (v) uv=(min{ul(α)vl(α),ul(α)vr(α),ur(α)vl(α),ur(α)vr(α)},max{ul(α)vl(α),ul(α)vr(α),ur(α)vl(α),ur(α)vr(α)}).

    Definition 2.5. [27] Suppose that u,vE1 have α-cuts [u]α=[ul,α,ur,α],[v]α=[vl,α,vr,α], with 0[v]α,α[0,1]. The generation of division (g-division) ÷g is the operation that calculates the fuzzy number s=u÷gv having level cuts [s]α=[sl,α,sr,α](here [u]α1=[1/ur,α,1/ul,α]) defined by

    [s]α=[u]α÷g[v]α{(i)[u]α=[v]α[s]α,or(ii)[v]α=[u]α[s]α1 (2.2)

    provided that s is a proper fuzzy number sl,α is nondecreasing, sr,α is nonincreasing, sl,1sr,1.

    Remark 2.1. According to [27], in this paper the fuzzy number is positive, if u÷gv=sE1 exists, then the following two cases are possible

    Case I. if ul,αvr,αur,αvl,α,α[0,1], then sl,α=ul,αvl,α,sr,α=ur,αvr,α,

    Case II. if ul,αvr,αur,αvl,α,α[0,1], then sl,α=ur,αvr,α,sr,α=ul,αvl,α.

    Definition 2.6. [26] A triangular fuzzy number (TFN) denoted by A is defined as (a,b,c) where the membership function

    A(x)={0,xa;xaba,axb;1,x=b;cxcb,bxc;0,xc.

    The αcuts of A=(a,b,c) are described by [A]α={xR:A(x)α}=[a+α(ba),cα(cb)]=[Al,α,Ar,α], α[0,1], it is clear that [A]α are closed interval. A fuzzy number A is positive if suppA(0,).

    The following proposition is fundamental since it characterizes a fuzzy set through the α-levels.

    Proposition 2.1.[26] If {Aα:α[0,1]} is a compact, convex and not empty subset family of Rn such that

    (i) ¯AαA0.

    (ii) Aα2Aα1 if α1α2.

    (iii) Aα=k1Aαk if αkα>0.

    Then there is uEn(En denotes n dimensional fuzzy number space) such that [u]α=Aα for all α(0,1] and [u]0=¯0<α1AαA0.

    The fuzzy analog of the boundedness and persistence (see [15,16]) is as follows:

    Definition 2.7. A sequence of positive fuzzy numbers (xn) is persistence (resp. bounded) if there exists a positive real number M (resp. N) such that

    supp xn[M,)(resp. supp xn(0,N]),n=1,2,,

    A sequence of positive fuzzy numbers (xn) is bounded and persistence if there exist positive real numbers M,N>0 such that

    supp xn[M,N],n=1,2,.

    A sequence of positive fuzzy numbers (xn),n=1,2,, is an unbounded if the norm xn,n=1,2,, is an unbounded sequence.

    Definition 2.8. xn is a positive solution of (1.1) if (xn) is a sequence of positive fuzzy numbers which satisfies (1.1). A positive fuzzy number x is called a positive equilibrium of (1.1) if

    x=Ax+BxCx+H.

    Let (xn) be a sequence of positive fuzzy numbers and x is a positive fuzzy number, xnx as n if limnD(xn,x)=0.

    Lemma 2.1. [26] Let f:R+×R+×R+×R+R+ be continuous, A,B,C,D are fuzzy numbers. Then

    [f(A,B,C,D)]α=f([A]α,[B]α,[C]α,[D]α),  α(0,1]. (2.3)

    Firstly we give the existence of positive solutions of discrete-time laser model with fuzzy environment.

    Theorem 3.1. Let parameters A,B,C,H and initial value x0 of discrete-time laser model be fuzzy numbers. Then, for any positive fuzzy number x0, there exists a unique positive solution xn of discrete-time laser model with initial conditions x0.

    Proof. The proof is similar to those of Proposition 2.1 [25]. So we omit the proof of Theorem 3.1.

    Noting Remark 2.1, taking α-cuts, one of the following two cases holds

    Case I

    [xn+1]α=[Ln+1,α,Rn+1,α]=[Al,αLn,α+Bl,αLn,αCl,αLn,α+Hl,α,Ar,αRn,α+Br,αRn,αCr,αRn,α+Hr,α] (3.1)

    Case II

    [xn+1]α=[Ln+1,α,Rn+1,α]=[Al,αLn,α+Br,αRn,αCr,αRn,α+Hr,α,Ar,αRn,α+Bl,αLn,αCl,αLn,α+Hl,α] (3.2)

    To study the dynamical behavior of the positive solutions of discrete-time laser model (1.1), according to Definition 2.5, we consider two cases.

    First, if Case I holds true, we need the following lemma.

    Lemma 3.1. Consider the following difference equation

    yn+1=ayn+byncyn+h,  n=0,1,, (3.3)

    where a(0,1),b,c,h(0,+),y0(0,+), then the following statements are true:

    (i) Every positive solution of (3.3) satisfies

    0<ynbc(1a)+y0. (3.4)

    (ii) The equation has a fixed point y=0 if b(1a)h.

    (iii) The equation has two fixed points y=0,y=bc(1a)hc if b>(1a)h.

    Proof. (i) Let yn be a positive solution of (3.3). It follows from (3.3) that, for n0,

    0<yn+1=ayn+byncyn+hayn+bc.

    From which we have

    0<ynbc(1a)+(y0bc(1a))an+1bc(1a)+y0.

    This completes the proof of (i).

    If y is fixed point of (3.3), i.e., yn=y. So from (3.3), we have

    y=ay+bycy+h. (3.5)

    After some manipulation, from (3.5), we can get

    y=0,  y=bc(1a)hc. (3.6)

    From (3.3), we can summarized the existence of fixed points as follows

    (ii) If b<h(1a), then y=bc(1a)hc is not a positive number. And hence if bh(1a) then (3.3) has a fixed point y=0.

    (iii) If b>h(1a), then y=bc(1a)hc is a positive number. And hence if b>h(1a) then (3.3) has two fixed points y=0,y=bc(1a)hc.

    Proposition 3.1. The following statements hold true

    (i) The fixed point y=0 of (3.3) is stable if b<(1a)h.

    (ii) The fixed point y=0 of (3.3) is unstable if b>(1a)h.

    (iii) The fixed point y=0 of (3.3) is non-hyperbolic if b=(1a)h.

    Proof. From (3.3), let

    f(y):=ay+bycy+h (3.7)

    From (3.7), it follows that

    f(y)=a+bh(cy+h)2 (3.8)

    From (3.8), it can get

    |f(y)|y=0|=|a+bh| (3.9)

    Therefore from (3.9), it can conclude that y=0 is stable if b<(1a)h, unstable if b>(1a)h, non-hyperbolic if b=(1a)h.

    Proposition 3.2. The fixed point y=bc(1a)hc of (3.3) is globally asymptotically stable if b>(1a)h.

    Proof. From (3.8), it can get

    |f(y)|y=bc(1a)hc|=|a+h(1a)2b|. (3.10)

    Therefore from (3.10), it can conclude that, if a+h(1a)2b<1, i.e., b>(1a)h then the fixed point y=bc(1a)hc is stable.

    On the other hand, it follows from (3.4) that (yn) is bounded. And from (3.8), we have f(y)>0. Namely (yn) is monotone increasing. So we have

    limnyn=y=bc(1a)hc. (3.11)

    Therefore the fixed point y=bc(1a)hc is globally asymptotically stable.

    Proposition 3.3. The fixed point y=0 of (3.3) is globally asymptotically stable if b<(1a)h.

    Proof. From (3.3), we can get that

    yn+1(a+bh)yn (3.12)

    From (3.12), it follows that

    y1(a+bh)y0y2(a+bh)2y0yn(a+bh)ny0 (3.13)

    Since b<(1a)h, then limnyn=0. Therefore the fixed point y=0 of (3.3) is globally asymptotically stable.

    Theorem 3.2. Consider discrete-time laser model (1.1), where A,B,C,H and initial value x0 are positive fuzzy numbers. There exists positive number NA, α(0,1], Ar,α<NA<1. If

    Bl,αLn,αBr,αRn,αCl,αLn,α+Hl,αCr,αRn,α+Hr,α,α(0,1]. (3.14)

    and

    Bl,α<Hl,α(1Al,α),   Br,α<Hr,α(1Ar,α),  α(0,1]. (3.15)

    Then (1.1) has a fixed point x=0 which is globally asymptotically stable.

    Proof. Since A,B,C,H are positive fuzzy numbers and (3.14) holds true, taking α-cuts of model (1.1) on both sides, we can have the following difference equation system with parameters

    Ln+1,α=Al,αLn,α+Bl,αLn,αCl,αLn,α+Hl,α,  Rn+1,α=Ar,αRn,α+Br,αRn,αCr,αRn,α+Hr,α. (3.16)

    Since (3.15) holds true, using Proposition 3.2, we can get

    limnLn,α=0,  limnRn,α=0. (3.17)

    On the other hand, let xn=x, where [xn]α=[Ln,α,Rn,α]=[Lα,Rα]=[x]α,α(0,1], be the fixed point of (1.1). From (3.16), one can get

    Lα=Al,αLα+Bl,αLαCl,αLα+Hl,α,  Rα=Ar,αRα+Br,αRαCr,αRα+Hr,α. (3.18)

    Since (3.15) is satisfied, from (3.16), it follows that

    Lα=0,  Rα=0, limnD(xn,x)=limnsupα(0,1]{max{|Ln,αLα|,|Rn,αRα|}}=0. (3.19)

    Therefore, by virtue of Proposition 3.3, the fixed point x=0 is globally asymptotically stable.

    Theorem 3.3. Consider discrete-time laser model (1.1), where A,B,C,H and initial value x0 are positive fuzzy numbers, there exists positive number NA, α(0,1], Ar,α<NA<1. If (3.14) holds true, and

    Bl,α>Hl,α(1Al,α),   Br,α>Hr,α(1Ar,α),  α(0,1], (3.20)

    then the following statements are true.

    (i) Every positive solution of (1.1) is bounded.

    (ii) Equation (1.1) has a unique positive fixed point x which is asymptotically stable.

    Proof. (i) Since A,B,C,H and x0 are positive fuzzy numbers, there exist positive constants MA,NA,MB, NB,MC,NC,MH,NH,M0,N0 such that

    {[A]α=[Al,α,Ar,α]¯α(0,1][Al,α,Ar,α][MA,NA][B]α=[Bl,α,Br,α]¯α(0,1][Bl,α,Br,α][MB,NB][C]α=[Cl,α,Cr,α]¯α(0,1][Cl,α,Cr,α][MC,NC][H]α=[Hl,α,Hr,α]¯α(0,1][Hl,α,Hr,α][MH,NH][x0]α=[L0,α,R0,α]¯α(0,1][L0,α,R0,α][M0,N0] (3.21)

    Using (i) of Lemma 3.1, we can get that

    0<LnBl,αCl,α(1Al,α)+L0,α,  0<RnBr,αCr,α(1Ar,α)+R0,α. (3.22)

    From (3.21) and (3.22), we have that for α(0,1]

    [Ln,α,Rn,α][0,N], n1. (3.23)

    where N=NBMC(1NA)+N0. From (3.22), we have for n1,α(0,1][Ln,α,Rn,α](0,N], so ¯α(0,1][Ln,α,Rn,α](0,N]. Thus the proof of (i) is completed.

    (ii) We consider system (3.18), then the positive solution of (3.18) is given by

    Lα=Bl,αCl,α(1Al,α)Hl,αCl,α, Rα=Br,αCr,α(1Ar,α)Hr,αCr,α,α(0,1]. (3.24)

    Let xn be a positive solution of (1.1) such that [xn]α=[Ln,α,Rn,α],α(0,1],n=0,1,2,. Then applying Proposition 3.2 to system (3.16), we have

    limnLn,α=Lα,   limnRn,α=Rα (3.25)

    From (3.23) and (3.25), we have, for 0<α1<α2<1,

    0<Lα1Lα2Rα2Rα1. (3.26)

    Since Al,α,Ar,α,Bl,α,Br,α,Cl,α,Cr,α,Hl,α,Hr,α are left continuous. It follows from (3.24) that Lα,Rα are also left continuous.

    From (3.21) and (3.24), it follows that

    c=MBNC(1MA)NHMCLαRαNBMA(1NA)MHNC=d. (3.27)

    Therefore (3.27) implies that [Lα,Rα][c,d], and so α(0,1][Lα,Rα][c,d]. It is clear that

    α(0,1][Lα,Rα] is  compact and α(0,1][Lα,Rα](0,). (3.28)

    So from Definition 2.2, (3.24), (3.26), (3.28) and since Lα,Rα,α(0,1] determine a fuzzy number x such that

    x=Ax+BxCx+H,  [x]α=[Lα,Rα], α(0,1]. (3.29)

    Suppose that there exists another positive fixed point ˉx of (1.1), then there exist functions ¯Lα,¯Rα:(0,1)(0,) such that

    ˉx=Aˉx+BˉxCˉx+H,  [x]α=[¯Lα,¯Rα], α(0,1].

    From which we have

    ¯Lα=Al,α¯Lα+Bl,α¯LαCl,α¯Lα+Hl,α,  ¯Rα=Ar,α¯Rα+Br,α¯RαCr,α¯Rα+Hr,α.

    So ¯Lα=Lα,¯Rα=Rα,α(0,1]. Hence ˉx=x, namely x is a unique positive fixed point of (1.1).

    From (3.25), we have

    limnD(xn,x)=limnsupα(0,1]max{|Ln,αLα|,|Rn,αRα|}=0. (3.30)

    Namely, every positive solution xn of (1.1) converges the unique fixed point x with respect to D as n. Applying Proposition 3.2, it can obtain that the positive fixed point x is globally asymptotically stable.

    Secondly, if Case II holds true, it follows that for n{0,1,2,},α(0,1]

    Ln+1,α=Al,αLn,α+Br,αRn,αCr,αRn,α+Hr,α,  Rn+1,α==Ar,αRn,α+Bl,αLn,αCl,αLn,α+Hl,α (3.31)

    We need the following lemma.

    Lemma 3.2. Consider the system of difference equations

    yn+1=a1yn+b2znc2zn+h2,  zn+1=a2zn+b1ync1yn+h1,  n=0,1,, (3.32)

    where ai(0,1),bi,ci,hi(0,+)(i=1,2),y0,z0(0,+). If

    a1+a2<1. (3.33)

    and

    b1b2>h1h2(1a1)(1a2). (3.34)

    Then the following statements are true.

    (i) Every positive solution (yn,zn) of (3.32) satisfy

    0<ynb2(1a1)c2+y0,   0<znb1(1a2)c1+z0. (3.35)

    (ii) System (3.32) has fixed point (y,z)=(0,0) which is asymptotically stable.

    (iii) System (3.32) has a unique fixed point

    y=(1a2)Kb1c2+h2c1(1a2),z=(1a1)Kb2c1+h1c2(1a1), (3.36)

    where K=b1b2h1h2(1a1)(1a2)(1a1)(1a2).

    Proof. (i) Let (yn,zn) be a positive solution of (3.32). It follows from (3.32) that, for n0,

    0<yn+1=a1yn+b2znc2zn+h2a1yn+b2c2,  0<zn+1=a2zn+b1ync1yn+h1a2zn+b1c1.

    From which, we have

    {0<ynb2c2(1a1)+(y0b2c2(1a1))an1b2c2(1a1)+y00<znb1c1(1a2)+(z0b1c1(1a2))an2b1c1(1a2)+z0.

    This completes the proof of (i).

    (ii) It is clear that (0,0) is a fixed point of (3.32). We can obtain that the linearized system of (3.32) about the fixed point (0,0) is

    Xn+1=D1Xn, (3.37)

    where Xn=(xn,yn)T and

    D1=(a1b2c2b1h1a2).

    Thus the characteristic equation of (3.37) is

    λ2(a1+a2)λ+a1a2b1b2h1h2=0. (3.38)

    Since (3.33) and (3.34) hold true, we have

    a1+a2+a1a2b1b2h1h2<a1+q2+a1a2(1a1)(1a2)<1 (3.39)

    By virtue of Theorem 1.3.7 [28], we obtain that the fixed point (0,0) is asymptotically stable.

    (iii) Let (yn,zn)=(y,z) be fixed point of (3.32). We consider the following system

    y=a1y+b1zc1z+h1,   z=a2z+b2yc2y+h2. (3.40)

    It is clear that the positive fixed point (y,z) can be written by (3.36).

    Theorem 3.4. Consider the difference Eq (1.1), where A,B,C,H are positive fuzzy numbers. There exists positive number NA,α(0,1],Ar,α<NA<1. If

    Bl,αLn,αBr,αRn,αCl,αLn,α+Hl,αCr,αRn,α+Hr,α,α(0,1], (3.41)
    Al,α+Ar,α<1,α(0,1], (3.42)

    and

    Bl,αBr,α>Hl,αHr,α(1Al,α)(1Ar,α),α(0,1]. (3.43)

    Then the following statements are true

    (i) Every positive solution of (1.1) is bounded.

    (ii) The Eq (1.1) has a fixed point 0 which is globally asymptotically stable.

    (iii) The Eq (1.1) has a unique positive fixed point x such that

    [x]α=[Lα,Rα], Lα=(1Ar,α)KαBl,αCr,α+Hr,αCl,α(1Ar,α),Rα=(1Al,α)KαBr,αCl,α+Hl,αCr,α(1Al,α),

    where

    Kα=Bl,αBr,αHl,αHr,α(1Al,α)(1Ar,α)(1Al,α)(1Ar,α). (3.44)

    Proof. (i) Let xn be a positive solution of (1.1). Applying (i) of Lemma 3.2, we have

    0<LnBr,α(1Al,α)Cr,α+L0,α,  0<RnBl,α(1Ar,α)Cl,α+R0,α. (3.45)

    Next, the proof is similar to (i) of Theorem 3.3. So we omit it.

    (ii) The proof is similar to those of Theorem 3.2. We omit it.

    (iii) Let xn=x be a fixed point of (1.1), then

    x=Ax+BxCx+H. (3.46)

    Taking α-cuts on both sides of (3.46), since (3.41) holds true, one gets the following system

    Lα=Al,αLα+Br,αRαCr,αRα+Hr,α,  Rα=Ar,αRα+Bl,αLαCl,αLα+Hl,α,  α(0,1]. (3.47)

    From which we obtain that

    Lα=(1Ar,α)KαBl,αCr,α+Hr,αCl,α(1Ar,α),Rα=(1Al,α)KαBr,αCl,α+Hl,αCr,α(1Al,α), (3.48)

    Next, we can show that Lα,Rα constitute a positive fuzzy number x such that [x]α=[Lα,Rα],α(0,1]. The proof is similar to (ii) of Theorem 3.3. We omit it.

    Remark 3.1. In dynamical system model, the parameters of model derived from statistic data with vagueness or uncertainty. It corresponds to reality to use fuzzy parameters in dynamical system model. Compared with classic discrete time laser model, the solution of discrete time fuzzy laser model is within a range of value (approximate value), which are taken into account fuzzy uncertainties. Furthermore the global asymptotic behaviour of discrete time laser model are obtained in fuzzy context. The results obtained is generation of discrete time Beverton-Holt population model with fuzzy environment [25].

    In this section, we give two numerical examples to verify the effectiveness of theoretic results obtained.

    Example 4.1. Consider the following fuzzy discrete time laser model

    xn+1=Axn+BxnCxn+H, n=0,1,, (4.1)

    we take A,B,C,H and the initial values x0 such that

    A(x)={10x4,0.4x0.510x+6,0.5x0.6,B(x)={5x4,0.8x15x+6,1x1.2 (4.2)
    C(x)={2x2,1x1.52x+4,1.5x2,H(x)={2x6,3x3.52x+8,3.5x4 (4.3)
    x0(x)={x6,6x7x+8,7x8 (4.4)

    From (4.2), we get

    [A]α=[0.4+110α,0.6110α], [B]α=[0.8+15α,1.215α], α(0,1]. (4.5)

    From (4.3) and (4.4), we get

    [C]α=[1+12α,212α],  [H]α=[3+12α,412α],[x0]α=[6+α,8α], α(0,1]. (4.6)

    Therefore, it follows that

    ¯α(0,1][A]α=[0.4,0.6], ¯α(0,1][B]α=[0.8,1.2], ¯α(0,1][C]α=[1,2],¯α(0,1][H]α=[3,4].¯α(0,1][x0]α=[6,8]. (4.7)

    From (4.1), it results in a coupled system of difference equations with parameter α,

    Ln+1,α=Al,αLn,α+Bl,αLn,αCl,αLn,α+Hl,α,  Rn+1,α=Ar,αRn,α+Br,αRn,αCr,αRn,α+Hr,α, α(0,1]. (4.8)

    Therefore, it is clear that Ar,α<1,α(0,1], (3.14) and (3.15) hold true. so from Theorem 3.2, we have that every positive solution xn of Eq (4.1) is bounded In addition, from Theorem 3.2, Eq (4.1) has a fixed point 0. Moreover every positive solution xn of Eq (4.1) converges the fixed point 0 with respect to D as n. (see Figures 13).

    Figure 1.  The Dynamics of system (4.8).
    Figure 2.  The solution of system (4.8) at α=0 and α=0.25.
    Figure 3.  The solution of system (4.8) at α=0.75 and α=1.

    Example 4.2. Consider the following fuzzy discrete time laser model (4.1). where A,C,H and the initial values x0 are same as Example 4.1.

    B(x)={x2,2x3x+4,3x4 (4.9)

    From (4.9), we get

    [B]α=[2+α,4α], (4.10)

    Therefore, it follows that

    ¯α(0,1][B]α=[2,4],α(0,1]. (4.11)

    It is clear that (3.20) is satisfied, so from Theorem 3.3, Eq (4.1) has a unique positive equilibrium ¯x=(0.341,1.667,3). Moreover every positive solution xn of Eq (4.1) converges the unique equilibrium ¯x with respect to D as n. (see Figures 46)

    Figure 4.  The Dynamics of system (4.8).
    Figure 5.  The solution of system (4.8) at α=0 and α=0.25.
    Figure 6.  The solution of system (4.8) at α=0.75 and α=1.

    In this work, according to a generalization of division (g-division) of fuzzy number, we study the fuzzy discrete time laser model xn+1=Axn+BxnCxn+H. The existence of positive solution and qualitative behavior to (1.1) are investigated. The main results are as follows

    (i) Under Case I, the positive solution is bounded if Bl,α<Hl,α(1Al,α),Br,α<Hr,α(1Ar,α),α(0,1]. Moreover system (1.1) has a fixed point 0 which is globally asymptotically stable. Otherwise, if Bl,αHl,α(1Al,α),Br,αHr,α(1Ar,α),α(0,1]. Then system (1.1) has a unique positive fixed point x which is asymptotically stable.

    (ii) Under Case II, if Al,α+Ar,α<1 and Bl,αBr,α>Hl,αHr,α(1Al,α)(1Ar,α),α(0,1], then the positive solution is bounded. Moreover system (1.1) has a unique positive fixed point x and fixed point 0 which is global asymptotically stable.

    The authors would like to thank the Editor and the anonymous Reviewers for their helpful comments and valuable suggestions to improve the paper. The work is partially supported by National Natural Science Foundation of China (11761018), Scientific Research Foundation of Guizhou Provincial Department of Science and Technology([2020]1Y008, [2019]1051), Priority Projects of Science Foundation at Guizhou University of Finance and Economics (2018XZD02), and Scientific Climbing Programme of Xiamen University of Technology(XPDKQ20021).

    The authors declare that they have no competing interests.



    [1] H. Fazlollahtabar and M. Saidi-Mehrabad, Models for AGVs' scheduling and routing, Autonomous Guided Vehicles, 20 (2015), 1–15.
    [2] G. M. Li, X. Y. Li, L. Gao, et al., Tasks assigning and sequencing of multiple AGVs based on an improved harmony search algorithm, J. Amb. Inter. Hum. Comp., 2018. Available from: DOI, 10.1007/s12652-018-1137-0.
    [3] D. H. Lee, Resource-based task allocation for multi-robot systems, Robot Auton. Syst., 103 (2018), 151–161.
    [4] T. J. Chen, Y. Sun, W. Dai, et al., On the shortest and conflict-free path planning of multi-AGV system based on dijkstra algorithm and the dynamic time-window method, Adv. Mater. Res., 645 (2013), 267–271.
    [5] A. Kaplan, N. Kingry, P. Uhing, et al., Time-optimal path planning with power schedules for a solar-powered ground robot, IEEE T. Autom. Sci. Eng., 14 (2017), 1235–1244.
    [6] N. Smolic-Rocak, S. Bogdan, Z. Kovacic, et al., Time windows based dynamic routing in multi-AGV systems, IEEE T. Autom. Sci. Eng., 7 (2010), 151–155.
    [7] K. G. Huo, Y. Q. Zhang, Z. H. Hu, et al., Research on scheduling problem of multi-load AGV at automated container terminal, J. Dalian Univ. Techno., 6 (2016), 24–251.
    [8] G. M. Li, B. Zeng, W. Liao, et al., A new AGV scheduling algorithm based on harmony search for material transfer in a real-world manufacturing system, Adv. Mech. Eng., 10 (2018), 1–13.
    [9] M. Mousavi, H. J. Yap, S. N. Musa, et al., Multi-objective AGV scheduling in an FMS using a hybrid of genetic algorithm and particle swarm optimization, PLoS One, 12 (2017), 1–24.
    [10] F. Hamed and M. Nezam, An optimal path in a bi-criteria AGV-based flexible job shop manufacturing system having uncertain parameters, Int. J. Ind. Syst. Eng., 13 (2010), 27–55.
    [11] H. Fazlollahtabara and M. Saidi-Mehrabad, Optima path in an intelligent AGV based manufacturing system, Transp. Lett., 7 (2015), 219–228.
    [12] V. K. Chawla, A. K. Chanda, S. Angra, et al., Multi-load AGVs scheduling by application of modified memetic particle swarm optimization algorithm, J. Braz. Socy. Mech. Sci., 2018. Available from: 10.1007/s40430-018-1357-4.
    [13] S. Bakshi, Z. Y. Yan, D. M. Chen, et al., A fast algorithm on minimum-time scheduling of an autonomous ground vehicle using a traveling salesman framework, J. Dyn. Syst. Meas. Control, 2018. Available from: DOI, 10.1115/1.4040665.
    [14] H. Fazlollahtabar and S. Hassanli, Hybrid cost and time path planning for multiple autonomous guided vehicles, Appl. Intell., 48 (2018), 482–498.
    [15] M. Grunow, H. Gunther, M. Lehmann, et al., Dispatching multi-load AGVs in highly automatedseaport container terminals, OR Spectrum., 26 (2014), 211–235.
    [16] T. J. Park, J. W. Ahn, C. S. Han, et al., A path generation algorithm of an automatic guided vehicle using sensor scanning method, J. Mech. Sci. Technol., 16 (2002), 137–146.
    [17] H. Y. Wang, Q. Huang, C. T. Li, et al., Graph theory algorithm and MATLAB simulation, BeiJing (2009), Beihang University Press.
    [18] A. Ali and M Tawhid, A hybrid particle swarm optimization and genetic algorithm with population partitioning for large scale optimization problems, Ain. Shams. Eng. J., 8 (2017), 191–206.
    [19] X. Y. Li and L. Gao, An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem, Int. J. Prod. Econ., 174 (2016), 93–110.
    [20] P. B. C. Miranda and R. B. C. Prudêncio, Generation of particle swarm optimization algorithms: An experimental study using grammar guided genetic, Appl. Soft. Comput., 60 (2017), 281–296.
    [21] S. Hamed and K. Govindan, A hybrid particle swarm optimization and genetic algorithm for closed loop supply chain network design in large scale networks, Appl. Math. Model., 39 (2015), 3990–4012.
    [22] K. Deb and N. Padhye, Enhancing performance of particle swarm optimization through an algorithmic link with genetic algorithms, Comput. Optim. Appl., 57 (2014), 761–794.
    [23] X. Y. Li, L. Gao, Q. K. Pan, et al., An effective hybrid genetic algorithm and variable neighborhood search for integrated process planning and scheduling in a packaging machine workshop, IEEE T. Syst. Man. Cy. S., 2018.
    [24] A. M. Bertram, Q. Zhang, S. C. Kong, et al., A novel particle swarm and genetic algorithm hybrid method for diesel engine performance optimization, Int. J. Engine. Res., 17 (2016), 732–747.
    [25] X. Y. Li, C. Lu, L. Gao, et al., An effective multi-objective algorithm for energy efficient scheduling in a real-life welding shop, IEEE T. Ind. Inform., 14 (2018), 5400–5409.
    [26] Y. N. Yan, L. Z. Liu, B. Y. Luo, et al., Arrangement of garment production line by particle swarm algorithm, J. Text. Res., 39 (2018), 120–124.
  • This article has been cited by:

    1. Ali Zia, Abdelwahed Khamis, James Nichols, Usman Bashir Tayab, Zeeshan Hayder, Vivien Rolland, Eric Stone, Lars Petersson, Topological deep learning: a review of an emerging paradigm, 2024, 57, 1573-7462, 10.1007/s10462-024-10710-9
    2. Zisheng Ouyang, Zhen Chen, Xuewei Zhou, Zhongzhe Ouyang, Imported risk in global financial markets: Evidence from cross-market connectedness, 2025, 10629408, 102374, 10.1016/j.najef.2025.102374
    3. Yue Liu, Lichang Zhang, Pierre Failler, Zirui Wang, The Dynamic Evolution of Agricultural Trade Network Structures and Its Influencing Factors: Evidence from Global Soybean Trade, 2025, 13, 2079-8954, 279, 10.3390/systems13040279
    4. Mohosin Islam Palash, Samia Rahman Misty, Mohammad Shafiul Alam, 2024, Automated Recognition of Harmonic Patterns in Candlestick Chart: A Comparative Study of Machine Learning and Deep Learning Approaches, 979-8-3315-1909-4, 551, 10.1109/ICCIT64611.2024.11022580
  • Reader Comments
  • © 2019 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(6492) PDF downloads(902) Cited by(24)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog