ABSTRACT
Starting from initial works by Dorfman (1943) and Koopman (1946), the theory of search addresses a problem how to organize an optimal process of search or testing. The main interest of this theory is a distribution of search efforts given a probability distribution of the target’s location in a certain domain (Hellman, 1985; Stone, 1975; Washburn, 1989). In the case of moving target, the theory also deals with the trajectories of the searcher over a domain (Hellman, 1985; Kagan & Ben-Gal, 2013). This chapter presents formal methods and algorithms of the search and screening theory both in continuous and in discrete time and space.
