ABSTRACT
In the previous chapters, the trajectories of the searchers and foragers are obtained as a solution of certain optimization problem, and depend on the implemented constraints and assumptions. This chapter addresses the search and foraging in opposite direction: it starts with the class of trajectories, which are postulated as optimal, and then considers feasible models and algorithms, which result in such trajectories. The systematic considerations of such approach were initiated by Viswanathan et al. (1996), and during the last two decades, it was successfully applied in biological and ecological studies. The current chapter presents the ideas and methods that are used in this approach and considers their relation with the probabilistic algorithms of search and screening.
