Research article

An iterative technique for solving path planning in identified environments by using a skewed block accelerated algorithm

  • Currently, designing path-planning concepts for autonomous robot systems remains a topic of high interest. This work applies computational analysis through a numerical approach to deal with the path-planning problem with obstacle avoidance over a robot simulation. Based on the potential field produced by Laplace's equation, the formation of a potential function throughout the simulation configuration regions is obtained. This potential field is typically employed as a guide in the global approach of robot path-planning. An extended variant of the over-relaxation technique, namely the skewed block two-parameter over relaxation (SBTOR), otherwise known as the explicit decoupled group two-parameter over relaxation method, is presented to obtain the potential field that will be used for solving the path-planning problem. Experimental results with a robot simulator are presented to demonstrate the performance of the proposed approach on computing the harmonic potential for solving the path-planning problem. In addition to successfully validating pathways generated from various locations, it is also demonstrated that SBTOR outperforms existing over-relaxation algorithms in terms of the number of iterations, as well as the execution time.

    Citation: A'qilah Ahmad Dahalan, Azali Saudi. An iterative technique for solving path planning in identified environments by using a skewed block accelerated algorithm[J]. AIMS Mathematics, 2023, 8(3): 5725-5744. doi: 10.3934/math.2023288

    Related Papers:

    [1] Nehad Ali Shah, Iftikhar Ahmed, Kanayo K. Asogwa, Azhar Ali Zafar, Wajaree Weera, Ali Akgül . Numerical study of a nonlinear fractional chaotic Chua's circuit. AIMS Mathematics, 2023, 8(1): 1636-1655. doi: 10.3934/math.2023083
    [2] Ihtisham Ul Haq, Shabir Ahmad, Sayed Saifullah, Kamsing Nonlaopon, Ali Akgül . Analysis of fractal fractional Lorenz type and financial chaotic systems with exponential decay kernels. AIMS Mathematics, 2022, 7(10): 18809-18823. doi: 10.3934/math.20221035
    [3] Najat Almutairi, Sayed Saber . Chaos control and numerical solution of time-varying fractional Newton-Leipnik system using fractional Atangana-Baleanu derivatives. AIMS Mathematics, 2023, 8(11): 25863-25887. doi: 10.3934/math.20231319
    [4] Dongjie Gao, Peiguo Zhang, Longqin Wang, Zhenlong Dai, Yonglei Fang . A novel high-order symmetric and energy-preserving continuous-stage Runge-Kutta-Nyström Fourier pseudo-spectral scheme for solving the two-dimensional nonlinear wave equation. AIMS Mathematics, 2025, 10(3): 6764-6787. doi: 10.3934/math.2025310
    [5] Mohsen DLALA, Abdelhamid ZAIDI, Farida ALHARBI . Event-triggered impulsive control for exponential stabilization of fractional-order differential system. AIMS Mathematics, 2025, 10(7): 16551-16569. doi: 10.3934/math.2025741
    [6] Anastacia Dlamini, Emile F. Doungmo Goufo, Melusi Khumalo . On the Caputo-Fabrizio fractal fractional representation for the Lorenz chaotic system. AIMS Mathematics, 2021, 6(11): 12395-12421. doi: 10.3934/math.2021717
    [7] Abdulaziz Khalid Alsharidi, Saima Rashid, S. K. Elagan . Short-memory discrete fractional difference equation wind turbine model and its inferential control of a chaotic permanent magnet synchronous transformer in time-scale analysis. AIMS Mathematics, 2023, 8(8): 19097-19120. doi: 10.3934/math.2023975
    [8] Qingkai Xu, Chunrui Zhang, Xingjian Wang . Codimension one and codimension two bifurcations analysis of discrete mussel-algae model. AIMS Mathematics, 2025, 10(5): 11514-11555. doi: 10.3934/math.2025524
    [9] Nisar Gul, Saima Noor, Abdulkafi Mohammed Saeed, Musaad S. Aldhabani, Roman Ullah . Analytical solution of the systems of nonlinear fractional partial differential equations using conformable Laplace transform iterative method. AIMS Mathematics, 2025, 10(2): 1945-1966. doi: 10.3934/math.2025091
    [10] Xiaojun Zhou, Yue Dai . A spectral collocation method for the coupled system of nonlinear fractional differential equations. AIMS Mathematics, 2022, 7(4): 5670-5689. doi: 10.3934/math.2022314
  • Currently, designing path-planning concepts for autonomous robot systems remains a topic of high interest. This work applies computational analysis through a numerical approach to deal with the path-planning problem with obstacle avoidance over a robot simulation. Based on the potential field produced by Laplace's equation, the formation of a potential function throughout the simulation configuration regions is obtained. This potential field is typically employed as a guide in the global approach of robot path-planning. An extended variant of the over-relaxation technique, namely the skewed block two-parameter over relaxation (SBTOR), otherwise known as the explicit decoupled group two-parameter over relaxation method, is presented to obtain the potential field that will be used for solving the path-planning problem. Experimental results with a robot simulator are presented to demonstrate the performance of the proposed approach on computing the harmonic potential for solving the path-planning problem. In addition to successfully validating pathways generated from various locations, it is also demonstrated that SBTOR outperforms existing over-relaxation algorithms in terms of the number of iterations, as well as the execution time.



    Probability theory and other related fields describe stochastic processes as groups of random variables. In verifiable terms, the random variables were correlated or listed by a large number of numbers, usually considered as time foci, providing a translation of stochastic processes into numerical estimation of a system that changes over time, such as bacteria growing and decaying, electrical circuits fluctuating due to thermal noise, or gas molecules forming. A stochastic process can be a scientific model for systems that appear to change at random. Many applications of these techniques exist in various fields, such as biology, ecology, chemistry, and physics, as well as engineering and technology fields, such as picture preparing, data theory, computer science, signal processing, telecommunications, and cryptography.

    Moore's book prompted a systematic investigation into interval arithmetic in different countries after its appearance. Although he dealt with a whole bunch of general ideas for intervals, he mainly focused on bounding solutions to various boundary value and initial value problems, see Ref. [1]. In numerical analysis, compact intervals have played an increasingly important role in verifying or enclosing solutions to a variety of mathematical problems or demonstrating that such problems cannot be solved within a given domain over the past three decades. In order to accomplish this, intervals need to be regarded as extensions of real and complex numbers, interval functions need to be introduced and interval arithmetic applied, and appropriate fixed point theorems have to be applied. A thorough and sophisticated computer implementation of these arithmetic concepts combined with partly new concepts such as controlled rounding, variable precision, and epsilon inflation resulted in the theory being useful in practice, and the computer was able to automatically verify and enclose solutions in many fields. For some recent developments in variety of other practical fields, see Refs. [2,3,4]

    Mathematics is always captivating and fascinating to study when it comes to convex functions. Mathematicians work hard to find and explore a large array of results with fruitful applications. Mathematicians as well as people from physics, economics, data mining, and signal processing have been studying convex functions for years. In the optimization of stochastic processes, especially in numerical approximations when there are probabilistic quantities, convexity is of utmost importance. The convex stochastic processes were defined by Nikodem in 1980, along with some properties known from classical convex functions, see Ref. [5]. The Jensen convex mapping plays a very important role in the inequalities theory. Several well known inequalities are derived from this and this was further utilized by Skowronski in stochastic sense in 1992, see Ref. [6]. Using these notions, Kotrys showed how integral operators can be used to calculate the lower and upper bounds for the Hermite-Hadamard inequality for convex stochastic processes, as well as properties of convex and Jensen-convex processes, see Ref. [7]. Many studies on various types of convexity for stochastic processes have been published in the literature in recent years. Okur et al. [8] developed (H.H) inequality for stochastic p-convexity. Erhan constructs these inequalities using the stochastic s-convex concept, see Ref. [9]. Budak et al. [10] extends the results of the following authors [11] by using the concept of h-convexity to present inequalities in a more generalised form. Check out some recent developments in the stochastic process using a variety of other classes, see Refs. [12,13,14,15,16,17,18,19,20,21]. Tunc created the Ostrowski type inequality for the h-convex function, see Ref. [22]. Later authors extended the results for the Ostrowski inequality and converted them to a stochastic process, see Ref. [23]. We know that Zhao et al. [24] recently connected the term inequalities to interval calculus, and they present the inequalities in this form. Gaining inspiration from this by the end of 2022 Afzal et al. [25] introduces the concept of stochastic processes in relation to interval analysis, as well as the (H.H) and Jensen versions of stochastic processes developed. Eliecer and his co-author developed (m,h1,h2)-G-convex stochastic process and represent the following inequalities, see Ref. [26]. Cortez utilized the concept of fractional operator and developed inequalities using (m,h1,h2)-convex stochastic process, see Ref. [27]. There have been some recent developments related to convex stochastic processes and convexity with the use of IVFS, see Refs. [28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52].

    The stochastic process has been used in various fields related to mathematics and statistics in recent years, and their connection with interval analysis contributes greatly to the accuracy of desired results. Authors have used the stochastic process as a means of analyzing convex analysis and its related integral and variational inequalities over the past years, but the present results are considered novel because the integration of integral inequalities with interval analysis is very new with stochastic processes. They were constructed because we know inequalities play an essential role in ensuring the regularity, stability, and uniqueness of many interval stochastic differential equations, which was not possible with ordinary stochastic inequalities. Using interval analysis, we were able to explore a whole new dimension of inequalities. Some recent advances in interval stochastic processes can be found in the following disciplines, see Refs. [53,54,55].

    Strong literature and specific articles, [10,22,23,24,25,27,51] served as our inspiration as we introduced the concept of the (h1,h2)-convex stochastic process and developed Hermite-Hadamard, Ostrowski and Jensen type inclusions. In addition, we provide some numerically non-trivial examples to demonstrate the validity of the main results. The article is organised as follows: After reviewing the necessary and pertinent information regarding interval-valued analysis in Section 2, we give some introduction related to Stochastic process under Section 3. In Section 4, we discuss our main results. Section 5 explores a brief conclusion.

    This paper employs concepts that are not defined here but are used, see Ref. [25]. There is an interval J that is closed and bounded, and it is defined by the relation given below:

    J=[J_,¯J]={rR:J_r¯J}.

    These J_,¯JR are the endpoints of interval J. When J_=¯J, then the interval J is called to be degenerated. When J_>0 or ¯J<0, we say that it is positive or negative respectively. Therefore, we are talking about the collection of all intervals in R by RI and positive intervals by RI+. The widely used Hausdorff separation of the intervals J and K is defined as:

    D(J,K)=D([J_,¯J],[K_,¯K])=max{|J_K_|,|¯J¯K|}.

    It's obvious that (RI,D) is complete metric space. The definitions of the fundamental interval arithmetic operations are provided below for J and K:

    JK=[J_¯K,¯JK_],J+K=[J_+K_,¯J+¯K],JK=[minO,maxO]where O={J_ K_,J_ ¯K, ¯JK_,¯J ¯K},J/K=[minJ,maxJ]where J={J_/K_,J_/¯K,¯J/K_,¯J/¯K} and 0K.

    The interval J can be multiplied scalarly by

    ϱ[J_,¯J]={[ϱJ_,ϱ¯J],ϱ>0;{0},ϱ=0;[ϱ¯J,ϱJ_],ϱ<0.

    By clarifying how operations are defined on, its algebraic characteristics that make it quasilinear can be explained on RI. They fit into the following categories.

    ● (Associative w.r.t addition) (J+K)+ϱ=J+(K+ϱ) J,K,ϱRI

    ● (Commutative w.r.t addition) J+ϱ=ϱ+J J,ϱRI,

    ● (Additive element) J+0=0+J JRI,

    ● (Law of Cancellation) ϱ+J=ϱ+ϱJ=ϱ J,ϱ,ϱRI,

    ● (Associative w.r.t multiplication) (Jϱ)ϱ=J(ϱϱ) J,ϱ,ϱRI,

    ● (Commutative w.r.t multiplication) Jϱ=ϱJ J,ϱRI,

    ● (Unity element) J1=1J JRI.

    A set's inclusion is another property that is given by

    JKK_J_and¯J¯K.

    When we combine inclusion and arithmetic operations, we get the following relationship, known as the isotone of intervals for inclusion. Consider it will represent the basic arithmetic operations. If J,K,ϱ and ι are intervals, then

    JKandϱι.

    This implies that the following relationship is true.

    JϱKι.

    This proposition is concerned with the preservation of inclusion in scalar multiplication.

    Proposition 2.1. Let J and K be intervals and ϱR, then ϱJϱK.

    The ideas presented below serve as the foundation for this section's discussion of the concept of integral for IVFS: A function F is known as IVF at Ja[J1,J2], if it gives each a nonempty interval Ja[J1,J2]

    F(Ja)=[F_(Ja),¯F(Ja)].

    A partition of any arbitrary subset P of [J1,J2] can be represented as:

    P:J1=Ja<Jb<<Jm=J2.

    The mesh of partition of P is represented by

    Mesh(P)=max{JiJi1:i=1,2,,m}.

    The pack of all partitions of [J1,J2] can be represented by P([J1,J2]). Let P(Δ,[J1,J2]) be the pack of all PP([J1,J2]) with satisfying this mesh(P)<Δ for any arbitrary point in interval, then sum is denoted by:

    S(F,P,Δ)=ni=1F(Jii)[JiJi1],

    where F:[J1,J2]RI. We say that S(F,P,Δ) is a sum of F with reference to PP(Δ,[J1,J2]).

    Definition 2.1. (See [25]) A function F:[J1,J2]RI is known as Riemann integrable for IVF or it can be represented by (IR) on [J1,J2], if γRI such that, for every J2>0 Δ>0 such that

    d(S(F,P,Δ),γ)<J2

    for each Riemann sum S of F with reference to PP(Δ,[J1,J2]) and unrelated to the choice of Jii[Ji1,Ji], 1im. In this scenario, γ is known as (IR)-integral of F on [J1,J2] and is represented by

    γ=(IR)J2J1F(Ja)dJa.

    The pack of all (IR)-integral functions of F on [J1,J2] can be represented by IR([J1,J2]).

    Theorem 2.1. (See [25]) Let F:[J1,J2]RI be an IVF defined as F(Ja)=[F_(Ja),¯F(Ja)]. FIR([J1,J2]) iff F_(Ja),¯F(Ja)R([J1,J2]) and

    (IR)J2J1F(Ja)dJa=[(R)J2J1F_(Ja)dJa,(R)J2J1¯F(Ja)dJa],

    where R([J1,J2]) represent the bunch of all R-integrable functions. If F(Ja)G(Ja) for all Ja[J1,J2], then this holds

    (IR)J2J1F(Ja)dJa(IR)J2J1G(Ja)dJa.

    Definition 3.1. A function F:ΔR defined on probability space (Δ,A,P) is called to be random variable if it is A-measurable. A function F:I×ΔR where IR is known as stochastic process if, J1I the function F(J1,) is a random variable.

    Properties of stochastic process

    A stochastic process F:I×ΔR is

    ● Continuous over interval I, if JoI, one has

    PlimfJoF(J1,.)=F(Jo,.)

    where Plim represent the limit in the space of probabilities.

    ● Continuity in mean square sense over interval I, if JoI, one has

    limJ1JoE[(F(J1,.)F(Jo,.))2]=0,

    where E[F(J1,)] represent the random variable's expected value.

    ● Differentiability in mean square sense at any arbitrary point J1, if one has random variable F:I×ΔR, then this holds

    F(J1,)=PlimJ1JoF(J1,)F(Jo,)J1Jo.

    ● Mean-square integral over I, if J1I, with E[F(J1,)]<. Let [J1,J2]I, J1=bo<b1<b2...<bk=J2 is a partition of [J1,J2]. Let Fn[bn1,bn],n=1,...,k. A random variable S:ΔR is mean square integral of the stochastic process F over interval [J1,J2], if this holds

    limkE[(kn=1F(Fn,.)(bnbn1)R(.))2]=0.

    In that case, it is written as

    R()=J2J1F(a,)da      (a.e.).

    We can immediately deduce the following implication from the definition of mean-square integral. If only for everyone a[J1,J2] the inequality F(a,)R(a,) (a.e.) holds, then

    J2J1F(a,)daJ2J1R(a,)da       (a.e.).

    Afzal et al. [25] developed following results using interval calculus for stochastic process.

    Theorem 3.1. (See [25]) Let h:[0,1]R+ and h0. A function F:I×ΔR+I is h-Godunova-Levin stochastic process for mean square integrable IVFS. For each J1,J2[J1,J2]I, if FSGPX(h,[J1,J2],R+I) and F R+I. Almost everywhere, the following inequality is satisfied

    h(12)2F(J1+J22,)1J2J1J2J1F(a,)da[F(J1,)+F(J2,)]10dah(a). (3.1)

    Theorem 3.2. (See [25]) Let giR+ with k2. If h is non-negative and F:I×ΔR is non-negative h-Godunova-Levin stochastic process for IVFS almost everywhere the following inclusion valid

    F(1Gkki=1giai,.)ki=1[F(ai,.)h(giGk)]. (3.2)

    Definition 3.2. (See [25]) Let h:[0,1]R+. Then F:I×ΔR+ is known as h-convex stochastic process, or that FSPX(h,I,R+), if J1,J2I and a[0,1], we have

    F(aJ1+(1a)J2,) h(a)F(J1,)+h(1a)F(J2,). (3.3)

    In (3.3), if "" is reverse with "", then we call it h-concave stochastic process or FSPV(h,I,R+).

    Definition 3.3. (See [25]) Let h:[0,1]R+. Then the stochastic process F=[F_,¯F]:I×ΔR+I where [J1,J2]I is known as h-Godunova-Levin stochastic process for IVFS or that FSGPX(h,[J1,J2],R+I), if J1,J2[J1,J2] and a[0,1], we have

    F(aJ1+(1a)J2,) F(J1,)h(a)+F(J2,)h(1a). (3.4)

    In (3.4), if "" is reverse with "", then we call it h-Godunova-Levin concave stochastic process for IVFS or FSGPV(h,[J1,J2],R+I).

    Definition 3.4. (See [25]) Let h:[0,1]R+. Then the stochastic process F=[F_,¯F]:I×ΔR+I where [J1,J2]I is known as h-convex stochastic process for IVFS or that FSPX(h,[J1,J2],R+I), if J1,J2[J1,J2] and a[0,1], we have

    F(aJ1+(1a)J2,) h(a)F(J1,)+h(1a)F(J2,). (3.5)

    In (3.5), if "" is reverse with "", then we call it h-concave stochastic process for IVFS or FSPV(h,[J1,J2],R+I).

    Taking inspiration from the preceding literature and definitions, we are now in a position to define a new class of convex stochastic process.

    Definition 4.1. Let h1,h2:[0,1]R+. Then the stochastic process F=[F_,¯F]:I×ΔR+I where [J1,J2]I is called (h1,h2)-convex stochastic process for IVFS or that FSPX((h1,h2),[J1,J2],R+I), if J1,J2[J1,J2] and a[0,1], we have

    F(aJ1+(1a)J2,) h1(a)h2(1a)F(J1,)+h1(1a)h2(a)F(J2,). (4.1)

    In (4.1), if "" is replaced with "", then it is called (h1,h2)-concave stochastic process for IVFS or FSPV((h1,h2),[J1,J2],R+I).

    Remark 4.1. (i) If h1=h2=1, subsequently, Definition 4.1 turns into a stochastic process for P-function.

    (ii) If h1(a)=1h(a),h2=1, subsequently, Definition 4.1 turns into a stochastic process for h-Godunova-Levin function.

    (iii) If h1(a)=a,h2=1, subsequently, Definition 4.1 turns into a stochastic process for general convex function.

    (iv) If h1=as,h2=1, subsequently, Definition 4.1 turns into a stochastic process for s-convex function.

    Theorem 4.1. Let h1,h2:[0,1]R+ and H(12,12)0. A function F:I×ΔR+I is (h1,h2)-convex stochastic process as well as mean square integrable for IVFS. For every J1,J2[J1,J2]I, if FSPX((h1,h2),[J1,J2],R+I) and F R+I. Almost everywhere, the following inclusion is satisfied

    12[H(12,12)]F(J1+J22,)1J2J1J2J1F(e,)de[F(J1,)+F(J2,)]10H(a,1a)da, (4.2)

    where H(a,1a)=h1(a)h2(1a).

    Proof. Since FSPX((h1,h2),[J1,J2],R+I), we have

    1[H(12,12)]F(J1+J22,)F(aJ1+(1a)J2,)+F((1a)J1+aJ2,)1[H(12,12)]F(J1+J22,)[10F(aJ1+(1a)J2,)da+10F((1a)J1+aJ2,)da]=[10F_(aJ1+(1a)J2,)da+10F_((1a)J1aJ2,)da,10¯F(aJ1+(1a)J2,)da+10¯F((1a)J1aJ2,)da]=[2J2J1J2J1F_(e,)de,2J2J1J2J1¯F(e,)de]=2J2J1J2J1F(e,)de. (4.3)

    By Definition 4.1, one has

    F(aJ1+(1a)J2,)h1(a)h2(1a)F(J1,)+h1(1a)h2(a)F(J2,).

    Integrating one has

    10F(aJ1+(1a)J2,)daF(J1,)10h1(a)h2(1a)da+F(J2,)10h1(1a)h2(a)da.

    Accordingly,

    1J2J1J2J1F(e,)de[F(J1,)+F(J2,)]10H(a,1a)da. (4.4)

    Now, collect (4.3) and (4.4), we achieve the desired outcome.

    12[H(12,12)]F(J1+J22,)1J2J1J2J1F(e,)de[F(J1,)+F(J2,)]10H(a,1a)da.

    Example 4.1. Consider [J1,J2]=[1,1],h1(a)=a,h2=1, a [0,1]. If F:[J1,J2]RI+ is defined as

    F(e,)=[e2,5ee].

    Then,

    12[H(12,12)]F(J1+J22,)=[0,4],1J2J1J2J1F(e,)de=[13,10ee2+12e],[F(J1,)+F(J2,)]10H(a,1a)da=[2,10e1e].

    As a result,

    [0,4][13,10ee2+12e][2,10e1e].

    This verifies the above theorem.

    Theorem 4.2. Let h1,h2:[0,1]R+ and H(12,12)0. A function F:I×ΔR+I is (h1,h2)-convex stochastic process as well as mean square integrable for IVFS. For every J1,J2[J1,J2]I, if FSPX((h1,h2),[J1,J2],R+I) and F R+I. Almost everywhere, the following inequality is satisfied

    14[H(12,12)]2F(J1+J22,)11J2J1J2J1F(e,)de2
    {[F(J1,)+F(J2,)][12+H(12,12)]}10H(a,1a)da,

    where

    1=14H(12,12)[F(3J1+J24,)+F(3J2+J14,)],
    2=[F(J1+J22,)+F(J1,)+F(J2,)2]10H(a,1a)da.

    Proof. Take [J1,J1+J22], we have

    F(3J1+J24,)H(12,12)F(aJ1+(1a)J1+J22,)+H(12,12)F((1a)J1+aJ1+J22,).

    Integrating one has

    F(3J1+J22,)H(12,12)[10F(aJ1+(1a)J1+J22,)da+10F(aJ1+J22+(1a)J2,)da]=H(12,12)[2J2J1J1+J22J1F(e,)de+2J2J1J1+J22J1F(e,)de]=H(12,12)[4J2J1J1+J22J1F(e,)de]. (4.5)

    Accordingly,

    14H(12,12)F(3J1+J22,)1J2J1J1+J22J1F(e,)de. (4.6)

    Similarly for interval [J1+J22,J2], we have

    14H(12,12)F(3J2+J12,)1J2J1J2J1+J22F(e,)de. (4.7)

    Adding inclusions (4.6) and (4.7), we get

    1=14H(12,12)[F(3J1+J24,)+F(3J2+J14,)][1J2J1J2J1F(e,)de].Now14[H(12,12)]2F(J1+J22,)=14[H(12,12)]2F(12(3J1+J24,)+12(3J2+J14,))14[H(12,12)]2[H(12,12)F(3J1+J24,)+H(12,12)F(3J2+J14,)]=14H(12,12)[F(3J1+J24,)+F(3J2+J14,)]=114H(12,12){H(12,12)[F(J1,)+F(J1+J22,)]+H(12,12)[F(J2,)+F(J1+J22,)]}=12[F(J1,)+F(J2,)2+F(J1+J22,)][F(J1,)+F(J2,)2+F(J1+J22,)]10H(a,1a)da=2[F(J1,)+F(J2,)2+H(12,12)F(J1,)+H(12,12)F(J2,)]10H(a,1a)da[F(J1,)+F(J2,)2+H(12,12)[F(J1,)+F(J2,)]]10H(a,1a)da{[F(J1,)+F(J2,)][12+H(12,12)]}10H(a,1a)da.

    Example 4.2. Recall the Example 4.1, we have

    14[H(12,12)]2F(J1+J22,)=[0,4],1=[14,10e1e],2=[12,92e+e14],

    and

    {[F(J1,)+F(J2,)][12+H(12,12)]}10H(a,1a)da=[2,10e1e].

    Thus, we obtain

    [0,4][14,10e1e][13,10ee2+12e][12,92e+e14][2,10e1e].

    This verifies the above theorem.

    Theorem 4.3. Suppose h1,h2:(0,1)R+ such that h1,h20. A mappings F,A:I×ΔR+I are (h1,h2)-convex stochastic process as well as mean square integrable for IVFS. For every J1,J2I, if FSPX((h1,h2),[J1,J2],R+I), ASPX((h1,h2),[J1,J2],R+I) and F,A IRI. Almost everywhere, the following inclusion is satisfied

    1J2J1J2J1F(e,)A(e,)deM(J1,J2)10H2(a,1a)da+N(J1,J2)10H(a,a)H(1a,1a)da.

    Proof. Consider FSPX((h1,h2),[J1,J2],R+I), ASPX((h1,h2),[J1,J2],R+I) then, we have

    F(J1a+(1a)J2,)h1(a)h2(1a)F(J1,)+h1(1a)h2(a)F(J2,),
    A(J1a+(1a)J2,)h1(1a)h2(a)A(J1,)+h1(1a)h2(a)A(J2,).

    Then,

    F(J1a+(1a)J2,)A(J1a+(1a)J2,)H2(a,1a)F(J1,)A(J1,)+H2(1a,a)[F(J1,)A(J2,)+F(J2,)A(J1,)]+H(a,a)H(1a,1a)F(J2,)A(J2,).

    Integrating, one has

    10F(J1a+(1a)J2,)A(J1a+(1a)J2,)da=[10F_(J1a+(1a)J2,)A_(J1a+(1a)J2,)da,10¯F(J1a+(1a)J2,)¯A(J1a+(1a)J2,)da]=[1J2J1J2J1F_(e,)A_(e,)de,1J2J1J2J1¯F(e,)¯A(e,de]=1J2J1J2J1F(e,)A(e,)deM(J1,J2)10H2(a,1a)da+N(J1,J2)10H(a,a)H(1a,1a)da.

    Thus, it follows

    1J2J1J2J1F(e,)A(e,)deM(J1,J2)10H2(a,1a)da+N(J1,J2)10H(a,a)H(1a,1a)da.

    Theorem is proved.

    Example 4.3. Let [J1,J2]=[0,1],h1(a)=a, h2(a)=1 for all a (0,1). If F,A:[J1,J2]IRI+ are defined as

    F(e,)=[e2,4ee]andA(e,)=[e,3e2].

    Then, we have

    1J2J1J2J1F(e,)A(e,)de=[14,356e3],M(J1,J2)10H2(a,1a)da=[13,172e3]

    and

    N(J1,J2)10H(a,a)H(1a,1a)da=[0,6e2].

    Since

    [14,356e3][13,527e6].

    Consequently, Theorem 4.3 is verified.

    Theorem 4.4. Suppose h1,h2:(0,1)R+ such that h1,h20. A mappings F,A:I×ΔR+I are (h1,h2)-convex stochastic process as well as mean square integrable for IVFS. For every J1,J2I, if FSPX((h1,h2),[J1,J2],R+I), ASPX((h1,h2),[J1,J2],R+I) and F,A IRI. Almost everywhere, the following inequality is satisfied

    12[H(12,12)]2F(J1+J22,)A(J1+J22,)1J2J1J2J1F(e,)A(e,)de+M(J1,J2)10H(a,a)H(1a,1a)da+N(J1,J2)10H2(a,1a)da.

    Proof. Since F,ASPX((h1,h2),[J1,J2],R+I), one has

    F(J1+J22,)H(12,12)F(J1a+(1a)J2,)+H(12,12)F(J1(1a)+aJ2,),A(J1+J22,)H(12,12)A(J1a+(1a)J2,)+H(12,12)A(J1(1a)+aJ2,). (4.8)
    F(J1+J22,)A(J1+J22,)[H(12,12)]2[F(J1a+(1a)J2,)A(J1a+(1a)J2,)+F(J1(1a)+aJ2,)A(J1(1a)+aJ2,)]+[H(12,12)]2[F(J1a+(1a)J2,)A(J1(1a)+aJ2,)+F(J1(1a)+aJ2,)A(J1a+(1a)J2,)][H(12,12)]2[F(J1a+(1a)J2,)A(J1a+(1a)J2,)+F(J1(1a)+aJ2,)A(J1(1a)+aJ2,)]+[H(12,12)]2[(h1(a)F(J1,)+h1(1a)F(J2,))(h2(1a)A(J1,)+h2(a)A(J2,))]+[(H(1a,a)A(f)+H(a,1a)A(g))(H(a,1a)A(f)+H(1a,a)A(g))][H(12,12)]2[F(J1a+(1a)J2,)A(J1a+(1a)J2,)+F(J1(1a)aJ2,)A(J1(1a)aJ2,)]+[H(12,12)]2[(2H(a,a)H(1a,1a))M(J1,J2)+(H2(a,1a)+H2(1a,a))N(J1,J2)]. Integration over (0,1) , we have10F(J1+J22,)A(J1+J22,)da=[10F_(J1+J22,)A_(J1+J22,)da,10¯F(J1+J22,)¯A(J1+J22,)da]2[H(12,12)]2[1J2J1J2J1F(e,)A(e,)de]+2[H(12,12)]2[M(J1,J2)10H(a,a)H(1a,1a)da+N(J1,J2)10H2(a,1a)da].Divide both sides by 12[H(12,12)]2 in above inclusion, we have 12[H(12,12)]2F(J1+J22,)A(J1+J22,)1J2J1J2J1F(e,)A(e,)de+M(J1,J2)10H(a,a)H(1a,1a)da+N(J1,J2)10H2(a,1a)da.

    Accordingly, the above theorem can be proved.

    Example 4.4. Recall the Example 4.3, we have

    12[H(12,12)]2F(J1+J22,)A(J1+J22,)=[14,4411e2],1J2J1J2J1F(e,)A(e,)de=[512,22712],M(J1,J2)10H2(a,1a)da=[13,172e3]

    and

    N(J1,J2)10H(a,a)H(1a,1a)da=[0,6e2].

    This implies

    [14,4411e2][512,41210e3].

    This verifies the above theorem.

    The following lemma aids in achieving our goal [56].

    Lemma 4.1. Consider F:I×ΔRR be a stochastic process that can be mean squared differentiated on the interior of an interval I. Likewise, if the derivative of F is mean square integrable, on [J1,J2], and J1,J2I, then this holds:

    F(b,)1J2J1J2J1F(a,)da=(bJ1)2J2J110sF(ab+(1a)J1,)da(J2b)2J2J110sF(ab+(1a)J2,)da,b[J1,J2].

    Theorem 4.5. Let h,h1,h2:(0,1)R are non-negative and multiplicative functions and ah(a) for each a(0,1). Let F:I×ΔRR+I be a stochastic process that can be mean squared differentiated on the interior of an interval I. Likewise, if the derivative of F is mean square integrable, on [J1,J2], and J1,J2I. If |F| is (h1,h2)-convex stochastic process for IVFS on I and satisfying |F(b,)|γ for each b, then

    D([F_(b,),¯F(b,)],[1J2J1J2J1F_(a,)da,1J2J1J2J1¯F(a,)da])=max{|F_(b,)1J2J1J2J1F_(a,)da|,|¯F(b,)1J2J1J2j1¯F(a,)da|}γ[(bJ1)2+(J2b)2]J2J110[h(a)H(a,1a)+h(a)H(1a,a)]da

    b[J1,J2].

    Proof. By Lemma 4.1, we have |F| is (h1,h2)-convex stochastic process for IVFS, then

    max{|F_(b,)1J2J1J2J1F_(a,)da|,|¯F(b,)1J2J1J2j1¯F(a,)da|}(bJ1)2J2J110a|F(ab+(1a)J1,)|ds+(J2b)2J2J110a|F(ab+(1a)J2,)|ds(bJ1)2J2J110a[h1(a)h2(1a)|F(b,)|+h1(1a)h2(a)|F(J1,),|]da+(J2b)2J2J110a[h1(a)h2(1a)|F(b,)|+h1(1a)h2(a)|F(J2,),|]daγ(bJ1)2J2J110[h(a)h1(a)h2(1a)+h(a)h1(1a)h2(a)]da+(J2b)2J2J110[h(a)h1(a)h2(1a)+h(a)h1(1a)h2(a)]daγ[(bJ1)2+(J2b)2]J2J110[h(a)h1(a)h2(1a)+h(a)h1(1a)h2(a)]da=γ[(bJ1)2+(J2b)2]J2J110[h(a)H(a,1a)+h(a)H(1a,a)]da.

    The proof is completed.

    Theorem 4.6. Let giR+. If h1,h2 are non-negative and multiplicative functions where F:I×ΔR+I is non-negative (h1,h2)-convex stochastic process for IVFS then this stochastic inclusion holds

    F(1Gddi=1giai,)di=1H(giGd,Gd1Gd)F(ai,), (4.9)

    where Gd=di=1gi.

    Proof. When d=2, then (4.9) detain. Assume that (4.9) is also word for d1, then

    F(1Gddi=1giai,)=F(gdGdad+d1i=1giGdai,)h1(gdGd)h2(Gd1Gd)F(ad,)+h1(Gd1Gd)h2(gdGd)F(d1i=1giGdai,)h1(gdGd)h2(Gd1Gd)F(ad,)+h1(Gd1Gd)h2(gdGd)d1i=1[H(giGd,Gd2Gd1)F(ai,)]h1(gdGd)h2(Gd1Gd)F(ad,)+d1i=1H(giGd,Gd2Gd1)F(ai,)di=1H(giGd,Gd1Gd)F(ai,).

    The conclusion is correct based on mathematical induction.

    In this article, the results of the h-convex stochastic process are extended from pseudo order to a more generalized class (h1,h2)-convex stochastic process with set inclusions for interval-valued functions. By utilizing this, we were able to develop Hermite-Hadamard, Ostrowski, and Jensen inequalities. Furthermore our main findings are verified by providing some examples that are not trivial. The results of our research can be applied in a variety of situations to provide a variety of new as well as well-known outcomes. Further refinements and improvements to previously published findings are provided in this paper. A future development of this study will enable its use in a variety of modes, including time scale calculus, coordinates, interval analysis, fractional calculus, quantum calculus, etc. This paper's style and current developments should pique readers' interest and encourage further research.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2023R8). Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

    The authors declare that they have no competing interests.



    [1] B. Patle, B. Ganesh, A. Pandey, D. Parhi, A. Jagadeesh, A review: On path planning strategies for navigation of mobile robot, Def. Technol., 15 (2019), 582–606. https://doi.org/10.1016/j.dt.2019.04.011 doi: 10.1016/j.dt.2019.04.011
    [2] N. Buniyamin, N. Sariff, W. Wan Ngah, Z. Mohamad, Robot global path planning overview and a variation of ant colony system algorithm, International Journal of Mathematics and Computers in Simulation, 5 (2011), 9–16.
    [3] S. Sasaki, A practical computational technique for mobile robot navigation, Proceedings of the IEEE International Conference on Control Applications, 1998, 1323–1327. https://doi.org/10.1109/CCA.1998.721675 doi: 10.1109/CCA.1998.721675
    [4] H. Chou, P. Kuo, J. Liu, Numerical streamline path planning based on log-space harmonic potential function: a simulation study, Proceedings of IEEE International Conference on Real-time Computing and Robotics, 2017,535–542. https://doi.org/10.1109/RCAR.2017.8311918 doi: 10.1109/RCAR.2017.8311918
    [5] Y. An, S. Wang, C. Xu, L. Xie, 3D path planning of quadrotor aerial robots using numerical optimization, Proceedings of the 32nd Chinese Control Conference, 2013, 2305–2310.
    [6] M. Silva, W. Silva, R. Romero, Performance analysis of path planning techniques based on potential fields, Proceedings of Latin American Robotics Symposium and Intelligent Robotics Meeting, 2010,115–119. https://doi.org/10.1109/LARS.2010.33 doi: 10.1109/LARS.2010.33
    [7] C. Connolly, R. Gruppen, The applications of harmonic functions to robotics, Journal of Robotic Systems, 10 (1993), 931–946. https://doi.org/10.1002/rob.4620100704 doi: 10.1002/rob.4620100704
    [8] O. Khatib, Real-time obstacle avoidance for manipulators and mobile robots, Proceedings of IEEE International Conference on Robotics and Automation, 1985,500–505. https://doi.org/10.1109/ROBOT.1985.1087247 doi: 10.1109/ROBOT.1985.1087247
    [9] H. Ghassemi, S. Panahi, A. Kohansal, Solving the Laplace's equation by the FDM and BEM using mixed boundary conditions, American Journal of Applied Mathematics and Statistics, 4 (2016), 37–42. https://doi.org/10.12691/ajams-4-2-2 doi: 10.12691/ajams-4-2-2
    [10] A. Dahalan, A. Saudi, Pathfinding algorithm based on rotated block AOR technique in structured environment, AIMS Mathematics, 7 (2022), 11529–11550. https://doi.org/10.3934/math.2022643 doi: 10.3934/math.2022643
    [11] K. Al-Khaled, Numerical solutions of the Laplace's equation, Appl. Math. Comput., 170 (2005), 1271–1283. https://doi.org/10.1016/j.amc.2005.01.018 doi: 10.1016/j.amc.2005.01.018
    [12] K. Shivaram, H. Jyothi, Finite element approach for numerical integration over family of eight node linear quadrilateral element for solving Laplace equation, Mater. Today: Proc., 46 (2021), 4336–4340. https://doi.org/10.1016/j.matpr.2021.03.437 doi: 10.1016/j.matpr.2021.03.437
    [13] C. Connolly, J. Burns, R. Weiss, Path planning using Laplace's equation, Proceedings of IEEE International Conference on Robotics and Automation, 1990, 2102–2106. https://doi.org/10.1109/ROBOT.1990.126315 doi: 10.1109/ROBOT.1990.126315
    [14] J. Barraquand, B. Langlois, J. Latombe, Numerical potential field techniques for robot path planning, IEEE T. Syst. Man. Cy., 22 (1992), 224–241. https://doi.org/10.1109/21.148426 doi: 10.1109/21.148426
    [15] M. Karnik, B. Dasgupta, V. Eswaran, A comparative study of Dirichlet and Neumann conditions for path planning through harmonic functions, In: Lecture notes in computer science, Berlin: Springer, 2002,442–451. https://doi.org/10.1007/3-540-46080-2_46
    [16] A. Abdullah, The four point explicit decoupled group (EDG) method: a fast Poison solver, Int. J. Comp. Math., 38 (1991), 61–70. https://doi.org/10.1080/00207169108803958 doi: 10.1080/00207169108803958
    [17] J. Sulaiman, M. Hassan, M. Othman, The half-sweep iterative alternating decomposition explicit (HSIADE) method for diffusion equation, In: Computational and information science, Berlin: Springer, 2004, 57–63. https://doi.org/10.1007/978-3-540-30497-5_10
    [18] A. Saudi, J. Sulaiman, Block iterative method for robot path planning, Proceedings of the 2nd Seminar on Engineering and Technology, 2009, 1–4.
    [19] A. Saudi, J. Sulaiman, Half-Sweep Gauss-Seidel (HSGS) iterative method for robot path planning, Proceedings of the 3rd International Conference on Informatics and Technology, 2009, 34–39.
    [20] A. Saudi, J. Sulaiman, Robot path planning using Laplacian Behaviour-Based Control (LBBC) via half-sweep SOR, Proceedings of the International Conference on Technological Advances in Electrical, Electronics and Computer Engineering, 2013,424–429. https://doi.org/10.1109/TAEECE.2013.6557312 doi: 10.1109/TAEECE.2013.6557312
    [21] S. Matsui, H. Nagahara, R. Taniguchi, Half-sweep imaging for depth from defocus, Image Vision Comput., 32 (2014), 954–964. https://doi.org/10.1016/j.imavis.2014.09.001 doi: 10.1016/j.imavis.2014.09.001
    [22] J. Chew, J. Sulaiman, A. Sunarto, Solving one-dimensional porous medium equation using unconditionally stable half-sweep finite difference and SOR method, Mathematics and Statistics, 9 (2021), 166–171. https://doi.org/10.13189/ms.2021.090211 doi: 10.13189/ms.2021.090211
    [23] F. Musli, J. Sulaiman, A. Saudi, Numerical simulations of agent navigation via half-sweep modified two-parameter over-relaxation (HSMTOR), Journal of Physics Conference Series, 1988 (2021), 012035. https://doi.org/10.1088/1742-6596/1988/1/012035 doi: 10.1088/1742-6596/1988/1/012035
    [24] A. Saudi, A. Dahalan, An efficient red-black skewed modified accelerated arithmetic mean iterative method for solving two-dimensional Poisson equation, Symmetry, 14 (2022), 993. https://doi.org/10.3390/sym14050993 doi: 10.3390/sym14050993
    [25] A. Dahalan, A. Saudi, Pathfinding algorithm based on rotated block AOR technique in structured environment, AIMS Mathematics, 7 (2022), 11529–11550. https://doi.org/10.3934/math.2022643 doi: 10.3934/math.2022643
    [26] M. Othman, A. Abdullah, An efficient four points modified explicit group Poisson solver, Int. J. Comput. Math., 76 (2000), 203–217. https://doi.org/10.1080/00207160008805020 doi: 10.1080/00207160008805020
    [27] D. Evans, Group explicit iterative methods for solving large linear systems, Int. J. Comput. Math., 17 (1985), 81–108. https://doi.org/10.1080/00207168508803452 doi: 10.1080/00207168508803452
    [28] G. Dahlquist, Å. Björck, Numerical Methods, New Jersey: Prentice Hall, 1974.
    [29] W. Yousif, D. Evans, Explicit group over-relaxation methods for solving elliptic partial differential equations, Math. Comput. Simulat., 28 (1986), 453–466. https://doi.org/10.1016/0378-4754(86)90040-6 doi: 10.1016/0378-4754(86)90040-6
    [30] D. Young, Iterative methods for solving partial difference equations of elliptic type, T. Am. Math. Soc., 76 (1954), 92–111. https://doi.org/10.2307/1990745 doi: 10.2307/1990745
    [31] D. Young, Iterative methods for solving partial difference equations of elliptic type, Ph. D. Thesis, Harvard University, 1950.
    [32] A. Hadjidimos, Accelerated overrelaxation method, Math. Comput., 32 (1978), 149–157. https://doi.org/10.2307/20006264 doi: 10.2307/20006264
    [33] J. Kuang, J. Ji, A survey of AOR and TOR methods, J. Comput. Appl. Math., 24 (1988), 3–12. https://doi.org/10.1016/0377-0427(88)90340-8 doi: 10.1016/0377-0427(88)90340-8
    [34] N. Ali, F. Pin, Modified explicit group AOR methods in the solution of elliptic equations, Applied Mathematical Sciences, 6 (2012), 2465–2480.
    [35] M. Martins, W. Yousif, D. Evans, Explicit group AOR method for solving elliptic partial differential equations, Neural, Parallel and Scientific Computations, 10 (2002), 411–422.
    [36] N. Ali, L. Chong, Group accelerated OverRelaxation methods on rotated grid, Appl. Math. Comput., 191 (2007), 533–542. https://doi.org/10.1016/j.amc.2007.02.131 doi: 10.1016/j.amc.2007.02.131
    [37] A. Saudi, Robot path planning using family of SOR iterative methods with Laplacian behavior-based control, Ph. D. Thesis, University Malaysia Sabah, 2015.
    [38] S. Chen, Collision-free path planning, Ph. D. Thesis, Iowa State University, 1997. https://doi.org/10.31274/rtd-180813-10480
    [39] J. Sanchez-Ibanez, C. Perez-del-Pulgar, A. Garcia-Cerezo, A path planning for autonomous mobile robots: a review, Sensors, 21 (2021), 7898. https://doi.org/10.3390/s21237898 doi: 10.3390/s21237898
    [40] T. Iwashita, M. Shimasaki, Block red-black ordering: a new ordering strategy for parallelization of ICCG method, Int. J. Parallel Prog., 31 (2003), 55–75. https://doi.org/10.1023/A:1021738303840 doi: 10.1023/A:1021738303840
    [41] N. Saad, A. Sunarto, A. Saudi, Accelerated red-black strategy for image composition using Laplacian operator, IJCDS, 10 (2021), 1085–1095. https://doi.org/10.12785/ijcds/100198 doi: 10.12785/ijcds/100198
    [42] A. Dahalan, A. Saudi, J. Sulaiman, Pathfinding for mobile robot navigation by exerting the quarter-sweep modified accelerated overrelaxation (QSMAOR) iterative approach via the Laplacian operator, Mod. Simul. Eng., 2022 (2022), 9388146. https://doi.org/10.1155/2022/9388146 doi: 10.1155/2022/9388146
  • This article has been cited by:

    1. Fei Yu, Yiya Wu, Xuqi Wang, Ting He, ShanKou Zhang, Jie Jin, New discrete memristive hyperchaotic map: modeling, dynamic analysis, and application in image encryption, 2025, 13, 2296-424X, 10.3389/fphy.2025.1617964
  • Reader Comments
  • © 2023 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(1889) PDF downloads(100) Cited by(1)

Figures and Tables

Figures(6)  /  Tables(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog