Providing immediate access to modern search theory, state-of-the-art methods, related areas of mathematics and their techniques, and applications, this important reference surveys classical results and approaches to search theory as well as the latest procedures of optimal and nearly optimal search planning for the most detailed and comprehensive source on the subject.

Search Theory clearly describes the solution of an optimal search problem with an exponential detection function...covers one-and two-sided detection problems by furnishing continuous and discrete time strategies...examines two-sided search strategies with solutions in "hide and seek" games in many discrete and continuous bounded and unbounded domanins...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.

David Chudnovsky is a Research Scientist in the Department of Mathematics at Columbia University in New York City, where he has served since 1978. Gregory V. Chudnovsky.