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 条
  • [1] Path-finding in real and simulated rats: assessing the influence of path characteristics on navigation learning
    Minija Tamosiunaite
    James Ainge
    Tomas Kulvicius
    Bernd Porr
    Paul Dudchenko
    Florentin Wörgötter
    Journal of Computational Neuroscience, 2008, 25 : 562 - 582
  • [2] Erratum to: Path-finding in real and simulated rats: assessing the influence of path characteristics on navigation learning
    Minija Tamosiunaite
    James Ainge
    Tomas Kulvicius
    Bernd Porr
    Paul Dudchenko
    Florentin Wörgötter
    Journal of Computational Neuroscience, 2010, 28 : 619 - 619
  • [3] Path-finding in real and simulated rats: assessing the influence of path characteristics on navigation learning (vol 25, pg 562, 2008)
    Tamosiunaite, Minija
    Ainge, James
    Kulvicius, Tomas
    Porr, Bernd
    Dudchenko, Paul
    Woergoetter, Florentin
    JOURNAL OF COMPUTATIONAL NEUROSCIENCE, 2010, 28 (03) : 619 - 619
  • [4] Hierarchical path-finding for Navigation Meshes (HNA*)
    Pelechano, Nuria
    Fuentes, Carlos
    COMPUTERS & GRAPHICS-UK, 2016, 59 : 68 - 78
  • [5] Path-finding on a grid
    Yap, P
    Schaeffer, J
    PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2002, : 454 - 457
  • [6] Path-Finding on the Microtubule
    Okten, Zeynep
    BIOPHYSICAL JOURNAL, 2013, 104 (02) : 3A - 3A
  • [7] A Two-level Path-finding Strategy for Indoor Navigation
    Liu, Liu
    Zlatanova, Sisi
    INTELLIGENT SYSTEMS FOR CRISIS MANAGEMENT: GEO-INFORMATION FOR DISASTER MANAGEMENT (GI4DM) 2012, 2013, : 31 - 42
  • [8] Path-finding with motion constraints in real time strategies
    University of South Carolina, 315 Main St., Columbia, SC 29208, United States
    CGAT - Comput. Games, Multimedia Allied Technol., Int. Conf. Ind. Symp. Comput. Games Anim., Multimedia, IPTV, Edutainment IT, (83-90):
  • [9] The Challenge of Axonal Path-Finding
    Danek, Adrian
    STRABISMUS, 2006, 14 (02) : 95 - 99
  • [10] Reinforcement learning of a path-finding behaviour by a mobile robot
    Malmstrom, K
    Munday, L
    Sitte, J
    ANZIIS 96 - 1996 AUSTRALIAN NEW ZEALAND CONFERENCE ON INTELLIGENT INFORMATION SYSTEMS, PROCEEDINGS, 1996, : 334 - 337