Optimal random search using limited spatial memory

Tomoko Sakiyama, Yukio Pegio Gunji

Research output: Contribution to journalArticle

Abstract

Lévy walks are known to be efficient movements because Lévy walkers search wide areas while restricting returns to previously visited sites. A self-avoiding walk (SAW) is a series of moves on a lattice that visit the same place only once. As such, SAWs can also be effective search algorithms. However, it is not realistic that foragers memorize many visited positions for a long time. In this work, we investigated whether foragers performed optimal searches when having limited memory. The agent in our model followed SAWs to some extent by memorizing and avoiding visited places. However, the agent lost its memory after a while. In that situation, the agent changed its reactions to visited patches by considering global trail patterns based on local memorized information. As a result, we succeeded in making the agent occasionally produce ballistic walks related to power-law tailed movements across some ranges.

Original languageEnglish
Article number171057
JournalRoyal Society Open Science
Volume5
Issue number3
DOIs
Publication statusPublished - Mar 7 2018

Fingerprint

Data storage equipment
Ballistics

Keywords

  • Foraging
  • Movement strategy
  • Power law

ASJC Scopus subject areas

  • General

Cite this

Optimal random search using limited spatial memory. / Sakiyama, Tomoko; Gunji, Yukio Pegio.

In: Royal Society Open Science, Vol. 5, No. 3, 171057, 07.03.2018.

Research output: Contribution to journalArticle

Sakiyama, Tomoko ; Gunji, Yukio Pegio. / Optimal random search using limited spatial memory. In: Royal Society Open Science. 2018 ; Vol. 5, No. 3.
@article{dfd63e1f2ba24f6d96080ebda5d408e1,
title = "Optimal random search using limited spatial memory",
abstract = "L{\'e}vy walks are known to be efficient movements because L{\'e}vy walkers search wide areas while restricting returns to previously visited sites. A self-avoiding walk (SAW) is a series of moves on a lattice that visit the same place only once. As such, SAWs can also be effective search algorithms. However, it is not realistic that foragers memorize many visited positions for a long time. In this work, we investigated whether foragers performed optimal searches when having limited memory. The agent in our model followed SAWs to some extent by memorizing and avoiding visited places. However, the agent lost its memory after a while. In that situation, the agent changed its reactions to visited patches by considering global trail patterns based on local memorized information. As a result, we succeeded in making the agent occasionally produce ballistic walks related to power-law tailed movements across some ranges.",
keywords = "Foraging, Movement strategy, Power law",
author = "Tomoko Sakiyama and Gunji, {Yukio Pegio}",
year = "2018",
month = "3",
day = "7",
doi = "10.1098/rsos.171057",
language = "English",
volume = "5",
journal = "Royal Society Open Science",
issn = "2054-5703",
publisher = "The Royal Society",
number = "3",

}

TY - JOUR

T1 - Optimal random search using limited spatial memory

AU - Sakiyama, Tomoko

AU - Gunji, Yukio Pegio

PY - 2018/3/7

Y1 - 2018/3/7

N2 - Lévy walks are known to be efficient movements because Lévy walkers search wide areas while restricting returns to previously visited sites. A self-avoiding walk (SAW) is a series of moves on a lattice that visit the same place only once. As such, SAWs can also be effective search algorithms. However, it is not realistic that foragers memorize many visited positions for a long time. In this work, we investigated whether foragers performed optimal searches when having limited memory. The agent in our model followed SAWs to some extent by memorizing and avoiding visited places. However, the agent lost its memory after a while. In that situation, the agent changed its reactions to visited patches by considering global trail patterns based on local memorized information. As a result, we succeeded in making the agent occasionally produce ballistic walks related to power-law tailed movements across some ranges.

AB - Lévy walks are known to be efficient movements because Lévy walkers search wide areas while restricting returns to previously visited sites. A self-avoiding walk (SAW) is a series of moves on a lattice that visit the same place only once. As such, SAWs can also be effective search algorithms. However, it is not realistic that foragers memorize many visited positions for a long time. In this work, we investigated whether foragers performed optimal searches when having limited memory. The agent in our model followed SAWs to some extent by memorizing and avoiding visited places. However, the agent lost its memory after a while. In that situation, the agent changed its reactions to visited patches by considering global trail patterns based on local memorized information. As a result, we succeeded in making the agent occasionally produce ballistic walks related to power-law tailed movements across some ranges.

KW - Foraging

KW - Movement strategy

KW - Power law

UR - http://www.scopus.com/inward/record.url?scp=85043573257&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85043573257&partnerID=8YFLogxK

U2 - 10.1098/rsos.171057

DO - 10.1098/rsos.171057

M3 - Article

AN - SCOPUS:85043573257

VL - 5

JO - Royal Society Open Science

JF - Royal Society Open Science

SN - 2054-5703

IS - 3

M1 - 171057

ER -