| Literature DB >> 35044324 |
Siddharth Jayakumar1,2, Venkatesh N Murthy3,2.
Abstract
Entities:
Mesh:
Year: 2022 PMID: 35044324 PMCID: PMC8784104 DOI: 10.1073/pnas.2121332119
Source DB: PubMed Journal: Proc Natl Acad Sci U S A ISSN: 0027-8424 Impact factor: 12.779
Fig. 1.Schematic of the sector search algorithm described in Reddy et al. (7). (A) The polar coordinate system which describes trail tracking in episodes of searching for the trail using an estimate of the heading (here based on two recent contacts with the trail). The angular width of a search is given by σ. The rate of angular searching in the space is a function of the sensor size a and the distance r. (B) A schematic of how an agent, in this case a mouse, searches for a ground-based trail using headings estimated from the two recent points of contact with the trail or two-point memory. The angular sectors are shown for successive pairs of contacts. (C) Tracking as a function of sampling frequency and memory. In the regime estimating heading with two points, an agent who samples frequently (moving at lower forward velocity) has a better estimate than one with higher velocity and samples sparsely. In the latter regime, an agent estimating using more memory (for example, a three-point estimate) would estimate better. The figure was created using BioRender.