This article describes a computational model of the hippocampus that makes
it possible for a simulated rat to navigate in a continuous environment con
taining obstacles. This model views the hippocampus as a "cognitive graph",
that is, a hetero-associative network that learns temporal sequences of vi
sited places and stores a topological representation of the environment. Ca
lling upon place cells, head direction cells, and "goal cells", it suggests
a biologically plausible way of exploiting such a spatial representation f
or navigation that does not require complicated graph-search algorithms. Mo
reover, it permits "latent learning" during exploration, that is, the build
ing of a spatial representation without the need of any reinforcement. When
the rat occasionally discovers some rewarding place it may wish to rejoin
subsequently, it simply records within its cognitive graph, through a serie
s of goal and sub-goal cells, the direction in which to move from any given
start place. Accordingly, the model implements a simple "place-recognition
-triggered response" navigation strategy. Two implementations of place cell
management are studied in parallel. The first one associates place cells w
ith place fields that are given a priori and that are uniformly distributed
in the environment. The second one dynamically recruits place cells as exp
loration proceeds and adjusts the density of such cells to the local comple
xity of the environment. Both implementations lead to identical results. Th
e article ends with a few predictions about results to be expected in exper
iments involving simultaneous recordings of multiple cells in the rat hippo
campus.