Das Suchergebnis hat sich seit Ihrer Suchanfrage verändert. Eventuell werden Dokumente in anderer Reihenfolge angezeigt.
  • Treffer 4 von 13
Zurück zur Trefferliste

Levy flights do not always optimize random blind search for sparse targets

  • It is generally believed that random search processes based on scale-free, Levy stable jump length distributions (Levy flights) optimize the search for sparse targets. Here we show that this popular search advantage is less universal than commonly assumed. We study the efficiency of a minimalist search model based on Levy flights in the absence and presence of an external drift (underwater current, atmospheric wind, a preference of the walker owing to prior experience, or a general bias in an abstract search space) based on two different optimization criteria with respect to minimal search time and search reliability (cumulative arrival probability). Although Levy flights turn out to be efficient search processes when the target is far from the starting point, or when relative to the starting point the target is upstream, we show that for close targets and for downstream target positioning regular Brownian motion turns out to be the advantageous search strategy. Contrary to claims that Levy flights with a critical exponent alpha = 1It is generally believed that random search processes based on scale-free, Levy stable jump length distributions (Levy flights) optimize the search for sparse targets. Here we show that this popular search advantage is less universal than commonly assumed. We study the efficiency of a minimalist search model based on Levy flights in the absence and presence of an external drift (underwater current, atmospheric wind, a preference of the walker owing to prior experience, or a general bias in an abstract search space) based on two different optimization criteria with respect to minimal search time and search reliability (cumulative arrival probability). Although Levy flights turn out to be efficient search processes when the target is far from the starting point, or when relative to the starting point the target is upstream, we show that for close targets and for downstream target positioning regular Brownian motion turns out to be the advantageous search strategy. Contrary to claims that Levy flights with a critical exponent alpha = 1 are optimal for the search of sparse targets in different settings, based on our optimization parameters the optimal a may range in the entire interval (1, 2) and especially include Brownian motion as the overall most efficient search strategy.zeige mehrzeige weniger

Metadaten exportieren

Weitere Dienste

Suche bei Google Scholar Statistik - Anzahl der Zugriffe auf das Dokument
Metadaten
Verfasserangaben:Vladimir V. Palyulin, Aleksei V. ChechkinORCiDGND, Ralf MetzlerORCiDGND
DOI:https://doi.org/10.1073/pnas.1320424111
ISSN:0027-8424
Pubmed ID:https://pubmed.ncbi.nlm.nih.gov/24516153
Titel des übergeordneten Werks (Englisch):Proceedings of the National Academy of Sciences of the United States of America
Verlag:National Acad. of Sciences
Verlagsort:Washington
Publikationstyp:Wissenschaftlicher Artikel
Sprache:Englisch
Jahr der Erstveröffentlichung:2014
Erscheinungsjahr:2014
Datum der Freischaltung:27.03.2017
Freies Schlagwort / Tag:Levy foraging hypothesis; search optimization; stochastic processes
Band:111
Ausgabe:8
Seitenanzahl:6
Erste Seite:2931
Letzte Seite:2936
Fördernde Institution:Deutsche Forschungsgemeinschaft [PA 2042/1-1]; Academy of Finland (FiDiPro scheme)
Organisationseinheiten:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Physik und Astronomie
Peer Review:Referiert
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.