Optimal search paths for random variables

AbstractLet X be a real random variable, distributed according to some symmetric distribution F. A searcher starts at the origin and moves with an upper bound on his speed until he finds X. Which search path does he have to choose in order to minimize the expected searching time (or equivalently, to minimize the expected path length)? By means of numerical methods the solution is calculated for the normal, Student, logistic and Laplace distributions