![](/images/graphics-bg.png)
Optimal Multiplicative Generalized Linear Search Plan for a Discrete Random Walker
Joint Authors
Mohamed, Abd-Elmoneim Anwar
El-Hadidy, Mohamed Abd Allah
Source
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-13, 13 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-07-30
Country of Publication
Egypt
No. of Pages
13
Main Subjects
Abstract EN
This paper formulates a search model that gives the optimal search plan for the problem of finding a discrete random walk target in minimum time.
The target moves through one of n-disjoint real lines in ℝn: we have n-searchers starting the searching process for the target from any point rather than the origin.
We find the conditions that make the expected value of the first meeting time between one of the searchers and the target finite.
Furthermore, we show the existence of the optimal search plan that minimizes the expected value of the first meeting time and find it.
The effectiveness of this model is illustrated using numerical example.
American Psychological Association (APA)
Mohamed, Abd-Elmoneim Anwar& El-Hadidy, Mohamed Abd Allah. 2013. Optimal Multiplicative Generalized Linear Search Plan for a Discrete Random Walker. Journal of Optimization،Vol. 2013, no. 2013, pp.1-13.
https://search.emarefa.net/detail/BIM-492077
Modern Language Association (MLA)
Mohamed, Abd-Elmoneim Anwar& El-Hadidy, Mohamed Abd Allah. Optimal Multiplicative Generalized Linear Search Plan for a Discrete Random Walker. Journal of Optimization No. 2013 (2013), pp.1-13.
https://search.emarefa.net/detail/BIM-492077
American Medical Association (AMA)
Mohamed, Abd-Elmoneim Anwar& El-Hadidy, Mohamed Abd Allah. Optimal Multiplicative Generalized Linear Search Plan for a Discrete Random Walker. Journal of Optimization. 2013. Vol. 2013, no. 2013, pp.1-13.
https://search.emarefa.net/detail/BIM-492077
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-492077