Son of the linear search problem
I wish to find something which is located on a certain road. I start at a point on the road, but I do not know in which direction the object sought is to be found. Somehow, I must incorporate in my way of searching the possibility that it is either to the right or to the left. Thus, I must search first to the right, and then to the left, and then to the right again until it is found. What is a good way of conducting this search, and what is a bad way? This general problem can be phrased in many ways mathematically, some of which are answered in the papers in the bibliography. In this paper, we consider three well-known assumptions concerning the a priori guesses for the probability distribution on where the object is located. These concern uniform distribution on an interval, triangular distribution around the original point, and normal distribution about that point. The uniform distribution has a simple answer. For the triangular distribution, we obtain qualitative results and calculate approximate values for the turning points. For the normal distribution the theory of the search problem is developed and used to find a plausible approximation to the optimal turning points.
- The linear search problem rides again
- Star search -- a different show
- Generalizations in the linear search problem
- Dynamic programming and the backpacker's linear search problem
- The Chinese deliveryman problem
- On probabilistic modeling and feasibility of collision between a randomly moving meteor and satellite
- Searching symmetric networks with Utilitarian-Postman paths
- Linear search with bounded resources
- scientific article; zbMATH DE number 4053335 (Why is no real title available?)
- The Revenge of the Linear Search Problem
- Geometric probability models to analyze strategies for finding a buried cable
- On the minimality of search paths under absolutely continuous univariate distributions
- Searching for the random walking microorganism cells
- Search on the brink of chaos
- Lower bounds in on-line geometric searching
- Search on a Line by Byzantine Robots
- Online search with a hint
- Multiplicative linear search for a Brownian target motion
- Online search with a hint
- Optimal multiplicative generalized linear search plan for a discrete random walker
This page was built for publication: Son of the linear search problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266666)