Research Article  Open Access
Mohamed Beltagy, Mohamed Abd Allah ElHadidy, "Parabolic Spiral Search Plan for a Randomly Located Target in the Plane", International Scholarly Research Notices, vol. 2013, Article ID 151598, 8 pages, 2013. https://doi.org/10.1155/2013/151598
Parabolic Spiral Search Plan for a Randomly Located Target in the Plane
Abstract
This paper addresses the problem of searching for a located target in the plane by using one searcher starting its motion from the point . The searcher moves along parabolic spiral curve. The position of the target has a known distribution. We show that the distance between the target position and the searcher starting point depends on the number of revolutions, where the complete revolution is done when . Furthermore, we study this technique in the onedimensional case (i.e., when the searcher moves with linear search technique). It is desired to get the expected value of the time for detecting the target. Illustrative examples are given to demonstrate the applicability of this technique assuming circular normal distributed estimates of the target position.
1. Introduction
Search problem dates back to World War II, and the works of Koopman [1–3] and Stone [5, 6] offer a classic treatise of this area from an operational research perspective. Many variants and extensions of this problem, in a wide variety of directions, have been presented in both the statistical and operations research literature since Koopman [1] solved this problem for the unidimensional case. This problem has been discussed under some specific hypotheses by Richardson [4]. However, as pointed out by Koopman [2, 3], there is so much complexity in real search and rescue missions that any statistical model can only reflect part of the reallife situation and ours are no exception. On search theory in general, Stone [5] has given a good account of various results presently available, with some informative examples, and also has provided a rigorous mathematical treatment of the subject, for both discrete and continuous cases. On the other hand, Stone [6] provided an overview of different areas in the development of search theory, which could be designated as classical, mathematical, algorithmic, and dynamic. Also, exhaustive surveys of works realized on this topic have been given by Iida [7] and Benkoski et al. [8].
Studying of searching problem in the plane had found considerable interest among researchers due to its wide applications in our life. Feinerman et al. [9] introduced some search trajectories to find the desert Ants Nearby Treasure. They used multiple searchers without communication between them in the plane. Edelsbrunner and Maurer [10] obtained the optimal solutions for the postoffice problem. The certain point location problems in two dimensions are derived via geometric transforms from an optimal solution for the search problem in three dimensions: find the first point hit by a rotating or sweeping plane. Mohamed et al. [11, 12] obtained more interesting search plans that give the minimum expected value of the cost for detecting the lost target. This problem has been discussed when the located target has symmetric and asymmetric distributions and with less information available to the searchers. In both papers, they desired to minimize the expected time for detecting the target. ElHadidy [13] introduced a new search plan in the plane which is divided into identical cells and the searcher moves along spiral with line segment curve. He found the optimal value of the arcs that the searcher should do and finds the target with minimum cost. Also, Mohamed and ElHadidy [14] discussed the existence of the search plan that finds the conditionally deterministic target motion. They have shown the existence of the optimal search plan and found the necessary conditions that make the expected value of the first meeting time finite. When the target starts its motion as parabolic spiral from a random point in the plane, Mohamed and ElHadidy [15] studied this problem such that no time information about the target’s position is available to the searcher. The searcher starts its motion from the origin. They formulated a search model and found the conditions that make this search plan finite. Recently, ElHadidy [16] formulated another search model for a helix target motion in the space by using a team of three searchers. He studied the existence of the optimal search plan and found it.
In this paper, the search for a randomly located target in the plane by a single searcher is studied. The target's position is unknown, but the searcher knows its probability distribution. The searcher moves along parabolic spiral curve as in Figure 1, starting its motion from the point (). Furthermore, we study this technique in the onedimensional case (i.e., when the searcher moves with linear search technique but here the searcher moves with speed depending on time). This problem is more effective and more applicable to realworld search scenarios such as searching for underwater target by firing with 91RTE2 missile system; see website http://www.youtube.com/watch?v=EgQkFEGVY and also the electrons movement in a cyclotron under the influence of a constant magnetic field. The purpose here is to obtain the expected value of the time for detecting the target, assuming circular normal distributed estimates of its position.
This paper is organized as follows. In Section 2 we formulate the problem. The expected value of the time is given when the target position has circular normal distribution in Section 3. Onedimensional case that rides to the generalized linear search problem is discussed in Section 4. Finally, the paper concludes with a discussion of the results and directions for future research.
2. Modeling of Search Problem and Formulation
Here, assumptions of a parabolic spiral search plan for a randomly located target are described and the problem is mathematically formulated as an allocation of searching effort which is the expected value of the time for detecting the target.
Let be two independent random variables that represent the position of the target. The searcher is assumed to move according to the model [17] where is the starting point of the searcher and , where is the set of real numbers. Equations (1) show that the searcher moves along parabolic spiral curve as in Figure 1.
The searching process is continuous time and continuous space. We consider that the searcher will make a complete revolution when returns the axis; see Figure 1. At time , the searcher moves along a circle with centre and radius given by
From (1) we have
Thus, the speed of the searcher will be given as
It is clear that the speed will vanish at only, and depends on . We obtain the time that the searcher will take to detect the target in a complete revolution by considering that the searcher path will intersect the line at time , where is the slope of the line and is the absolute constant. Using (1) we get , but at we have then . Consequently, , but at we have , (i.e., the complete revolutions will be done at the time values ).
In addition, the area that the searcher will search through making the complete revolution is given in the following.
After time , in the first revolution the searcher will arrive to the point and make an angle with axis; see Figure 2.
(a)
(b)
With the previous understanding of using polar coordinates, the area that is done by the first revolution is given by , where is the probability density function of the target position. And the area between the first and second revolution is given by . Similarly, the area between the ()th and th revolution is given by .
In this work, the search space is a standard Euclidean space with points designated by ordered pairs . We aim now to evaluate , that is, the expected value of the time for detecting the target.
Theorem 1. If the searcher moves along a parabolic spiral curve starting its motion from random point , then the expected value of detecting the target is given by
Proof. From our hypothesis we can see that
If we consider that the target has been detected after revolutions, , then we have It is noticed from (7) that depends on . Hence, there exists a relationship between the random distance (the distance between the target position and the searcher starting point ) and the number of revolutions .
Theorem 2. Assume that the searcher made complete revolutions; then (the distance from to the searcher) is given by ; is a natural number.
Proof. The jump in the first revolution is given by and the jump in the second revolution is given by . In addition, the jump in the last revolution is given by . Then, the distance from to the searcher is given by
3. The Case of a Target Position Given by Circular Normal Distribution
Stone et al. [18] studied more interesting problem; that is, on June 2009, an Airbus 330–200 with 228 passengers and crew of the Air France Flight 447 is disappeared over the South Atlantic during a night flight from Rio de Janeiro to Paris. An international air and surface search effort recovered the first wreckage on June 6 five and one half days after the accident. More than 1000 pieces of the aircraft and 50 bodies were recovered and their positions logged. A French submarine as well as French and American research teams searched acoustically for the underwater locator beacons on each of the two flight recorder's (black boxes) for 30 days from June 10 to July 10, 2009, with no results. They described this problem and analyzed the results of this analysis. The analysis shows that all impact points are contained within a 20 nautical mile radius circle from the point at which the emergency situation began. The results of this analysis are represented by a second distribution which is circular normal with center at the last known position. One of the important advantages of circular normal distribution is that they are sensitive to shifts in the centering of the searching process.
Thus, we assume that the position of the target has a bivariate normal distribution with parameters and . Let give the initial target’s actual position. Then is normally distributed with mean and standard deviation . In addition, is independent of , which is normally distributed with mean and standard deviation . Let be the probability density function of the bivariate normal distribution, where denotes a standard Euclidean 2space. Thus, the distribution of error in the navigation system yields as given in (10) for the density of the target distribution. If , then (9) becomes and the target distribution is called circular normal. Consequently, (7) becomes Using Mathematica 7 programme, we get where gives the exponential integral function.
Example 3. Suppose that the target position (black boxes, etc.) follows the circular normal distribution with probability density function (10). For many values of and , we get the expected value of the time for detecting the target as in Table 1.
It appears from numerical calculations that the value of has small increments with decreasing the value of the parameter as in Figure 3.
Naturally, and depend on the target position. This means that does not depend only on but also depends on , where from Theorem 2 we have .

(a)
(b)
4. OneDimensional Case
In onedimensional case, the searcher moves with the model This model is produced from the projection of model (1) on axis; that is, . Consequently, the speed of the searcher will be given as At , we have , which leads to , . We choose only positive values of . From (13), the parabolic spiral search will ride to the linear search problem. The method of linear search is an important methodology to find a lost target on the real line. The position of the target is represented by the random variable where has a probability density function . The searcher moves continuously along the real line in both directions of the starting point . The searcher would conduct his search in the following manner (see Figure 4): start at and go to the left (right) as far as . Then, turn back to explore the right (left) part of as far as . Retrace the steps again to explore the left (right) part of as far as , and so forth.
The searcher starts from any point on the real line with uniform velocity and tries to find the target in minimal expected time. It is assumed that the searcher can change the direction of its motion without any loss of time. The target can be detected only if the searcher reaches the target. This problem has been studied extensively in many variations, mostly by A. Beck and M. Beck [19, 20], Reyniers [21, 22], and Balkhi [23, 24]. On the other hand, when the target moves on the real line according to a known random process, the searcher moves continuously along the line in both directions of the starting point until the target is met. In an earlier work, this problem has been studied by Mohamed [25], ElRayes et al. [26], Washburn [27], and Stone [28]. Recently, Mohamed et al. [29, 30] discussed this problem when the target moves randomly on one of real lines. They formulated a search model and found the conditions under which the expected value of the first meeting time between one of the searchers and the target is finite. Furthermore, they have shown the existence of the optimal search plan that minimized the expected value of the first meeting time and found it.
The problem studied here is more applicable than the linear search problem because the speed of the searcher depends on as in (14). Equations (11) and (12) show that the searcher moves on the line with the linear search technique as in Figure 5.
In this case, to get the time values of the turning points as in Figure 4, we let and we use the numerical method to solve the system For simplicity, let . Thus, the roots of this system are the intersection points of the line and the equation as in Figure 6.
Figure 6 gives an illustration of the roots (the time of the turning points) through the time interval . From (14) the distances that the searcher does through the times , are given by
Now, we can easily obtain the expected value of the time for detecting the target, where the target position has known distribution.
Theorem 4. If the target location has known distribution with probability density function , then the expected value of the time for detecting the target is given by
Proof. If the target lies in , then , and if it lies in , then . Also, if the target lies in , then and if it lies in then , and so forth. Consequently, we have
Example 5. Let the previous illustrative Example 3 and make a projection on axis, then (10) becomes
In addition, we let the target be detected through the time interval ; then by using Figure 6 and (16) we can get the time values of the turning points and its corresponding distances as in Table 2.
For many values of we can get the values of as in Table 3.
It is clear that from numerical calculations the value of increases with increasing the value of the parameter as in Figure 7.


5. Conclusion and Future Work
A parabolic spiral search plan for a randomly located target in the plane has been presented, where the target position is given by independent random variables , . We get the expected value of the time for detecting the target in Theorem 1. In Theorem 2, we show that the distance between the target position and the searcher starting point depends on the number of revolutions, where the complete revolution is done when .
To study this problem in onedimensional case, we make a projection of the searcher path on axis. We find that the case of onedimension of this problem rides to the generalized linear search problem. In Theorem 4, we can easily get the expected value of the time for detecting the target after knowing the values of the turning points, where the target position is given by a random variable . The effectiveness of this technique is illustrated using numerical examples assuming circular normal distributed estimates of the target position.
In future research, it seems that the proposed model will be extendible to the multiple searchers case by considering the combinations of movement of multiple targets.
References
 B. O. Koopman, “The theory of search—III. The optimum distribution of search effort,” Operations Research, vol. 5, pp. 613–626, 1957. View at: Google Scholar  MathSciNet
 B. O. Koopman, “Search and its optimization,” The American Mathematical Monthly, vol. 86, no. 7, pp. 527–540, 1979. View at: Publisher Site  Google Scholar  MathSciNet
 B. O. Koopman, “An operational critique of detection laws,” Operations Research, vol. 27, no. 1, pp. 115–133, 1979. View at: Publisher Site  Google Scholar  MathSciNet
 H. Richardson, “Search theory,” in Encyclopedia of Statistics, N. Johnson and S. Kotz, Eds., vol. 19, pp. 320–315, 1984. View at: Google Scholar
 L. Stone, Theory of Optimal Search, Military Applications Section, Operation Research Society of America, Arlington, Va, USA, 2nd edition, 1989.
 L. D. Stone, “What's happened in search theory since the 1975 Lanchester Prize?” Operations Research, vol. 37, no. 3, pp. 501–506, 1989. View at: Publisher Site  Google Scholar  MathSciNet
 K. Iida, Studies on the Optimal Search Plan, vol. 70 of Lecture Notes in Statistics, Springer, New York, NY, USA, 1992. View at: Publisher Site  MathSciNet
 S. Benkoski, M. Monticino, and J. Weisinger, “A survey of the search theory literature,” Naval Research Logistics, vol. 38, pp. 469–494, 1991. View at: Google Scholar
 O. Feinerman, A. Korman, Z. Lotker, and J. Sereni, “Collaborative search on the plane without communication,” in Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC '12), pp. 77–86, ACM, New York, NY, USA, 2012. View at: Google Scholar
 H. Edelsbrunner and H. A. Maurer, “Finding extreme points in three dimensions and solving the postoffice problem in the plane,” Information Processing Letters, vol. 21, no. 1, pp. 39–47, 1985. View at: Publisher Site  Google Scholar  MathSciNet
 A. Mohamed, H. Abou Gabal, and M. ElHadidy, “Coordinated search for a randomly located target on the plane,” European Journal of Pure and Applied Mathematics, vol. 2, no. 1, pp. 97–111, 2009. View at: Google Scholar  MathSciNet
 A. Mohamed, H. Fergany, and M. ElHadidy, “On the coordinated search problem on the plane,” Istanbul University Journal of the School of Business Administration, vol. 41, pp. 80–102, 2012. View at: Google Scholar
 M. ElHadidy, “Optimal spiral search plan for a randomly located target in the plane,” International Journal of Operational Research, 2013. View at: Google Scholar
 A. Mohamed and M. ElHadidy, “Coordinated search for a conditionally deterministic target motion in the plane,” European Journal of Mathematical Sciences, vol. 2, no. 3, pp. 272–295, 2013. View at: Google Scholar
 A. Mohamed and M. ElHadidy, “Existence of a periodic search strategy for a parabolic spiral target motion in the plane,” Afrika Matematika, vol. 24, no. 2, pp. 145–160, 2013. View at: Publisher Site  Google Scholar  MathSciNet
 M. ElHadidy, “Optimal searching for a helix target motion,” submitted for publication. View at: Google Scholar
 Mathematische Basteleien, “Spirals,” http://www.mathematischebasteleien.de/spiral.htm. View at: Google Scholar
 L. Stone, C. Keller, T. Kratzke, and J. Strumpfer, Search Analysis for the Location of the AF447 Underwater Wreckage, METRON, report to BEA, 2011.
 A. Beck and M. Beck, “The linear search problem rides again,” Israel Journal of Mathematics, vol. 53, no. 3, pp. 365–372, 1986. View at: Publisher Site  Google Scholar  MathSciNet
 A. Beck and M. Beck, “The revenge of the linear search problem,” SIAM Journal on Control and Optimization, vol. 30, no. 1, pp. 112–122, 1992. View at: Publisher Site  Google Scholar  MathSciNet
 D. J. Reyniers, “Coordinated search for an object hidden on the line,” European Journal of Operational Research, vol. 95, no. 3, pp. 663–670, 1996. View at: Publisher Site  Google Scholar
 D. J. Reyniers, “Coordinating two searchers for an object hidden on an interval,” Journal of the Operational Research Society, vol. 46, no. 11, pp. 1386–1392, 1995. View at: Google Scholar
 Z. T. Balkhi, “The generalized linear search problem, existence of optimal search paths,” Journal of the Operations Research Society of Japan, vol. 30, no. 4, pp. 399–421, 1987. View at: Google Scholar  MathSciNet
 Z. T. Balkhi, “Generalized optimal search paths for continuous univariate random variables,” Operations Research, vol. 23, no. 1, pp. 67–96, 1987. View at: Google Scholar  MathSciNet
 A. Mohamed, “The generalized search for one dimensional random Walker,” International Journal of Pure and Applied Mathematics, vol. 19, no. 3, pp. 375–387, 2005. View at: Google Scholar  MathSciNet
 A. B. ElRayes, A. M. Abd ElMoneim, and H. M. Abou Gabal, “Linear search for a Brownian target motion,” Acta Mathematica Scientia B, vol. 23, no. 3, pp. 321–327, 2003. View at: Google Scholar  MathSciNet
 A. R. Washburn, Search and Detection, Postgraduate School, Monterey, Calif, USA, 2nd edition, 1989.
 L. D. Stone, Theory of Optimal Search, Academic Press, New York, NY, USA, 1975. View at: MathSciNet
 A. Mohamed, M. Kassem, and M. ElHadidy, “Multiplicative linear search for a Brownian target motion,” Applied Mathematical Modelling, vol. 35, no. 9, pp. 4127–4239, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 A. Mohamed and M. ElHadidy, “Optimal multiplicative generalized linear search Plan for a discrete random walker,” Journal of Optimization, vol. 2013, Article ID 706176, 13 pages, 2013. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2013 Mohamed Beltagy and Mohamed Abd Allah ElHadidy. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.