| Literature DB >> 31924732 |
A Gumaste1,2,3, G Coronas-Samano2,3, J Hengenius4, R Axman2, E G Connor5, K L Baker2,3, B Ermentrout4, J P Crimaldi5, J V Verhagen6,2,3.
Abstract
Localization of odors is essential to animal survival, and thus animals are adept at odor navigation. In natural conditions animals encounter odor sources in which odor is carried by air flow varying in complexity. We sought to identify potential minimalist strategies that can effectively be used for odor-based navigation and asses their performance in an increasingly chaotic environment. To do so, we compared mouse, in silico model, and Arduino-based robot odor-localization behavior in a standardized odor landscape. Mouse performance remains robust in the presence of increased complexity, showing a shift in strategy towards faster movement with increased environmental complexity. Implementing simple binaral and temporal models of tropotaxis and klinotaxis, an in silico model and Arduino robot, in the same environment as the mice, are equally successful in locating the odor source within a plume of low complexity. However, performance of these algorithms significantly drops when the chaotic nature of the plume is increased. Additionally, both algorithm-driven systems show more successful performance when using a strictly binaral model at a larger sensor separation distance and more successful performance when using a temporal and binaral model when using a smaller sensor separation distance. This suggests that with an increasingly chaotic odor environment, mice rely on complex strategies that allow for robust odor localization that cannot be resolved by minimal algorithms that display robust performance at low levels of complexity. Thus, highlighting that an animal's ability to modulate behavior with environmental complexity is beneficial for odor localization.Entities:
Keywords: in silico; mouse; navigation; odor plume; robot; turbulence
Mesh:
Year: 2020 PMID: 31924732 PMCID: PMC7004486 DOI: 10.1523/ENEURO.0212-19.2019
Source DB: PubMed Journal: eNeuro ISSN: 2373-2822
Figure 1.Mouse odor-navigation task. , Flow chamber used to conduct behavioral assay. Chamber is flanked by two honeycombs and on the inlet side, a turbulence grid 10 cm in front of the honeycomb. Three odor ports and lick spouts are spaced along inlet side and vacuum is used to establish air flow (5 cm/s). , Mouse is rewarded for navigating to the port releasing odor (port two) and trial is terminated early if animal navigates to incorrect port (left). Trial structure includes a 30-s period to establish plume before animal enters chamber and given 45 s to navigate (right). , miniPID readings of odor concentration from odor ports 1 and 2 (time averaged and normalized to maximum reading which occurs at the odor source). , Performance (% successful trials in a given session) of mice over testing days. Performance is broken up into an early phase (first 7 d) and a late phase (last 7 d). Plot shows mean performance ± SEM, n = 4 mice. , Percentage of time spent hugging the chamber wall, defined as within 5 cm of behavioral arena wall, over testing days. Plot shows mean % time spent wall hugging ± SEM, n = 4 mice. See also Extended Data Figure 1-1. *p < 0.05.
Figure 3.In silico models show decreased performance with increased odor environment complexity. , Model virtual chassis moves through space with a heading, θ. Two sensors are separated at a distance ℓand an angle γ (left). If the center of the model reaches dthreshold = 10 cm of the wall, the model will take corrective measures (right; described in Materials and Methods). , Model is tested at angles ranging from 90° to 270° with a start position in the center of the arena. Model is tested on two plumes, one originating from a center port and one from a corner port. , Sample frame depicting instantaneous concentration of the dynamic plume normalized to odor source (left), and an image of the stationary concentration gradient in static plume normalized to odor source (right). , Performance (average % success of all start angles ± SEM) across code and sensor distance for center target port (left) and corner target port (right); n = 20 simulations. , Linearity score (calculated as the ratio of the Euclidean distance between start point and end point of trajectory and the actual pathlength) across code and sensor distance for center target port (left) and corner target port (right). Plot shows mean linearity score ± SEM, n = 20 simulations. See also Extended Data Figures 3-1, 3-2, 3-3, 3-4, 3-5, and 3-6. *p < 0.05, **p < 0.01, ***p < 0.001.
Figure 4.Arduino-based robot navigation varies based on start position and odor environment complexity. , Robot odor navigation flow chamber, modifications to the SOL. Solid arrows represent five starting angles. Odor ports were coupled to LED lights detected by sensors on the robot (indicated by dotted red arrows). , Performance (average % successful trials over 8 and 16 cm and 0° and 45° gas sensor distance and angles, respectively) across codes (left). Performance based on gas sensor distance and angle for the honeycomb condition (right). , Example trajectories from 180° (magenta) starting position in for honeycomb and no honeycomb condition. , Performance (average % successful trials over 8 and 16 cm and 0° and 45° gas sensor distance and angles, respectively) with the honeycomb based on starting angle and rewarded port for Code A (left) and Code B (right). Bars are color coded and labeled according to the starting angles in . , Robot overall linearity score with honeycomb and without honeycomb using Code B. Plot shows data combined over sensor angle and sensor distance for each odor environment condition (left). Linearity score across starting angles and target ports with and without the honeycomb. All plots show mean ± SEM, n = 4 sessions. See also Extended Data Figure 4-1. *p < 0.05, **p < 0.01.
Statistical analyses
| Location | Data structure | Statistical test | 95% confidence Intervals |
|---|---|---|---|
| a | Paired % time spent wall-hugging (late phase vs early phase), | Paired one-tailed | –35.91 to –18.15 |
| b | Paired % success (late phase vs early phase), | Paired one-tailed | –1.79 to –21.51 |
| c | Paired % success (no honeycomb condition vs late phase), | Paired two-tailed | –10.64 to 6.81 |
| d | % success for honeycomb and no honeycomb conditions per odor port | Two-way ANOVA on % success (factors: port #, plume complexity) | Bonferroni correction: |
| e | % success for honeycomb and no honeycomb conditions per odor port | Two-way ANOVA on % success (factors: port #, plume complexity) | Bonferroni correction: |
| f | % success for honeycomb and no honeycomb conditions per odor port | Two-way ANOVA on % success (factors: port #, plume complexity) | Bonferroni correction: |
| g | Paired % success (no odor vs late phase), | Paired one-tailed | –51.18 to –11.46 |
| h | Paired % success (no odor vs no honeycomb condition), | Paired one-tailed | –46.02 to –12.78 |
| i | Paired distance to odor source on successful trials (late phase vs early phase) | Paired two-tailed | –114.2 to –7.34 |
| j | Paired time to odor source on successful trials (late phase vs early phase) | Paired two-tailed | –6.92 to –2.28 |
| k | Paired distance to odor source on successful trials (no honeycomb vs late phase) | Paired two-tailed | –25.94 to 18.91 |
| l | Paired time to odor source on successful trials (no honeycomb vs late phase) | Paired two-tailed | –25.94 to 18.91 |
| m | Paired average velocity during trial (no honeycomb vs late phase) | Paired two-tailed | 0.49 to 15.59 |
| n | Paired average angle sum during trial (no honeycomb vs late phase) | Paired two-tailed | –69.8 to 15.41 |
| o | Paired average Δ nose angle (no honeycomb vs late phase) | Paired two-tailed | 0.008 to 0.12 |
| p | Average nose/body distance ratio (late phase) | One-sample two-tailed | 1.13 to 1.15 |
| q | Average nose/ body distance ratio (no honeycomb) | One-sample two-tailed | 1.14 to 1.26 |
| r | % success for static and dynamic across Code A and Code B, sensor distance 8 and 16 cm | Three-way ANOVA on % success (factors: plume complexity code, and sensor separation distance) | Bonferroni correction: |
| s | % success for static and dynamic across Code A and Code B, sensor distance 8 and 16 cm | Three-way ANOVA on % success (factors: plume complexity code, and sensor separation distance) | Bonferroni correction: |
| t | Linearity for static and dynamic across Code A and Code B, sensor distance 8 and 16 cm | Three-way ANOVA on linearity (factors: plume complexity code, and sensor separation distance) | Bonferroni correction: |
| u | Linearity for static and dynamic across Code A and Code B, sensor distance 8 and 16 cm | Three-way ANOVA on linearity (factors: plume complexity code, and sensor separation distance) | Bonferroni correction: |
| v | % success for static and dynamic across Code A and Code B, sensor distance 8 and 16 cm | Three-way ANOVA on % success (factors: plume complexity code, and sensor separation distance) | Bonferroni correction: |
| w | % success for static and dynamic across Code A and Code B, sensor distance 8 and 16 cm | Three-way ANOVA on % success (factors: plume complexity code, and sensor separation distance) | Bonferroni correction: |
| x | % success for static and dynamic across Code A and Code B, sensor distance 8 and 16 cm | Three-way ANOVA on % success (factors: plume complexity code, and sensor separation distance) | Bonferroni correction: |
| y | Linearity for static and dynamic across Code A and Code B, sensor distance 8 and 16 cm | Three-way ANOVA on linearity (factors: plume complexity code, and sensor separation distance) | Bonferroni correction: |
| z | Linearity for static and dynamic across Code A and Code B, sensor distance 8 and 16 cm | Three-way ANOVA on linearity (factors: plume complexity code, and sensor separation distance) | Bonferroni correction: |
| aa | Linearity for static and dynamic across Code A and Code B, sensor distance 8 and 16 cm | Three-way ANOVA on linearity (factors: plume complexity code, and sensor separation distance) | Bonferroni correction: |
| bb | % success for static and dynamic across Code A and Code B, sensor distance 8 and 16 cm | Three-way ANOVA on % success (factors: plume complexity code, and sensor separation distance) | Bonferroni correction: |
| cc | % success for static and dynamic across Code A and Code B, sensor distance 8 and 16 cm | Three-way ANOVA on % success (factors: plume complexity code, and sensor separation distance) | Bonferroni correction: |
| dd | % success for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on % success (factors: plume complexity and modality) | Bonferroni correction: |
| ee | % success for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on % success (factors: plume complexity and modality) | Bonferroni correction: |
| ff | % success for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on % success (factors: plume complexity and modality) | Bonferroni correction: |
| gg | % success for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on % success (factors: plume complexity and modality) | Bonferroni correction: |
| hh | Time to target for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on time to target (factors: plume complexity and modality) | Bonferroni correction: |
| ii | Time to target for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on time to target (factors: plume complexity and modality) | Bonferroni correction: |
| jj | Time to target for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on time to target (factors: plume complexity and modality) | Bonferroni correction: |
| kk | Time to target for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on time to target (factors: plume complexity and modality) | Bonferroni correction: |
| ll | Paired % success (no honeycomb condition vs honeycomb Code A), | Paired two-tailed | –97.78 to –27.22 |
| mm | Paired % success (no honeycomb condition vs honeycomb Code B), | Paired two-tailed | –27.38 to –11.91 |
| nn | Paired % success (no honeycomb condition vs honeycomb Code B), | Paired two-tailed | –67.52 to –27.48 |
| oo | % success for honeycomb condition per start angle | One-way ANOVA (factor: start angle) | Bonferroni correction: |
| pp | % success for honeycomb condition per start angle | One-way ANOVA (factor: start angle) | Bonferroni correction: |
| % success for honeycomb condition per start angle | One-way ANOVA (factor: start angle) | Bonferroni correction: | |
| rr | % success for honeycomb condition per start angle | One-way ANOVA (factor: start angle) | Bonferroni correction: |
| ss | Linearity for honeycomb and no honeycomb using Code B across start angle | Two-way ANOVA (factors: plume complexity start angle) | Bonferroni correction: |
| tt | Linearity for honeycomb and no honeycomb using Code B across start angle | Two-way ANOVA (factors: plume complexity start angle) | Bonferroni correction: |
| uu | Linearity score for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on linearity score (factors: plume complexity and modality) | Bonferroni correction: |
| vv | Linearity score for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on linearity score (factors: plume complexity and modality) | Bonferroni correction: |
| ww | % success for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on % success (factors: plume complexity and modality) | Bonferroni correction: |
| xx | % success for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on % success (factors: plume complexity and modality) | Bonferroni correction: |
| yy | Time to target for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on time to target (factors: plume complexity and modality) | Bonferroni correction: |
| zz | Time to target for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on time to target (factors: plume complexity and modality) | Bonferroni correction: |
| aaa | Velocity for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on time to target (factors: plume complexity and modality) | Bonferroni correction: |
| bbb | Velocity for low complexity and high complexity across modalities (mouse, model Code A, model Code B, and robot Code B) | Two-way ANOVA on time to target (factors: plume complexity and modality) | Bonferroni correction: |
Figure 2.Mice change navigation behavior with increased experience and odor environment complexity. , Performance (average % successful trials over sessions) across testing phases. Mice are tested on a no-odor condition in addition to the phases with a honeycomb and condition without a honeycomb. Chance level performance is 25% as animals have three ports as options and are not required to choose an odor port on trials. , Pathlength to target odor port on successful trials. , Time to target odor port on successful trials. , Time to target on successful trials over testing days. , Example traces of successful navigation from the late phase and no honeycomb phase. Traces are color scaled based on velocity. , Total angle sum of trajectories of late phase and no honeycomb condition. Total angle sum is calculated by using the total sum of angles on turns from frame-to-frame. , Velocity on successful trials of late phase and honeycomb condition (left). Velocity over the course of successful trajectories resampled to 675 frames (right). , Change in nose angle per frame (15 Hz) over the course of successful trajectories resampled to 675 frames (left). Change in nose angle on successful trials of late phase and no honeycomb condition (right). , Ratio of path distance based on nose to path distance based on center of body (left). Example trajectories with ratios of 1.35 (top) and 1.08 (bottom). All plots show mean ± SEM, n = 4 mice. See also Extended Data Figure 2-1. *p < 0.05, **p < 0.01.
Figure 5.Mouse, robot, and in silico navigation trajectories. , Mouse trajectories show consistency with increased odor environment complexity. , Robot trajectories show decreased success on trials for the same testing conditions with increased odor plume complexity, Code B, sensor distance: 8 cm, sensor angle: 0°. , In silico trajectories (50 trials with start angles ranging from 90° to 270°) show increased unsuccessful trials for the same testing conditions with increased complexity, Code B, sensor distance: 8 cm. See also Extended Data Figure 5-1.