The traveling salesrat: insights into the dynamics of efficient spatial navigation in the rodent

Rodent spatial navigation requires the dynamic evaluation of multiple sources of information, including visual cues, self-motion signals and reward signals. The nature of the evaluation, its dynamics and the relative weighting of the multiple information streams are largely unknown and have generated many hypotheses in the field of robotics. We use the framework of the traveling salesperson problem (TSP) to study how this evaluation may be achieved. The TSP is a classical artificial intelligence NP-hard problem that requires an agent to visit a fixed set of locations once, minimizing the total distance traveled. We show that after a few trials, rats converge on a short route between rewarded food cups. We propose that this route emerges from a series of local decisions that are derived from weighing information embedded in the context of the task. We study the relative weighting of spatial and reward information and establish that, in the conditions of this experiment, when the contingencies are not in conflict, rats choose the spatial or reward optimal solution. There was a trend toward a preference for space when the contingencies were in conflict. We also show that the spatial decision about which cup to go to next is biased by the orientation of the animal. Reward contingencies are also shown to significantly and dynamically modulate the decision-making process. This paradigm will allow for further neurophysiological studies aimed at understanding the synergistic role of brain areas involved in planning, reward processing and spatial navigation. These insights will in turn suggest new neural-like architectures for the control of mobile autonomous robots.