Skip to main content
Log in

Optimization of brownian search strategies

  • Published:
Biological Cybernetics Aims and scope Submit manuscript

Abstract

What are the simplest search strategies that lead an animal to a particular target, what are their limitations, and what changes can be made to develop more effective strategies? To answer these question a class of search strategies was examined that require an animal to have only a minimal capacity for spatial orientation; the effectiveness of such strategies in solving the following basic search problem was determined. The animal begins its search at a distance r o (starting distance) from a spatially fixed target. It detects the target when it has approached it to within a certain distance a (the detection radius). The analysed class of search strategies has the following characteristics: C1. The animal uses the same search strategy in all regions it enters. Therefore it needs no information as to the actual location of the target. C2. Its search strategy is constant in time. The animal has only to detect whether it has reached the target or not. C3. Once the animal has chosen a direction, it continues in that direction for a certain distance. This is the only way in which the preceding parts of the search affect the animal's decision as to the direction in which it will search next. In the long term the animal's movement directions are independent, with no preference for any particular direction. Despite their extreme simplicity in application these “Brownian” search strategies are remarkably successful (Fig. 1). Indeed, if the search is continued long enough the target is certain to be found. The success of the search depends in part on the search duration (Fig. 2) or the search-path length S, the starting distance and the detection radius. On the other hand, an animal can have a decisive influence on its degree of success simply by adjusting the frequency with which it changes its walking direction to match its sensory abilities. That is, a not-too-short Brownian search (S≫r o) is most successful when the searching animal, between the points at which it changes direction, walks approximately straight for a distance equal to the detection radius (Figs. 3 and 4). A further increase in search effectiveness is possible only by turning to another class of search strategies. These, however, demand that the animal either have more information about the position of its target at the beginning of the search or be able to organize its search behavior even over fairly long periods of time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Ahlswede, R., Wegener I.: Suchprobleme. Stuttgart: Teubner 1979

    Google Scholar 

  • Bänsch, R.: Vergleichende Untersuchungen zur Biologie und zum Beutefangverhalten aphidivorer Coccineliden, Chrysopiden und Syrphiden. Zool. Jahrb. Abt. Syst. Oekol. 91, 271–340 (1964)

    Google Scholar 

  • Banks, C.J.: The behaviour of individual coccinellid larvae on plants. Brit. J. Anim. Behav. 5, 12–24 (1957)

    Google Scholar 

  • Barber, M.N., Ninham, B.W.: Random and restricted walks. Theory and applications. New York, London, Paris: Gordon and Breach 1970

    Google Scholar 

  • Berg, H.C., Brown, D.A.: Chemotaxis in Escherichia coli analysed by three-dimensional tracking. Nature (London) 239, 500–504 (1972)

    Google Scholar 

  • Biethahn, J., Offe, G.: Ergebnisse der Anwendung verschiedener Tests auf bestehende Zufallszahlengeneratoren. Angew. Inf. 10/76, 419–428 (1976)

    Google Scholar 

  • Carslaw, H.S., Jaeger, J.C.: Conduction of heat in solids. Oxford: Oxford University Press 1959

    Google Scholar 

  • Chandler, A.E.F.: Locomotory behaviour of first instar larvae of aphidophagous Syrphidae (Diptera) after contact with aphids. Anim. Behav. 17, 673–678 (1969)

    Google Scholar 

  • Chandrasekhar, S.: Stochastic problems in physics and astronomy. Rev. Mod. Phys. 15, 1–89 (1943)

    Google Scholar 

  • Cody, M.L.: Finch flocks in the Mohave desert. Theor. Popul. Biol. 2, 142–158 (1971)

    Google Scholar 

  • Fleming, W.H., Rishel, R.W.: Deterministic and stochastic optimal control. In: Applications of mathematics, Vol 1. Berlin, Heidelberg, New York: Springer (1975)

    Google Scholar 

  • Gerritsen, J., Strickler, J.R.: Encounter probabilities and community structure in zooplankton: a mathematical model. J. Fish. Res. Board Can. 34, 73–82 (1977)

    Google Scholar 

  • Hoffmann, G.: Experimentelle und theoretische Analyse eines adaptiven Orientierungsverhaltens: Die „optimale” Suche der Wüstenassel Hemilepistus reaumuri, Audouin und Savigny (Crustacea, Isopoda, Oniscoidea) nach ihrer Höhle. PhD thesis, Regensburg 1978

  • Hoffmann, G.: The random elements in the systematic search behavior of the desert isopod Hemilepistus reaumuri. Behav. Ecol. Sociobiol. 13, 81–92 (1983a)

    Google Scholar 

  • Hoffmann, G.: Search behavior of the desert isopod Hemilepistus reaumuri as compared with a systematic search. Behav. Ecol. Sociobiol. 13, 93–106 (1983b)

    Google Scholar 

  • Jaeger, J.C.: Heat flow in the region bounded internally by a circular cylinder. Proc. Rl. Soc. Edinburgh, A.: Math. Phys. 61, 223–228 (1942)

    Google Scholar 

  • Jaeger, J.C.: Numerical values for the temperature in radial heat flow. J. Math. Phys. 34, 316–321 (1955)

    Google Scholar 

  • Laing, J.: Host finding by insect parasites. II. The chance of Trichogramma evanescens finding its hosts. J. Exp. Biol. 15, 281–302 (1938)

    Google Scholar 

  • Lüneburg, R.: Das Problem der Irrfahrt ohne Richtungsbeschränkung und die Randwertaufgabe der Potentialtheorie. Math. Ann. 104, 700–738 (1931)

    Google Scholar 

  • Mandelbrot, B.B.: The fractal geometry of nature. San Francisco: Freeman 1982

    Google Scholar 

  • Moran, P.A.P.: The statistical distribution of the length of a rubber molecule. Proc. Camb. Philos. Soc. 44, 342–344 (1948)

    Google Scholar 

  • Paloheimo, J.E.: On a theory of search. Biometrika 58, 61–75 (1971)

    Google Scholar 

  • Patlak, C.S.: Random walk with persistence and external bias. Bull. Math. Biophys. 15, 311–338 (1953)

    Google Scholar 

  • Polya, G.: Über eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die Irrfahrt im Straßennetz. Math. Ann. 84, 149–160 (1921)

    Google Scholar 

  • Rogers, D.J.: Random search and insect population models. J. Anim. Ecol. 41, 369–383 (1972)

    Google Scholar 

  • Siniff, D.B., Jesson, C.R.: A simulation model of animal movement patterns. In: Advances in ecological research, Vol. 6, Cragg, J.B. (ed.). New York: Academic Press 1969, pp. 185–219

    Google Scholar 

  • Smith, J.N.M.: The food searching behaviour of two european thrushes. I. Description and analysis of the search paths. Behaviour 48, 276–302 (1974)

    Google Scholar 

  • Stanley, J.: A mathematical theory of the growth of populations of the flour beetle Tribolium confusum Duv. Can. J. Res. 6, 632–671 (1932)

    Google Scholar 

  • Stone, L.D.: Theory of optimal search. New York, San Francisco, London: Academic Press 1975

    Google Scholar 

  • Tchen, C.M.: Random flight with multiple partial correlations. J. Chem. Phys. 20, 214–217 (1952)

    Google Scholar 

  • Varley, G.C.: On the search for hosts and the egg distribution of some chalcid parasits of the knapweed gall-fly. Parasitology 33, 47–66 (1941)

    Google Scholar 

  • Wehner, R., Srinivasan, M.V.: Searching behaviour of desert ants, genus Cataglyphis (Formicidae, Hymenoptera). J. Comp. Physiol. 142, 315–338 (1981)

    Google Scholar 

  • White, R.C., Jr.: A survey of random methods for parameter optimization. Simulation 17, 197–205 (1971)

    Google Scholar 

  • Wilkinson, D.H.: The random element in bird “navigation”. J. Exp. Biol. 29, 532–560 (1952)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hoffmann, G. Optimization of brownian search strategies. Biol. Cybern. 49, 21–31 (1983). https://doi.org/10.1007/BF00336925

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00336925

Keywords

Navigation