Optimizing the Drift in a Diffusive Search for a Random Stationary Target
Ross G. Pinsky

TL;DR
This paper studies how to optimally set the drift in a diffusive search process to minimize the expected time to find a stationary target with a known distribution, providing explicit solutions under certain conditions.
Contribution
It derives explicit formulas for the optimal drift and expected search time for symmetric target distributions, and classifies measures where the minimum is attained.
Findings
Explicit optimal drift formulas for symmetric measures
Complete characterization of measures with attainable minimum
Partial results for non-symmetric measures
Abstract
Let denote an unknown stationary target with a known distribution , the space of probability measures on . A diffusive searcher sets out from the origin to locate the target. The time to locate the target is . The searcher has a given constant diffusion rate , but its drift can be set by the search designer from a natural admissible class of drifts. Thus, the diffusive searcher is a Markov process generated by the operator . % equivalently, satisfies the stochastic differential equation %, where is a standard Brownian motion. For a given drift , the expected time of the search is \begin{equation} \int_{\mathbb{R}} (E^{(b)}_0T_a)\thinspace\mu(da). \end{equation} Our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
