Abstract
A man in an automobile searches for another man who is located at some point of a certain road. He starts at a given point and knows in advance the probability that the second man is at any given point of the road. Since the man being sought might be in either direction from the starting point, the searcher will, in general, have to turn around many times before finding his target. How does he search so as to minimize the expected distance travelled? When can this minimum expectation actually be achieved? This paper answers the second of these questions.
Similar content being viewed by others
References
Franck Wallace,On the optimal search problem, Technical Report No. 44, University of New Mexico, October, 1963.
Author information
Authors and Affiliations
Additional information
The research work for this paper was supported by the National Science Foundation (under Grant No. GP 2559 to the University of Wisconsin) and the Wisconsin Alumni Research Foundation.
Rights and permissions
About this article
Cite this article
Beck, A. On the linear search problem. Israel J. Math. 2, 221–228 (1964). https://doi.org/10.1007/BF02759737
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02759737