Collective foraging in heterogeneous landscapes

Author:

Bhattacharya Kunal1ORCID,Vicsek Tamás2ORCID

Affiliation:

1. Department of Physics, Birla Institute of Technology and Science, Pilani, Rajasthan 333031, India

2. Department of Biological Physics, Eötvös University, Pázmány Péter sétány 1A, 1117 Budapest, Hungary

Abstract

Animals foraging alone are hypothesized to optimize the encounter rates with resources through Lévy walks. However, the issue of how the interactions between multiple foragers influence their search efficiency is still not completely understood. To address this, we consider a model to study the optimal strategy for a group of foragers searching for targets distributed heterogeneously. In our model, foragers move on a square lattice containing immobile but regenerative targets. At any instant, a forager is able to detect only those targets that happen to be in the same site. However, we allow the foragers to have information about the state of other foragers. A forager who has not detected any target walks towards the nearest location, where another forager has detected a target, with a probability exp(− αd ), where d is the distance between the foragers and α is a parameter characterizing the propensity of the foragers to aggregate. The model reveals that neither overcrowding ( α → 0) nor independent searching ( α → ∞) is beneficial for the foragers. For a patchy distribution of targets, the efficiency is maximum for intermediate values of α . In addition, in the limit α → 0, the length of the walks can become scale-free.

Publisher

The Royal Society

Subject

Biomedical Engineering,Biochemistry,Biomaterials,Bioengineering,Biophysics,Biotechnology

Cited by 38 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3