On the linear cooperative search technique for a lost target with multiple searchers
Summary: We discuss the linear cooperative search model to detect a hidden and randomly located target on one of the \(n\)-intersected roads (real lines). The searching process starts from the origin with \(n\) searchers. Each one of these roads has one unit speed searcher. We get the expected value of the searching time until the \((n - 1)\) searchers return to the origin after the target has been detected by the other searcher. We obtain the optimal distances for these \(n\) searchers to get the optimal search strategy which minimises the expected time of return. An interesting case with numerical results is studied when the target's position has a truncated normal distribution.
- Coordinated search for an object hidden on the line
- 3-dimensional coordinated search technique for a randomly located target
- Existence of cooperative search technique to find a Brownian target
- Optimal distributed searching in the plane with and without uncertainty
- Optimal multiplicative Bayesian search for a lost target
- Searching for an Agent Who May OR May Not Want to be Found
- Coordinated search for a lost target on one of 2 intersecting lines
- Searching for the random walking microorganism cells
- Coordınated search for a randomly located target on the plane
- On the coordinated search problem
- On Reducing the Collision Time Between a Nanosensor and a Randomly Moving Particle in the Fluid
This page was built for publication: On the linear cooperative search technique for a lost target with multiple searchers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113815)