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 条
  • [21] Finite-state dimension
    Dai, JJ
    Lathrop, JI
    Lutz, JH
    Mayordomo, E
    AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 1028 - 1039
  • [22] Finite-State Independence
    Verónica Becher
    Olivier Carton
    Pablo Ariel Heiber
    Theory of Computing Systems, 2018, 62 : 1555 - 1572
  • [23] Finite-state models for speech-based search on mobile devices
    Mishra, Taniya
    Bangalore, Srinivas
    NATURAL LANGUAGE ENGINEERING, 2011, 17 : 243 - 264
  • [24] Deciding sequentiability of finite-state transducers by finite-state pattern-matching
    Gaál, T
    THEORETICAL COMPUTER SCIENCE, 2004, 313 (01) : 105 - 117
  • [25] Comparison of digital search algorithms and finite-state automata of regular expressions
    Maryanov, P.A. (wrpg@mail.ru), 1600, Begell House Inc. (72):
  • [26] SIMULTANEOUS SEARCH FOR SEVERAL BINARY PATTERNS IN A STREAM WITH FINITE-STATE AUTOMATON
    Pankratov, I., V
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2014, 24 (02): : 119 - +
  • [27] State assignment of finite-state machines
    Ahmad, I
    Dhodhi, MK
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2000, 147 (01): : 15 - 22
  • [28] Finite-state temporal projection
    Fernando, Tim
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 4094 : 230 - 241
  • [29] Finite-state models in surgery
    Webster, RW
    COMPUTER GRAPHICS WORLD, 2000, 23 (01) : 6 - 6
  • [30] FINITE-STATE PROBABILISTIC LANGUAGES
    KNAST, R
    INFORMATION AND CONTROL, 1972, 21 (02): : 148 - &