Asymptotic analysis of dichotomous search with search and travel costs

An object to be searched lies on [0,n]. The search starts from the left end of the interval. A query at a point finds out whether the object lies to the left or to the right of the point. The problem is to determine a sequence of queries that minimizes the expected sum of query (cQ per attempt) and travel (cT per unit distance) costs required to locate the object within an interval of unit length. This work develops simple approximate solutions to the problem and analyzes their performance.