Skip to main content
SpringerLink
Log in

Optimal searching for a Helix target motion

  • Articles
  • Published:
Science China Mathematics Aims and scope Submit manuscript

Abstract

This paper discusses a search problem for a Helix target motion in which any information of the target position is not available to the searchers. There exist three searchers start searching for the target from the origin. The purpose of this paper is to formulate a search model and finds the conditions under which the expected value of the first meeting time between one of the searchers and the target is finite. Also, the existence of the optimal search plan that minimizes the expected value of the first meeting time is shown. Furthermore, this optimal search plan is found. The effectiveness of this method is illustrated by using an example with numerical results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Balkhi Z. Generalized optimal search paths for continuous univariate random variable. Oper Res, 1987, 23: 67–96

    MathSciNet  Google Scholar 

  2. Balkhi Z. The generalized linear search problem, existence of optimal search paths. J Oper Res Soc Japan, 1987, 30: 399–420

    MATH  MathSciNet  Google Scholar 

  3. Beck A, Beck M. The Revenge of the linear search problem. SIAM J Control Optim, 1992, 30: 112–122

    Article  MATH  MathSciNet  Google Scholar 

  4. Beltagy M, El-Hadidy M. Parabolic spiral search plan for a randomly located target in the plane. ISRN Math Anal, 2013, 2013: 151598, http://dx.doi.org/10.1155/2013/151598

    MathSciNet  Google Scholar 

  5. Benkoski S, Monticino M, Weisinger J. A survey of the search theory literature. Naval Res Logist, 1991, 38: 469–494

    Article  MATH  Google Scholar 

  6. Bourgault F, Furukawa T, Durrant-Whyte H. Coordinated decentralized search for a lost target in a bayesian world. Proc IEEE/RSJ Int Conf Intel Robot Sys, 2003, 1: 48–53

    Google Scholar 

  7. Bourgault F, Furukawa T, Durrant-Whyte H. Optimal search for a lost target in a Bayesian world. Field Serv Robot, 2006, 24: 209–222

    Article  Google Scholar 

  8. El-Hadidy M. Optimal spiral search plan for a randomly located target in the plane. Int J Oper Res, in press, 2013

    Google Scholar 

  9. El-Hadidy M, Abou-Gabal H. Optimal searching for a randomly located target in a bounded known region. Int J Comput Sci Math, in press, 2014

    Google Scholar 

  10. El-Rayes A, Mohamed A, Abou-Gabal H. Linear search for a brownian target motion. Acta Math Sci J Ser B, 2003, 23: 321–327

    MATH  MathSciNet  Google Scholar 

  11. Franck W. An optimal search problem. SIAM Rev, 1965, 7: 503–512

    Article  MATH  MathSciNet  Google Scholar 

  12. Gan S, Sukkarieh S. Multi-uav target search using explicit decentralized gradient-based negotiation. In: Proceeding IEEE International Conference on Robotics and Automation. New York: IEEE, 2011, 751–756

    Google Scholar 

  13. Hong S, Cho S, Park M, et al. Optimal search-relocation trade-off in markovian-target searching. Comp Oper Res, 2009, 36: 2097–2104

    Article  MATH  Google Scholar 

  14. Iida K. Studies on the Optimal Search Plan. New York: Springer-Verlag, 1992

    Book  MATH  Google Scholar 

  15. Inter America Tropical Tuna Commission. Annual Report. California: La Jolla, 1975, http://aquaticcommons.org/id/eprint/4996

    Google Scholar 

  16. Koopman B. Search and screening. OEG Report 56. Washington, DC: US Government Printing Office, 1946, http://www.dtic.mil/dtic/tr/fulltext/u2/214252.pdf.

    Google Scholar 

  17. Lanillos P, Besada-Portas E, Pajares G, et al. Minimum time search for lost targets using cross entropy optimization. In: IEEE/RSJ International Conference on Intelligent Robots and Systems. New York: IEEE, 2012, 602–609

    Google Scholar 

  18. Lukka M. On the Optimal Searching Tracks for A Stationary Target. Turku: University of Turku, 1974

    Google Scholar 

  19. Miller A, Moskowitz I. Generalizations of the carlton-kimball distribution for a target’s future location. Comput Math Appl, 1996, 31: 61–68

    Article  MATH  MathSciNet  Google Scholar 

  20. Mohamed A. The generalized search for one dimensional random walker. Int J Pure Appl Math, 2005, 19: 375–387

    MATH  MathSciNet  Google Scholar 

  21. 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: 97–111

    MATH  MathSciNet  Google Scholar 

  22. Mohamed A, El-Hadidy M. Coordinated search for a conditionally deterministic target motion in the plane. Eur J Math Sci, 2013, 2: 272–295

    Google Scholar 

  23. Mohamed A, El-Hadidy M. Existence of a periodic search strategy for a parabolic spiral target motion in the plane. Afrika Matematika J, 2013, 24: 145–160

    Article  MATH  MathSciNet  Google Scholar 

  24. Mohamed A, El-Hadidy M. Optimal multiplicative generalized linear search plan for a discrete random walker. J Optim, 2013, 2013: 706176

    Google Scholar 

  25. Mohamed A, Fergany H, El-Hadidy M. On the coordinated search problem on the plane. Istan Univ J Sch Busin Admin, 2012, 41: 80–102

    Google Scholar 

  26. Mohamed A, Kassem M, El-Hadidy M. Multiplicative linear search for a brownian target motion. Appl Math Model, 2011, 35: 4127–4139

    Article  MATH  MathSciNet  Google Scholar 

  27. Reyniers D. Coordinated two searchers for an object hidden on an interval. J Operational Res Soc, 1995, 46: 1386–1392

    Article  MATH  Google Scholar 

  28. Reyniers D. Coordinated search for an object on the line. Eur J Oper Res, 1996, 95: 663–670

    Article  MATH  Google Scholar 

  29. Sarmiento A, Murrieta-Cid R, Hutchinson S. An efficient motion strategy to compute expected-time locally optimal continuous search paths in known environments. Adv Robot, 2009, 23: 1533–1560

    Article  Google Scholar 

  30. Song N, Teneketizs D. Discrete search with multiple sensors. Math Meth Oper Res, 2004, 60: 1–13

    Article  MATH  Google Scholar 

  31. Stone L. Theory of Optimal Search. New York: Academic Press, 1975

    MATH  Google Scholar 

  32. Stone L. What is happened in search theory since the 1975 Lanchester prize? Oper Res, 1989, 37: 501–506

    Article  MathSciNet  Google Scholar 

  33. Stone L, Keller C, Kratzke T, et al. Search Analysis for the Location of the AF447 Underwater Wreckage. Metron: Report to BEA, 2011

    Google Scholar 

  34. Zhu Q, Oommen B. Estimation of distributions involving unobservable events: The case of optimal search with unknown target distributions. Pat Anal Appl, 2009, 12: 37–53

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Science, Tanta University, Tanta, 31527, Egypt

    Abd Allah El-Hadidy Mohamed

Authors
  1. Abd Allah El-Hadidy Mohamed
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abd Allah El-Hadidy Mohamed.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mohamed, A.A.EH. Optimal searching for a Helix target motion. Sci. China Math. 58, 749–762 (2015). https://doi.org/10.1007/s11425-014-4864-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11425-014-4864-5

Keywords

MSC(2010)

Search

Navigation