Sector search strategies for odor trail tracking

Abstract

Terrestrial animals such as ants, mice and dogs often use surface-bound scent trails to establish navigation routes or to find food and mates, yet their tracking strategies are poorly understood. Tracking behavior features zig-zagging paths with animals often staying in close contact with the trail. Upon sustained loss of contact, animals execute a characteristic sequence of sweeping “casts” – wide oscillations with increasing amplitude. Here, we provide a unified description of trail-tracking behavior by introducing an optimization framework where animals search in the angular sector defined by their estimate of the trail’s heading and its uncertainty. In silico experiments using reinforcement learning based on this hypothesis recapitulate experimentally observed tracking patterns. We show that search geometry imposes limits on the tracking speed, and quantify its dependence on trail statistics and memory of past contacts. By formulating trail-tracking as a Bellman-type sequential optimization problem, we quantify the basic geometric elements of optimal sector search strategy, effectively explaining why and when casting is necessary. We propose a set of experiments to infer how tracking animals acquire, integrate and respond to past information on the tracked trail. More generally, we define navigational strategies relevant for animals and bio-mimetic robots, and formulate trail-tracking as a novel behavioral paradigm for learning, memory and planning.