Path-finding in real and simulated rats:: assessing the influence of path characteristics on navigation learning

被引:8
|
作者
Tamosiunaite, Minija [2 ,3 ]
Ainge, James [3 ]
Kulvicius, Tomas [1 ,2 ]
Porr, Bernd [4 ]
Dudchenko, Paul [3 ]
Woergoetter, Florentin [1 ,3 ]
机构
[1] Univ Gottingen, Bernstein Ctr Computat Neurosci, Gottingen, Germany
[2] Vytautas Magnus Univ, Dept Informat, LT-44404 Kaunas, Lithuania
[3] Univ Stirling, Dept Psychol, Stirling FK9 4LA, Scotland
[4] Univ Glasgow, Dept Elect & Elect Engn, Glasgow GT12 8LT, Lanark, Scotland
基金
英国生物技术与生命科学研究理事会;
关键词
reinforcement learning; SARSA; place field system; function approximation; weight decay;
D O I
10.1007/s10827-008-0094-6
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
A large body of experimental evidence suggests that the hippocampal place field system is involved in reward based navigation learning in rodents. Reinforcement learning (RL) mechanisms have been used to model this, associating the state space in an RL-algorithm to the place-field map in a rat. The convergence properties of RL-algorithms are affected by the exploration patterns of the learner. Therefore, we first analyzed the path characteristics of freely exploring rats in a test arena. We found that straight path segments with mean length 23 cm up to a maximal length of 80 cm take up a significant proportion of the total paths. Thus, rat paths are biased as compared to random exploration. Next we designed a RL system that reproduces these specific path characteristics. Our model arena is covered by overlapping, probabilistically firing place fields (PF) of realistic size and coverage. Because convergence of RL-algorithms is also influenced by the state space characteristics, different PF-sizes and densities, leading to a different degree of overlap, were also investigated. The model rat learns finding a reward opposite to its starting point. We observed that the combination of biased straight exploration, overlapping coverage and probabilistic firing will strongly impair the convergence of learning. When the degree of randomness in the exploration is increased, convergence improves, but the distribution of straight path segments becomes unrealistic and paths become 'wiggly'. To mend this situation without affecting the path characteristic two additional mechanisms are implemented: A gradual drop of the learned weights (weight decay) and path length limitation, which prevents learning if the reward is not found after some expected time. Both mechanisms limit the memory of the system and thereby counteract effects of getting trapped on a wrong path. When using these strategies individually divergent cases get substantially reduced and for some parameter settings no divergence was found anymore at all. Using weight decay and path length limitation at the same time, convergence is not much improved but instead time to convergence increases as the memory limiting effect is getting too strong. The degree of improvement relies also on the size and degree of overlap (coverage density) in the place field system. The used combination of these two parameters leads to a trade-off between convergence and speed to convergence. Thus, this study suggests that the role of the PF-system in navigation learning cannot be considered independently from the animals' exploration pattern.
引用
收藏
页码:562 / 582
页数:21
相关论文
共 50 条
  • [31] Regenerating Arbitrary Video Sequences With Distillation Path-Finding
    Le, Thi-Ngoc-Hanh
    Yao, Sheng-Yi
    Wu, Chun-Te
    Lee, Tong-Yee
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2024, 30 (07) : 3622 - 3635
  • [32] A necessary condition for path-finding by the homotopy continuation method
    Amiss, Scott C.
    Guay, Martin
    PROCEEDINGS OF THE 48TH IEEE CONFERENCE ON DECISION AND CONTROL, 2009 HELD JOINTLY WITH THE 2009 28TH CHINESE CONTROL CONFERENCE (CDC/CCC 2009), 2009, : 2117 - 2124
  • [33] Smart path-finding with local information in a sensory field
    Zhang, Wenzhe
    Li, Minglu
    Shu, Wei
    Wu, Min-You
    MOBILE AD-HOC AND SENSOR NETWORKS, PROCEEDINGS, 2006, 4325 : 119 - +
  • [34] A Path-Finding Based Method for Concept Discovery in Graphs
    Abay, N. Ceren
    Mutlu, Alev
    Karagoz, Pinar
    2015 6TH INTERNATIONAL CONFERENCE ON INFORMATION, INTELLIGENCE, SYSTEMS AND APPLICATIONS (IISA), 2015,
  • [35] Better path-finding algorithms in LPS Ramanujan graphs
    Pinto, Eduardo Carvalho
    Petit, Christophe
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2018, 12 (04) : 191 - 202
  • [36] Optimizing Road Networks: A Graph-Based Analysis with Path-finding and Learning Algorithms
    Muthuvel, P.
    Pandiyan, G.
    Manickam, S.
    Rajesh, C.
    INTERNATIONAL JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS RESEARCH, 2024, : 315 - 329
  • [37] On the Collaboration of an Automatic Path-Planner and a Human User for Path-Finding in Virtual Industrial Scenes
    Ladeveze, N.
    Fourquet, J-Y.
    11TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION (ICARCV 2010), 2010, : 467 - 472
  • [38] Learning basic concept of computer programming with path-finding task in ar and its properties
    Ishihara, Makio
    Rattanachinalai, Pongpun
    EDUCATION AND INFORMATION TECHNOLOGIES, 2022, 27 (01) : 719 - 742
  • [39] Improving multi-UAV cooperative path-finding through multiagent experience learning
    Jiang, Longting
    Wei, Ruixuan
    Wang, Dong
    APPLIED INTELLIGENCE, 2024, 54 (21) : 11103 - 11119
  • [40] Learning basic concept of computer programming with path-finding task in ar and its properties
    Makio Ishihara
    Pongpun Rattanachinalai
    Education and Information Technologies, 2022, 27 : 719 - 742