Optimal random search for a single hidden target

Physics – Data Analysis – Statistics and Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 5 figures

Scientific paper

A single target is hidden at a location chosen from a predetermined probability distribution. Then, a searcher must find a second probability distribution from which random search points are sampled such that the target is found in the minimum number of trials. Here it will be shown that if the searcher must get very close to the target to find it, then the best search distribution is proportional to the square root of the target distribution. For a Gaussian target distribution, the optimum search distribution is approximately a Gaussian with a standard deviation that varies inversely with how close the searcher must be to the target to find it. For a network, where the searcher randomly samples nodes and looks for the fixed target along edges, the optimum is to either sample a node with probability proportional to the square root of the out degree plus one or not at all.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Optimal random search for a single hidden target does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal random search for a single hidden target, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal random search for a single hidden target will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-610560

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.