486
Views
13
CrossRef citations to date
0
Altmetric
Research Articles

Existence of a finite multiplicative search plan with random distances and velocities to find a d-dimensional Brownian target

ORCID Icon & ORCID Icon
Pages 1035-1043 | Received 13 Dec 2018, Accepted 17 Sep 2019, Published online: 17 Oct 2019

Abstract

We present the existence of a finite search plan to find Brownian target on the d-space by using d-searchers. Each searcher moves continuously in both directions of the origin (starting point) of the line (field of its search) with random distances and velocities. We express theses distances and velocities with independent random variables with known probability density functions (PDFs). We present more analysis about the density of the random distances in our model by using Fourier–Laplace representation. This analysis will provide us with the conditions that make the expected value of the first meeting time between the target and one of the searchers finite.

Mathematics Subject Classifications:

1. Introduction

The searching techniques for a randomly moving target on the space has many applicabilitions in our life, for example, finding the charged particles in plasmas that move in the space with d-dimensional Brownian motion. In all searching techniques, the searchers move with known distances and velocities. If the search space is a line, then the searcher aims to detect the target in the right or left part of the starting point, where the searcher can change its direction without losing any time. Most of the techniques that have been studied for the line deal with deterministic distances and velocities, see [Citation1–7]. On the plane, Mohamed and El-Hadidy [Citation8, Citation9] and El-Hadidy [Citation10] presented more interesting search strategies with deterministic distance and regular fixed velocity to find the two-dimensional randomly moving targets. On the space, El-Hadidy and colleagues [Citation11–16] studied different techniques with deterministic distances and velocities by using multiple searchers. The main objective of these earlier works is to obtain the conditions that make the first meeting time between one of the searchers and the moving target finite. On the other hand, when the target is located, some earlier works discussed many different search strategies with deterministic distances and velocities to find this target in minimum time on the line, plane and space , such as [Citation17–25].

In this work, we need to find the condition that makes the expected value of the first meeting time between one of the d searchers and the d-dimensional Brownian target finite. We consider that the searchers have a nonstop random motion with random distances and velocities where there are no restrictions on the searcher's movement. We use the Fourier–Laplace transform to give an analytical expression for the random distance density functions that the searchers should do them with random velocities.

This paper is organized as follows. Section 1 gives an analytical expression for the density of random distances and velocities. In Section 2, we describe the searching problem based on this analytical expression. The condition that shows the existence of our search strategy is discussed in Section 3. Finally, the paper concludes with a discussion of the results.

2. Formulation of the model

We consider that the searching process starts from the origin of the d-space by d-searchers. These searchers move continuously along d-line. Each searcher moves in both directions of its origin. On the line Li,i=1,2,,d, we consider the searcher Si,i=1,2,,d has the following strategy: start at hi0=0 to cut a random distance hi1 with a certain random velocity vi on the left (right) part of Li. After that, turn back to hi0 and go a distance hi2 to search the other right (left) part of hi0. Retrace the steps again to search the left (right) part of hi1 as far as hi3 and so on. Now, the searcher changes the direction and magnitude of its velocity (this velocity can have positive as well as negative values to include the direction of searcher motion) to another random point with random distance h~i and continues the search for another random distance. For our model, we assume gi(vi) and fi(hi),i=1,2,,d, to be Probability Densities Functions (PDFs) of the basic and independent random distances and the velocities variables, respectively. Each one of these PDFs is normalized to one, where + gi(vi)dvi=1,0+fi(hi)dhi=1 and gi(vi)=gi(vi) (the velocity distribution is symmetric) for all i=1,2,,d, then there is no bias in the search model. In our model, we let the searcher Si changes its direction on Li at the random points yi as in Figure . Let li0(yi),i=1,2,,d, be the PDFs for the initial distribution of the searchers at the random points y1,y2,,yd, respectively, then we aim to determine the evolution of the density functions li(yi,hi),i=1,2,,d, of the locations for the searchers Si,i=1,2,,d, respectively.

Figure 1. The search strategy φ(t) for meeting a d-dimensional Brownian target.

Figure 1. The search strategy φ(t) for meeting a d-dimensional Brownian target.

At time t, let PDFs ςi(yi,hi),i=1,2,,d, represent the changes of the searchers' velocities at the position [yi,yi+dyi] and refer to it as the frequency of velocity changes: (1) ςi(yi,hi)=+0hiςi(yivit,hih~i)gi(vi)fi(h~i)×dh~idvi+li0(yi)δi(hi).(1) After doing the random distance h~i at time t, each searcher Si changes its velocity vi at the point (yi,hi), distance hih~i and position yivit. In addition, we let gi(vi)fi(h~i) to be the probability density function of a certain velocity vi. Thus, we can integrate the first term on the right-hand side of (Equation1), over all these events. In the last term of (Equation1), li0(yi,hi0=0)=li0(yi), and the velocities are changed at hi0=0, then δi(t) will become an impulse function. By using the changes in the frequencies of the velocities, we can express li(yi,hi) with the following: (2) li(yi,hi)=+0hiςi(yivit,hih~i)×gi(vi)f´i(h~i)dh~idvi,(2) where f´i(h~i)=10h~ifi(h~i/)dh~i/ is the PDF of nonchange velocity until the distance h~i. As a result of velocities changes, ςi(yivit,hih~i). f´i(h~i) shows that Si does not choose another velocity before passing the point (yi,hi). Now, the motion of Si on the line Li with a given initial density and the two PDFs for the distances and velocities is described by Equations (Equation1) and (Equation2) which can be solved analytically. Hence, we aim to find the frequency of velocity changes ςi(yi,hi) and then substitute with result (Equation2).

According to the shift property of the Fourier transformation and by applying it with respect to the spatial coordinate in (Equation1), we get the factor ejkvih~i, j=1, appears under the integral. If we integrate with respect to vi, then we get the Fourier transformation of gi(vi) with a reciprocal velocity kh~i. The Fourier transformation of (Equation1) can be given by (3) ςik(hi)=0hiςi(hih~i)gikh~ifi(h~i)dh~idvi+li0,kδi(hi),(3) (see [Citation26]) where the indices k and kh~i denote the Fourier components. Now, by applying the Laplace transformation with respect to t and by using convolution property, we get (4) ςik,L=ςik,Lgikh~ifi(h~i)L+li0,k,(4) where L[δi(hi)]=1,i=1,2,,n, and L denotes the Laplace component. Thus, the frequency velocity changes in the Fourier–Laplace domain, ςik,L, is given by (5) ςik,L=li0,k1gikh~ifi(h~i)L.(5) By the same method, the Fourier–Laplace transformation of the two equations (Equation2) and (Equation5) together gives: (6) lik,L=gikh~if´i(h~i)Lli0,k1gikh~ifi(h~i)L.(6) As in [Citation27], the Fourier–Laplace representation of the exponential functions is more suitable to get our analytical expression. Thus, by using the spatial coordinate in (Equation1), our analytical expression for Si,i=1,2,,n, densities gi(vi) and fi(hi) (nonnegative locally integrable functions on R) with random distances and velocities is sufficient to prove the existence of finiteness for these kinds of search strategies.

2.1. The searching problem

We consider a d-dimensional Brownian target that moves in Rd with families of independent random variables (B1(t),B2(t),,Bd(t)), t0. These independent processes have a drift vector [μ1,μ2,,μd] and a covariance matrix Σ that is a diagonal matrix with only non-zero σi2, i=1,2,,d. The initial position of the target has a known probability distribution.

Let φ(t)=(φ1(t),φ2(t),,φn(t)) be a combination of vectors of continuous functions, where φi(t)=[φi1(t),φi2(t),,φid(t)] with random speed vi, and it is given by φi(t):Rd+R, i=1,2,,d. These functions are considered as the search strategies of the d-searchers Si, i=1,2,,d, where (7) φi(t1)φi(t2)<ςik,Lt1t2for all t1,t2R+,φi(0)=0 and i=1,2,,d.(7) Let τφR+ be a random variable which represents the first meeting time between one of the searchers and the target. It is defined by τφ=inf{t:either one of φi(t)=X0+B(t), i=1,2,,n},,if the set is empty, where X0=[X10,X20,,Xd0] is a vector of random variables that is independent of B(t)=(B1(t),B2(t),,Bd(t)), t0 and represents the initial position of the target in Rd. For each searcher Si,i=1,2,,d, we consider the set of all search strategies that satisfies (Equation7) and with a speed (Equation5) be φςik,L(t). We seek for the condition that gives finiteness of the expected value of τφ (i.e. Eτφ<), where φ(t)Φ(t) (is the class of all of search strategies) and Φ(t)={φ(t);φ(t)Φςik,L(t)}.

3. Existence of finiteness

At time t on the line Li, the searcher Si will become at the random point yij after cutting the distance hij,i=1,2,,d;j=i,2, (see Figure ). Thus, we define the sequences: {Gij}i=1,2,,d;j0 and {hij}i=1,2,,d;j0 such that hij=(1)j+1ci[Gij+1+(1)j+1] and (Equation11) satisfied, where ci is constant (>0), Gij=λi(θij1) and θij>1, λi>0. By using (Equation6), we can get the expected value of the random distance hij as follows: (8) E(hij)=0Gijh~ilik,Ldh~i.(8) By using (Equation5), we obtain (9) E(vi)=+viςik,Ldvi.(9) Consequently, from (Equation8) and (Equation9), the expected value of the searching time to search hij is (10) E(Tij)0Gijh~ilik,Ldh~i+viςik,Ldvi.(10) When (11) 0Gijh~ilik,Ldh~i+viςik,Ldvit0Gi(j+1)h~ilik,Ldh~i+viςik,Ldvi,(11) for all tR+, we have φi(t)=hij+(1)j[tGij], where hij is different from one searcher to another. There are very large numbers of events such that the first meeting between one of the searchers and the target may be done on the space. Now, we should turn into a new space called a probability space. Let the random variables that represent the target position are defined on a probability space (Ω,,γ), where Ω is the set of all possible meeting points, is the sigma algebra on these points and the location of the target at any time can be described by the probability measure γ. The following theorems contribute to the achievement of an existential search strategies. They help us to minimize Eτφ.

Theorem 3.1

Let φ(t)=(φ1(t),φ2(t),,φn(t)) be a combination of vectors of continuous functions, where φi(t)=[φi1(t),φi2(t),,φid(t)] with random speed vi. Then Eτφ is finite if (12) i=1dj=0u=1d0p(ψi(uE(Ti(2j1)))>xiju)γ(dxiju)+0p(ψ~i(uE(Ti(2j)))<xiju)γ(dxiju)(12) is finite.

Proof.

For each line Li,i=1,2,,d, if we consider ψ~i(E(T2ij))=Bi(E(T2ij))+ciE(T2ij), ψi(E(Ti(2j+1)))=Bi(E(Ti(2j+1)))ciE(Ti(2j+1)) and apply the same method in [Citation28], then we have Bi(E(T2ij))0G2ijh~ilik,Ldh~i+viςik,Ldvi<X0j=xij, then Bi(E(T2ij))(1)2j+1ci[E(T2ij)+1+(1)2j+1]<xiju. This gives Bi(E(T2ij))+ci[E(T2ij)+1+(1)2j+1]=Bi(E(T2ij))+ci[E(T2ij)]+ci[1+(1)2j+1]=ψ~i(E(T2ij))<(xiju+ci[1+(1)2j+1]), then ψ~i(E(T2ij))<xiju. By the same method and by using the notation ψi(E(Ti(2j+1)))=Bi(E(Ti(2j+1)))ciE(Ti(2j+1)), we obtain ψi(E(T2i(j+1)))>xiju.

Since the events τφi>t, i=1,2,,d, are mutually exclusive events, then p(τφ>t)=p(τφ1>t or τφ2>t or ···  or τφn>t)=i=1np(τφi>t). Thus, for any i=1,2,,d and j=1,2,, we get p(τφ>E(Ti(2j+1)))000p(ψ1(1E(Ti(2j+1)))>xij1,ψ2(2E(Ti(2j+1)))>xij2),,ψd(dE(Ti(2j+1)))>xijd)γ(dxij1)γ(dxij2)γ(dxijd)+000p(ψ1(1E(Ti(2j+1)))>xij1,ψ2(2E(Ti(2j+1)))>xij2),,ψ~d(dE(Ti(2j)))<xijd)γ(dxij1)γ(dxij2)γ(dxijd)+000p(ψ1(1E(Ti(2j+1)))>xij1,ψ~2(2E(Ti(2j)))<xij2),,ψ~d(dE(Ti(2j)))<xid)γ(dxij1)γ(dxij2)γ(dxijd)++000p(ψ~1(1E(Ti(2j)))<xij1,ψ~2(2E(Ti(2j)))<xij2,,ψd(dE(Ti(2j+1)))>xijd)γ(dxij1)γ(dxij2)γ(dxijd)+000p(ψ~1(1E(Ti(2j)))<xij1,ψ2(2E(Ti(2j+1)))>xij2,,ψd(dE(Ti(2j+1)))>xijd)γ(dxij1)γ(dxij2)γ(dxijd)++000p(ψ~1(1E(Ti(2j)))<xij1,ψ~2(2E(Ti(2j)))<xij2,,ψ~d(dE(Ti(2j)))<xijd)γ(dxij1)γ(dxij2)γ(dxijd), also, p(τφ>Gi(2j))000p(ψ1(1E(Ti(2j1)))>xij1,ψ2(2E(Ti(2j1)))>xij2),,ψd(dE(Ti(2j1)))>xijd)γ(dxij1)γ(dxij2)γ(dxijd)+000p(ψ1(1E(Ti(2j1)))>xij1,ψi2(2E(Ti(2j1)))>xij2),,ψ~d(dE(Ti(2j)))<xijd)γ(dxij1)γ(dxij2)γ(dxijd)+000p(ψ1(1E(Ti(2j1)))>xij1,ψ~2(2E(Ti(2j)))<xij2),,ψ~d(dE(Ti(2j)))<xijd)γ(dxij1)γ(dxij2)γ(dxijd)++000p(ψ~1(1E(Ti(2j)))<xij1,ψ~2(2(Ti(2j)))<xij2,,ψd(dE(Ti(2j1)))>xijd)γ(dxij1)γ(dxij2)γ(dxijd)+000p(ψ~1(1E(Ti(2j)))<xij1,ψ2(2E(Ti(2j1))>xij2,,ψd(dE(Ti(2j1)))>xijd)γ(dxij1)γ(dxij2)γ(dxijd)++000p(ψ1(1E(Ti(2j1)))<xij1,ψ2(2E(Ti(2j1)))<xij2,,ψd(dE(Ti(2j1)))<xijd)γ(dxij1)×γ(dxij2)γ(dxijd). Therefore, Eτφ is given by E(τφ)=0p(τφ>t)dtj=01E(T1j)1E(T1(j+1))2E(T1j)2E(T1(j+1))dE(T1j)dE(T1(j+1))×p(τφ11>t,τφ12>t,,τφ1d>t)×dtdtdt++j=01E(Tdj)1E(Td(j+1)2E(Tdj)2E(Td(j+1)dE(Tdj)dE(Td(j+1)×p(τφd1>t,τφd2>t,,τφdd>t)×dtdtdt.j=01E(T1j)1E(T1(j+1))2E(T1j)2E(T1(j+1))dE(T1j)dE(T1(j+1))×p(τφ11>E(T1j),τφ12>E(T1j),,τφ1d>E(T1j))dtdtdt++j=01E(Tdj)1E(Td(j+1)2E(Tdj)2E(Td(j+1)dE(Tdj)dE(Td(j+1)×p(τφd1>E(Tj),τφd2>E(Tdj),,τφdd>E(Tdj))dtdtdt. Since τφi1,τφi2,,τφid are independent events, then we get E(τφ)i=1dj=0u=1duE(Tij)uE(Ti(j+1))p(τφiu>t)dti=1dj=0u=1duE(Tij)uE(Ti(j+1))p(τφiu>uE(Tij))dt=i=1dj=0u=1d(uE(Ti(j+1))uE(Tij))p(τφiu>uE(Tij))i=1dj=0u=1d×0uGi(j+1)h~ilik,Ldh~i0uGijh~ilik,Ldh~i+viςik,Ldvi×pτφiu>0uGijh~ilik,Ldh~i+viςik,Ldvidt=i=1du=1d+viςik,Ldvi1×0uGi1h~ilik,Ldh~i{p(τφiu>0)}+0uGi2h~ilik,Ldh~i0uGi1h~ilik,Ldh~i×0p(ψ~i(uE(Ti1))>xi1u)γ(dxiu)+0p(ψi(uE(Ti2))<xi2u)γ(dxi1u)+0uG3ih~ilik,Ldh~i0uG2ih~ilik,Ldh~i×0p(ψ~i(uE(Ti3))>xi3u)γ(dxi3u)+0p(ψi(uE(Ti4))<xi4u)γ(dxi4u)+0uGi4h~ilik,Ldh~i0uGi3h~ilik,Ldh~i×0p(ψ~(uE(Ti5))>xi5u)γ(dxi5u)+0p(ψ(uE(Ti6))<xi6u)γ(dxi6u)+0uGi5h~ilik,Ldh~i0uGi4h~ilik,Ldh~i×0p(ψ~(uE(Ti7))>xi7u)γ(dxi7u)+0p(ψ(uE(Ti8))<xi8u)γ(dxi8u)+. Assuming Ai(h~i)=h~ilik,Ldh~i leads to Eτφi=1du=1d+viςik,Ldvi1×[(Ai(uGi1)Ai(0)){p(τφiu>0)}+(Ai(uGi2)Ai(uGi1))×0p(ψ~i(uE(Ti1))>xi1u)γ(dxi1u)+0p(ψi(uE(Ti2))<xi2u)γ(dxi2u)+(Ai(uGi3)Ai(uGi2))×0p(ψ~i(uE(Ti3))>xi3u)γ(dxi3u)+0p(ψi(uE(Ti4))<xi4u)γ(dxi4u)+(Ai(uGi4)Ai(uGi3))×0p(ψ~i(uE(Ti5))>xi5u)γ(dxi5u)+0p(ψi(uE(Ti6))<xi6u)γ(dxi6u)+(Ai(uGi5)Ai(uGi4))×0p(ψ~i(uE(Ti7))>xi7u)γ(dxi7u)+0p(ψi(uE(Ti8))<xi8u)γ(dxi8u)+]+. Consequently, at any time t, if the searcher speed is finite and Ai(uGij)=0uGijh~ilik,Ldh~i,i=1,2,,d;j=1,2,, then Eτφ is finite if i=1dj=0u=1d0p(ψi(uE(Ti(2j1)))>xiju)γ(dxiju)+0p(ψ~i(uE(Ti(2j)))<xiju)γ(dxiju) is finite.

Example 3.1

Let the target moves from a random point on the real line Li with a Brownian motion. Eτφ has an approximated value that depends on hi. If we choose θi1=1.5, θi2=2, ci=1 and λi=2, then Gi1=1 and Gi1=2. Also, we consider hi,vi have a standard normal distribution with mean 0 and variance σ2. Then, by using (Equation6) the expected value of the random distances of the searcher (around the origin of Li) with no changes of its velocity until the distance h~i are given from (Equation8) by E(hi1)=0Gi1h~ilik,Ldh~i=01h~ilik,Ldh~i and E(hi2)=(vesign)0Gi2h~ilik,Ldh~i=(vesign)02h~ilik,Ldh~i, respectively. Consequently, from (Equation5) and (Equation10) one can get the expected value of the searching times to search hi1, hi2 by E(Ti1)01h~ilik,Ldh~i+viςik,LdviandE(Ti2)02h~ilik,Ldh~i+viςik,Ldvi, respectively. One can get, the Fourier–Laplace representation of lik,L and ςik,L by using the standard normal density function of hi and vi [Citation27] to get the values of E(hi1),E(hi2),E(Ti1) and E(Ti2). Using these results in (Equation12), we can get Eτφ when j = 1, 2 and d = 1.

To show the finiteness of our search model, we present the following theorem which gives the conditions that make (Equation12) finite.

Theorem 3.2

The search strategies of all searchers should satisfy: (13) B1j1(x1j1)B1d(x1jd)B2j1(x2j1)B2jd(x2jd)Bdj1(xdj1)Bdjd(xdjd)Ξ1j1x1j1Ξ1dx1jdΞ2j1x2j1Ξ2jdx2jdΞdj1xdj1Ξdjdxdjd,(13) and (14) Z1j1(x1j1)Z1jd(x1jd)Z2j1(x2j1)Z2jd(x2jd)Zdj1(xdj1)Zdjd(xdjd)Λ1j1x1j1Λ1jdx1jdΛ2j1x2j1Λ2jdx2jdΛdj1xnj1Λdjdxnjd,(14) where Ξiju(|xiju|),Λiu(|xiju|),i,u=1,2,,d are linear functions.

Proof.

At time t, when the position of the target xiu0, u=1,2,,d, we have B1j1(x1j1)B1jd(x1jd)B2j1(x2j1)B2jd(x2jd)Bdj1(xdj1)Bdjd(xdjd)B1j1(0)B1jd(0)B2j1(0)B2jd(0)Bdj1(0)Bdjd(0), but when xiju>0, we have B1j1(0)B1jd(0)B2j1(0)B2jd(0)Bdj1(0)Bdjd(0)=j=1p(ψ1(1E(T1(2j1)))>0)j=1p(ψ2(1E(T1(2j1)))>0)j=1p(ψd(1E(T1(2j1)))>0)j=1p(ψ1(dE(T1(2j1)))>0)j=1p(ψ2(dE(T1(2j1)))>0)j=1p(ψd(dE(T1(2j1)))>0), and B1j1(x1j1)B1jd(x1jd)B2j1(x2j1)B2jd(x2jd)Bdj1(xdj1)Bdjd(xdjd)=j=1p(ψ1(1E(T1(2j1)))>x1j1)j=1p(ψ2(1E(T2(2j1)))>x2j1)j=1p(ψd(1E(Td(2j1)))>xdj1)j=1p(ψ1(dE(T1(2j1)))>x1jd)j=1p(ψ2(dE(T2(2j1)))>x2jd)j=1p(ψd(dE(Td(2j1)))>xdjd). Thus, B1j1(x1j1)B1jd(x1jd)B2j1(x2j1)B2jd(x2jd)Bdj1(xdj1)Bdjd(xdjd)=B1j1(0)B1jd(0)B2j1(0)B2jd(0)Bdj1(0)Bdjd(0)+j=1p(x1j1<ψ1(1E(T1(2j1)))0)j=1p(x2j1<ψ2(1E(T2(2j1)))0)j=1p(xdj1<ψd(1E(Td(2j1)))0)j=1p(x1jd<ψ1(dE(T1(2j1)))0)j=1p(x2jd<ψ2(dE(T2(2j1)))0)j=1p(xdjd<ψd(dE(Td(2j1)))0) At any t>0,0<εiu<1, there exist [c1,c2,,cd][μ1,μ2,,μd], where [μ1,μ2,,μd] is the drift vector of B(t)=(B1(t),B2(t),,Bd(t)) and [c1,c2,,cd] is vector of constants. One can get p(Bi(t)cit)=p(σiutXi+μitcit)=pXi(ciμi)tσiut=ξi12πexiju2/2dxiju12εiutp(ψi(t)0)12εiut, where ψi(t)=Bi(t)cit. Therefore, B1j1(0)B1jd(0)B2j1(0)B2jd(0)Bdj1(0)Bdjd(0)j=1ε111G1(2j1)j=1ε1ddG1(2j1)j=1ε211G2(2j1)j=1ε2ddG2(2j1)j=1εd11Gd(2j1)j=1εdddGd(2j1). For each line Li,i=1,2,,d, we let ψi(d)=j=1dXiju, where {Xiju}i,u=1,,d;j0 is a sequence of independent and identically distributed random variables and XijuN(μici,σiu2). In addition, if μi0, xi1u>ix2u and tmax(xi1u/μi,xi2u/μi), then p(xi2uBi(t)xi1u) is non-increasing with t, see [Citation4]. Consequently, let ridu=uGi(2d1),u=1,2,,d, then by putting xi1u=0 and xi1u=xiu, we have ridu=max(0,xi1u/μi). Also, let ai(mi)=p(xiu<ψi(d)0)=j=0[|xiu|]p((j+1)<ψi(d)j) and Ui(j,j+1)=d=0p((j+1)<ψi(d)j). Then, B1j1(x1j1)B1jd(x1jd)B2j1(x2j1)B2jd(x2jd)Bdj1(xdj1)Bdjd(xdjd)B1j1(0)B1jd(0)B2j1(0)B2jd(0)Bdj1(0)Bdjd(0)=d=1m1q1(r1d1)d=1m1q1(r1dd)d=1m2q2(r2d1)d=1m2q2(r2dd)d=1mdqd(rdd1)d=1mdqd(rddd)+d=m1+1(r1d1r1(d1)1)q1(r1d1)d=m1+1(r2d1r2(d1)1)q2(r2d1)d=m1+1(rdd1rd(d1)1)qd(rdd1)d=m1+1(r1ddr1(d1)d)q1(r1dd)d=m1+1(r2ddr2(d1)d)q2(r2dd)d=m1+1(rdddrd(d1)d)qd(rddd) d=r1m11m1q1(d)d=r1mddmdq1(d)d=r2m11m2q2(d)d=r2mddmdq2(d)d=rdm11mdqd(d)d=rdmddmdqd(d)r1m11+j=0[|x11|]U1(j,j+1)r2m11+j=0[|x21|]U2(j,j+1)rdm11+j=0[|xd1|]Ud(j,j+1)r1mdd+j=0[|x1d|]U1(j,j+1)r2mdd+j=0[|x2d|]U2(j,j+1)rdmdd+j=0[|xdd|]Ud(j,j+1), where Ui(j,j+1),i=1,2,,d satisfy the renewal theorem conditions, see [Citation29]. This leads to the bounded of Ui(j,j+1) for all i=1,2,,d and j=1,2,. Thus, B1j1(x1j1)B1d(x1jd)B2j1(x2j1)B2jd(x2jd)Bdj1(xdj1)Bdjd(xdjd)Ξ1j1(|x1j1|)Ξ1d(|x1jd|)Ξ2j1(|x2j1|)Ξ2jd(|x2jd|)Ξdj1(|xdj1|)Ξdjd(|xdjd|). By similar way, we can prove that Z1j1(x1j1)Z1jd(x1jd)Z2j1(x2j1)Z2jd(x2jd)Zdj1(xdj1)Zdjd(xdjd)Λ1j1(|x1j1|)Λ1jd(|x1jd|)Λ2j1(|x2j1|)Λ2jd(|x2jd|)Λdj1(|xnj1|)Λdjd(|xnjd|).

4. Conclusion and future works

We use the Fourier–Laplace transform to give an analytical expression for the random distance density functions which the searchers should do them with random velocities to find a d-dimensional Brownian target. The initial target position is given by a vector of independent random variables X0=[X10,X20,,Xd0]. The search space is considered as a set of d non-intersected real lines in d-space. We showed the existence of a finite search strategy by doing some analytical expressions to use it in proving Eτφ<, where Eτφ is the expected value of the first meeting time. Theorem 3.1 gives the condition which is sufficient to prove this existentialism. In addition, Theorem 3.2 provided more analysis to show that the φ(t)=(φ1(t),φ2(t),,φn(t)) (which is a combination of vectors of continuous functions where φi(t)=[φi1(t),φi2(t),,φid(t)], with random speed vi,i=1,2,,d) is finite if conditions (Equation13) and (Equation14) are held.

In future work, we can extend this model as a generalized model with dependent random distance and velocities with d-searchers to find a combination of d-dimensional Brownian moving targets.

Disclosure statement

No potential conflict of interest was reported by the authors.

ORCID

Mohamed Abd Allah El-Hadidy http://orcid.org/0000-0002-9407-9586

Alaa Awad Alzulaibani http://orcid.org/0000-0003-3742-8003

References

  • Fristedt B, Heath D. Searching for a particle on the real line. Adv Appl Prob. 1974;6(1):79–102. doi: 10.2307/1426208
  • El-Hadidy M, Abou-Gabal H. Coordinated search for a random walk target motion. Fluct Noise Lett. 2018;17(1):1850002 (11 pages). doi: 10.1142/S0219477518500025
  • El-Hadidy M, Abou-Gabal H. Searching for the random walking microorganism cells. Int J Biomath. 2019;12(6):1950064 (12 pages). doi: 10.1142/S1793524519500645
  • El-Rayes A, Mohamed A, Abou Gabal H. Linear search for a Brownian target motion. Acta Math Sci J. 2003;23B(3):321–327. doi: 10.1016/S0252-9602(17)30338-7
  • El-Hadidy M. Studying the finiteness of the first meeting time between Lévy flight jump and Brownian particles in the fluid reactive anomalous transport. Mod Phys Lett B. 2019;33(22):1950256 (8 pages). doi: 10.1142/S0217984919502567
  • El-Hadidy M, Alzulaibani A. Cooperative search model for finding a Brownian target on the real line. J Taibah Univ Sci. 2019;13(1):177–183. doi: 10.1080/16583655.2018.1552493
  • El-Hadidy M, Alzulaibani A. A mathematical model for preventing HIV virus from proliferating inside CD4 T Brownian cell using Gaussian jump nanorobot. Int J Biomath. 2019;12(7):1950076 (24 pages).
  • Mohamed A, El-Hadidy M. Existence of a periodic search strategy for a parabolic spiral target motion in the plane. Afrika Mat J. 2013;24(2):145–160. doi: 10.1007/s13370-011-0049-3
  • Mohamed A, El-Hadidy M. Coordinated search for a conditionally deterministic target motion in the plane. Eur J Math Sci. 2013;2(3):272–295.
  • El-Hadidy MA. Existence of finite parbolic spiral search plan for a Brownian target. Int J Oper Res. 2018;31(3):368–383. doi: 10.1504/IJOR.2018.10010400
  • Mohamed A, Kassem M, El-Hadidy M. Multiplicative linear search for a Brownian target motion. Appl Math Model. 2011;35(9):4127–4139. doi: 10.1016/j.apm.2011.03.024
  • Mohamed A, El-Hadidy M. Optimal multiplicative generalized linear search plan for a discrete random walker. J Optim. 2013;2013:706176 ( 13 pages). DOI:10.1155/2013/706176
  • El-Hadidy M. Optimal searching for a helix target motion. Sci China Math. 2015;58(4):749–762. doi: 10.1007/s11425-014-4864-5
  • El-Hadidy M. Fuzzy optimal search plan for n-dimensional randomly moving target. Int J Comput Methods. 2016;13(6):1650038 (38 pages). doi: 10.1142/S0219876216500389
  • El-Hadidy M. Study on the three players' linear rendezvous search problem. Int J Oper Res. 2018;33(3):297–314. doi: 10.1504/IJOR.2018.10016675
  • El-Hadidy M. Generalised linear search plan for a d-dimensional random walk target. Int J Math Oper Res. 2019;15(2):211–241. doi: 10.1504/IJMOR.2019.10022970
  • Reyniers D. Coordinated search for an object on the line. Eur J Oper Res. 1996;95(3):663–670. doi: 10.1016/S0377-2217(96)00314-1
  • Balkhi Z. The generalized linear search problem, existence of optimal search paths. J Oper Res Soc Japan. 1987;30(4):399–420.
  • Ohsumi A. Optimal search for a Markovian target. Nav Res Log. 1991;38(4):531–554. doi: 10.1002/1520-6750(199108)38:4<531::AID-NAV3220380407>3.0.CO;2-L
  • Kassem M, El-Hadidy M. Optimal multiplicative Bayesian search for a lost target. Appl Math Comput. 2014;247:795–802.
  • Mohamed A, Abou Gabal H, El-Hadidy M. Coordinated search for a randomly located target on the plane. Eur J Pure Appl Math. 2009;2(3):97–111.
  • El-Hadidy M. Optimal spiral search plan for a randomly located target in the plane. Int J Oper Res. 2015;22(4):454–465. doi: 10.1504/IJOR.2015.068561
  • El-Hadidy M, Abou-Gabal H. Optimal searching for a randomly located target in a bounded known region. Int J Comput Sci Math. 2015;6(4):392–403. doi: 10.1504/IJCSM.2015.071811
  • El-Hadidy M. On maximum discounted effort reward search problem. Asia-Pac J Oper Res. 2016;33(3):1650019 (30 pages). doi: 10.1142/S0217595916500196
  • Mohamed A, Abou-Gabal H, El-Hadidy M. Random search in a bounded area. Int J Math Oper Res. 2017;10(2):137–149. doi: 10.1504/IJMOR.2017.081921
  • Gradshteyn I, Ryzhik I. Table of integrals, series, and products. 8th ed. Translated from the Russian by Scripta Technica, Inc. New York (NY): Academic Press; 2014.
  • Musin I. On the Fourier-Laplace representation of analytic functions in tube domains. Collect Math. 1994;45(3):301–308.
  • El-Hadidy M. Searching for a d-dimensional Brownian target with multiple sensors. Int J Math Oper Res. 2016;9(3):279–301. doi: 10.1504/IJMOR.2016.10000114
  • Feller W. An introduction to probability theory and its applications. 2nd ed. New York (NY): Wiley; 1966.