On the solution of an optimal search problem with an exponential detection function. Covers one- and two-sided detection problems by furnishing continuous and discret time strategies; examines two-sided search strategies with solutions in "hide and seek" games in many discrete and continuous bounded and unbounded domains; presents a consistent framework for solving complex problems in a unified way by differential equations; discusses systematic means of generating tours for optimal search in bounded domains; and considers a novel class of random search plans. Annotation copyright Book News, Inc. Portland, Or.
On the solution of an optimal search problem with an exponential detection function. Covers one- and two-sided detection problems by furnishing continuous and discret time strategies; examines two-sided search strategies with solutions in hide and seek games in many discrete and continuous bounded
Search Theory. A Review of Results in Optimal Search For Moving Targets. Continuous Search Games. Search Theory: A Differential Equations Approach. Search Plans Generated By Billiards. Uniformly Ergodic Search In A Disk.
David Chudnovsky is a Research Scientist in the Department of Mathematics at Columbia University in New York City, where he has served since 1978.