Simple olfactory navigation in air and water

IF 1.9 4区 数学 Q2 BIOLOGY Journal of Theoretical Biology Pub Date : 2024-09-11 DOI:10.1016/j.jtbi.2024.111941
Bowei Ouyang , Aaron C. True , John P. Crimaldi , Bard Ermentrout
{"title":"Simple olfactory navigation in air and water","authors":"Bowei Ouyang ,&nbsp;Aaron C. True ,&nbsp;John P. Crimaldi ,&nbsp;Bard Ermentrout","doi":"10.1016/j.jtbi.2024.111941","DOIUrl":null,"url":null,"abstract":"<div><p>Two simple algorithms based on combining odor concentration differences across time and space along with information on the flow direction are tested for their ability to locate an odor source in four different odor landscapes. Image data taken from air plumes in three different regimes and a water plume are used as test environments for a bilateral (“stereo sampling”) algorithm using concentration differences across two sensors and a “casting” algorithm that uses successive samples to decide orientation. Agents are started at random locations and orientations in the landscape and allowed to move until they reach the source of the odor (success) or leave the imaged area (failure). Parameters for the algorithm are chosen to optimize success and to minimize path length to the source. Success rates over 90% are consistently obtained with path lengths that can be as low as twice the starting distance from the source in air and four times the distance in the highly turbulent water plumes. We find that parameters that optimize success often lead to more exploratory pathways to the source. Information about the direction from which the odor is coming is necessary for successful navigation in the water plume and reduces the path length in the three tested air plumes.</p></div>","PeriodicalId":54763,"journal":{"name":"Journal of Theoretical Biology","volume":"595 ","pages":"Article 111941"},"PeriodicalIF":1.9000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022519324002261/pdfft?md5=4baa947541fb13fb4cd0d1e55ea650d5&pid=1-s2.0-S0022519324002261-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Theoretical Biology","FirstCategoryId":"99","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022519324002261","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"BIOLOGY","Score":null,"Total":0}
引用次数: 0

Abstract

Two simple algorithms based on combining odor concentration differences across time and space along with information on the flow direction are tested for their ability to locate an odor source in four different odor landscapes. Image data taken from air plumes in three different regimes and a water plume are used as test environments for a bilateral (“stereo sampling”) algorithm using concentration differences across two sensors and a “casting” algorithm that uses successive samples to decide orientation. Agents are started at random locations and orientations in the landscape and allowed to move until they reach the source of the odor (success) or leave the imaged area (failure). Parameters for the algorithm are chosen to optimize success and to minimize path length to the source. Success rates over 90% are consistently obtained with path lengths that can be as low as twice the starting distance from the source in air and four times the distance in the highly turbulent water plumes. We find that parameters that optimize success often lead to more exploratory pathways to the source. Information about the direction from which the odor is coming is necessary for successful navigation in the water plume and reduces the path length in the three tested air plumes.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在空气和水中进行简单的嗅觉导航。
我们测试了两种简单算法的能力,这两种算法的基础是将不同时间和空间的气味浓度差异与流向信息相结合,从而在四种不同的气味景观中确定气味源的位置。从三种不同状态下的空气羽流和水羽流中获取的图像数据被用作使用两个传感器浓度差异的双边("立体采样")算法和使用连续样本决定方向的 "铸造 "算法的测试环境。代理从地形中的随机位置和方向开始移动,直到到达气味源(成功)或离开成像区域(失败)为止。选择算法参数的目的是优化成功率和最小化到达气味源的路径长度。成功率始终保持在 90% 以上,而路径长度在空气中可以低至距离气味源起始距离的两倍,在高湍流水羽流中可以低至距离气味源起始距离的四倍。我们发现,能够优化成功率的参数往往会带来更多通往源头的探索路径。有关气味来源方向的信息是在水羽流中成功导航的必要条件,并缩短了三种测试空气羽流的路径长度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
4.20
自引率
5.00%
发文量
218
审稿时长
51 days
期刊介绍: The Journal of Theoretical Biology is the leading forum for theoretical perspectives that give insight into biological processes. It covers a very wide range of topics and is of interest to biologists in many areas of research, including: • Brain and Neuroscience • Cancer Growth and Treatment • Cell Biology • Developmental Biology • Ecology • Evolution • Immunology, • Infectious and non-infectious Diseases, • Mathematical, Computational, Biophysical and Statistical Modeling • Microbiology, Molecular Biology, and Biochemistry • Networks and Complex Systems • Physiology • Pharmacodynamics • Animal Behavior and Game Theory Acceptable papers are those that bear significant importance on the biology per se being presented, and not on the mathematical analysis. Papers that include some data or experimental material bearing on theory will be considered, including those that contain comparative study, statistical data analysis, mathematical proof, computer simulations, experiments, field observations, or even philosophical arguments, which are all methods to support or reject theoretical ideas. However, there should be a concerted effort to make papers intelligible to biologists in the chosen field.
期刊最新文献
Editorial Board Impact of evolutionary relatedness on species diversification and tree shape Editorial Board A mathematical model of microglia glucose metabolism and lactylation with positive feedback. Tradeoffs in the energetic value of neuromodulation in a closed-loop neuromechanical system.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1