title: Optimal foraging by zooplankton within patches: the case of Daphnia.
abstract: The motions of many physical particles as well as living creatures are mediated by random influences or 'noise'. One might expect that over evolutionary time scales internal random processes found in living systems display characteristics that maximize fitness. Here we focus on animal random search strategies [G.M. Viswanathan, S.V. Buldyrev, S. Havlin, M.G.E. Da Luz, E.P. Raposo, H.E. Stanley, Optimizing the success of random searches, Nature 401 (1999) 911-914; F. Bartumeus, J. Catalan, U.L. Fulco, M.L. Lyra, G.M. Viswanathan, Optimizing the encounter rate in biological interactions: Lévy versus Brownian stratagies, Phys. Rev. Lett. 88 (2002) 097901 and 89 (2002) 109902], and we describe experiments with the following Daphnia species: D. magna, D. galeata, D. lumholtzi, D. pulicaria, and D. pulex. We observe that the animals, while foraging for food, choose turning angles from distributions that can be described by exponential functions with a range of widths. This observation leads us to speculate and test the notion that this characteristic distribution of turning angles evolved in order to enhance survival. In the case of theoretical agents, some form of randomness is often introduced into search algorithms, especially when information regarding the sought object(s) is incomplete or even misleading. In the case of living animals, many studies have focused on search strategies that involve randomness [H.C. Berg, Random Walks in Biology, Princeton University, Princeton, New Jersey, 1993; A. Okubo, S.A. Levin (Eds.), Diffusion and Ecological Problems: Modern Perspectives, second ed., Springer, New York, 2001]. A simple theory based on stochastic differential equations of the motion backed up by a simulation shows that the collection of material (information, energy, food, supplies, etc.) by an agent executing Brownian-type hopping motions is optimized while foraging for a finite time in a supply patch of limited spatial size if the agent chooses turning angles taken from an exponential distribution with a specific stochastic intensity or 'noise width'. Search strategies that lead to optimization is a topic of high current interest across many disciplines [D. Wolpert, W. MacReady, No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation 1 (1997) 67].
authors.affiliation: Center for Neurodynamics, University of Missouri at St. Louis, St. Louis, MO 63121, USA.
authors.forename: Ricardo
authors.initials: R
authors.lastname: Garcia
authors.forename: Frank
authors.initials: F
authors.lastname: Moss
authors.forename: Ai
authors.initials: A
authors.lastname: Nihongi
authors.forename: J Rudi
authors.initials: JR
authors.lastname: Strickler
authors.forename: Sebastian
authors.initials: S
authors.lastname: Göller
authors.forename: Udo
authors.initials: U
authors.lastname: Erdmann
authors.forename: Lutz
authors.initials: L
authors.lastname: Schimansky-Geier
authors.forename: Igor M
authors.initials: IM
authors.lastname: Sokolov
mesh_terms: D000465:Algorithms; D000818:Animals; D005075:Biological Evolution; D003198:Computer Simulation; D003621:Daphnia / Q000033:anatomy & histology / Q000502:physiology*; D005247:Feeding Behavior / Q000502:physiology*; D008124:Locomotion; D008954:Models, Biological; D013045:Species Specificity; D015048:Zooplankton / Q000502:physiology*