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 条
  • [21] Verification of an Airport Taxiway Path-Finding Algorithm
    He, Siyuan
    Du, Ke
    Wilhelm, Joshua
    Jeannin, Jean-Baptiste
    2020 AIAA/IEEE 39TH DIGITAL AVIONICS SYSTEMS CONFERENCE (DASC) PROCEEDINGS, 2020,
  • [22] On fast path-finding algorithms in AND-OR graphs
    Adelson-Velsky, GM
    Gelbukh, A
    Levner, E
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2002, 8 (4-5) : 283 - 293
  • [23] REGULAR ALGEBRA APPLIED TO PATH-FINDING PROBLEMS
    BACKHOUSE, RC
    CARRE, BA
    JOURNAL OF THE INSTITUTE OF MATHEMATICS AND ITS APPLICATIONS, 1975, 15 (02): : 161 - 186
  • [24] On the Complexity of Optimal Parallel Cooperative Path-Finding
    Surynek, Pavel
    FUNDAMENTA INFORMATICAE, 2015, 137 (04) : 517 - 548
  • [25] A path-finding algorithm for finding a low glare path using time-expanded network
    Matsuda, Hiroki
    Murata, Yoshihiro
    2016 IEEE 19TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC), 2016, : 1844 - 1849
  • [26] Transition-Path Theory and Path-Finding Algorithms for the Study of Rare Events
    E, Weinan
    Vanden-Eijnden, Eric
    ANNUAL REVIEW OF PHYSICAL CHEMISTRY, VOL 61, 2010, 61 : 391 - 420
  • [27] Path-finding for large scale multiplayer computer games
    Lanctot, Marc
    Ng Man Sun, Nicolas
    Verbrugge, Clark
    GAMEON-NA 2006: 2ND INTERNATIONAL NORTH-AMERICAN CONFERENCE ON INTELLIGENT GAMES AND SIMULATION, 2006, : 26 - +
  • [28] Physical Transport Simulation for Path-Finding and Device Optimization
    Karner, M.
    Stanojevic, Z.
    Baumgartner, O.
    Karner, H. W.
    Kernstock, C.
    Demel, H.
    Mitterbauer, F.
    2016 IEEE SILICON NANOELECTRONICS WORKSHOP (SNW), 2016, : 208 - 209
  • [29] Path-finding in dynamic environments with PDDL-planners
    Estivill-Castro, Vladimir
    Ferrer-Mestres, Jonathan
    2013 16TH INTERNATIONAL CONFERENCE ON ADVANCED ROBOTICS (ICAR), 2013,
  • [30] A path-finding algorithm for loop-free routing
    GarciaLunaAceves, JJ
    Murthy, S
    IEEE-ACM TRANSACTIONS ON NETWORKING, 1997, 5 (01) : 148 - 160