Optimal Competitive Ratio for Linear Search with Unknown Target Speed

The main contribution of this paper is to prove new lower and upper bounds for the competitive ratio of linear search when the target's speed is unknown to the searcher, but the initial distance is either known or unknown.