Department of Ecology and Evolutionary Biology, Princeton University, Princeton, NJ 08544, USA.
Smithsonian Conservation Biology Institute, National Zoological Park, Front Royal, VA 22630, USA.
Sci Rep. 2017 Jan 6;7:40029. doi: 10.1038/srep40029.
Many natural processes rely on optimizing the success ratio of a search process. We use an experimental setup consisting of a simple online game in which players have to find a target hidden on a board, to investigate how the rounds are influenced by the detection of cues. We focus on the search duration and the statistics of the trajectories traced on the board. The experimental data are explained by a family of random-walk-based models and probabilistic analytical approximations. If no initial information is given to the players, the search is optimized for cues that cover an intermediate spatial scale. In addition, initial information about the extension of the cues results, in general, in faster searches. Finally, strategies used by informed players turn into non-stationary processes in which the length of e ach displacement evolves to show a well-defined characteristic scale that is not found in non-informed searches.
许多自然过程都依赖于优化搜索过程的成功率。我们使用一个包含简单在线游戏的实验设置,玩家必须在棋盘上找到隐藏的目标,以研究轮次如何受到线索检测的影响。我们关注搜索持续时间和在棋盘上绘制的轨迹的统计数据。实验数据由一系列基于随机游走的模型和概率分析近似来解释。如果没有向玩家提供初始信息,则搜索将针对覆盖中间空间尺度的线索进行优化。此外,关于线索扩展的初始信息通常会导致更快的搜索。最后,知情玩家使用的策略变成非稳态过程,其中每个位移的长度演变以显示出在不知情搜索中找不到的明确特征尺度。