Olfactory search with finite-state controllers

被引:2
|
作者
Verano, Kyrell Vann B. [1 ,2 ]
Panizon, Emanuele [1 ]
Celani, Antonio [1 ]
机构
[1] Abdus Salam Int Ctr Theoret Phys, Quantitat Life Sci, I-34151 Trieste, Italy
[2] Univ Trieste, Dept Phys, I-34127 Trieste, Italy
关键词
olfactory search; reinforcement learning; partially observable Markov decision processes; NEURAL DYNAMICS; ORIENTATION; ALGORITHMS;
D O I
10.1073/pnas.2304230120
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Long-range olfactory search is an extremely difficult task in view of the sparsity of odor signals that are available to the searcher and the complex encoding of the information about the source location. Current algorithmic approaches typically require a continuous memory space, sometimes of large dimensionality, which may hamper their optimization and often obscure their interpretation. Here, we show how finite-state controllers with a small set of discrete memory states are expressive enough to display rich, time-extended behavioral modules that resemble the ones observed in living organisms. Finite-state controllers optimized for olfactory search have an immediate interpretation in terms of approximate clocks and coarse-grained spatial maps, suggesting connections with neural models of search behavior.
引用
收藏
页数:12
相关论文
共 50 条
  • [31] Finite-state code generation
    Fraser, CW
    Proebsting, TA
    ACM SIGPLAN NOTICES, 1999, 34 (05) : 270 - 280
  • [32] Benchmarking finite-state verifiers
    Avrunin G.S.
    Corbett J.C.
    Dwyer M.B.
    International Journal on Software Tools for Technology Transfer, 2000, 2 (4) : 317 - 320
  • [33] On the Capacity of Finite-State Channels
    Chen, Jun
    Permuter, Haim
    Weissman, Tsachy
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 1223 - +
  • [34] Rough finite-state automata
    Basu, S
    CYBERNETICS AND SYSTEMS, 2005, 36 (02) : 107 - 124
  • [35] Periodic finite-state machines
    Kopetz, H.
    El-Salloum, C.
    Huber, B.
    Obermaisser, R.
    10TH IEEE INTERNATIONAL SYMPOSIUM ON OBJECT AND COMPONENT-ORIENTED REAL-TIME DISTRIBUTED COMPUTING, PROCEEDINGS, 2007, : 10 - +
  • [36] Translation with finite-state devices
    Knight, K
    Al-Onaizan, Y
    MACHINE TRANSLATION AND THE INFORMATION SOUP, 1998, 1529 : 421 - 437
  • [37] Finite-State Text Processing
    Maurel, Denis
    TRAITEMENT AUTOMATIQUE DES LANGUES, 2021, 62 (02): : 39 - 41
  • [38] Finite-state language processing
    Cáccamo, MJ
    Kowaltowski, T
    COMPUTATIONAL LINGUISTICS, 1998, 24 (04) : 641 - 648
  • [39] ON COMMUNICATING FINITE-STATE MACHINES
    BRAND, D
    ZAFIROPULO, P
    JOURNAL OF THE ACM, 1983, 30 (02) : 323 - 342
  • [40] Recursive prosody is not finite-state
    Dolatian, Hossep
    De Santo, Aniello
    Graf, Thomas
    SIGMORPHON 2021: 18TH SIGMORPHON WORKSHOP ON COMPUTATIONAL RESEARCH IN PHONETICS, PHONOLOGY, AND MORPHOLOGY, 2021, : 11 - 22