作者: R�diger Wehner , Mandyam V. Srinivasan
DOI: 10.1007/BF00605445
关键词: Path integration 、 Random walk 、 Mathematics 、 Probability density function 、 Path (graph theory) 、 Algorithm 、 Trajectory 、 Position (vector) 、 Cataglyphis 、 A priori and a posteriori
摘要: If a homing ant (Cataglyphis bicolor, C. albicans) gets lost, it does not perform a random walk but adopts a stereotyped search strategy. During its search the ant performs a number of loops of ever-increasing size, starting and ending at the origin and pointing at different azimuthal directions. This strategy ensures that the centre area where the nest is most likely to be, is investigated most extensively. 2. After one hour of continuous search the ant's search paths cover an area of about 10 4 m 2. Nevertheless, the system of loops performed …