Dual Population Coding for Path Planning in Graphs with Overlapping Place 
Representations

Mallot, HA; Ecke, GA; Baumann, T

doi:10.1007/978-3-030-57983-8_1

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Dual Population Coding for Path Planning in Graphs with Overlapping Place Representations

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

https://link.springer.com/content/pdf/10.1007/978-3-030-57983-8_1.pdf
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Mallot, H., Ecke, G., & Baumann, T. (2020). Dual Population Coding for Path Planning in Graphs with Overlapping Place Representations. In J. Šķilters, N. Newcombe, & D. Uttal (Eds.), Spatial Cognition XII: 12th International Conference, Spatial Cognition 2020, Riga, Latvia, August 26–28, 2020 (pp. 3-17). Cham, Switzerland: Springer.

Cite as: https://hdl.handle.net/21.11116/0000-000E-1668-5

Abstract

Topological schemes for navigation from visual snapshots have been based on graphs of panoramic images and action links allowing the transition from one snapshot point to the next; see, for example, Cartwright and Collett [5] or Franz et al. [9]. These algorithms can only work if at each step a unique snapshot is recognized to which a motion decision is associated. Here, we present a population coding approach in which place is encoded by a population of overlapping “firing fields”, each of which is activated by the recognition of an unspecific “micro-snapshot” (i.e. feature), and associated to a subsequent action. Agent motion is then computed by a voting scheme over all activated snapshot-to-action associations. The algorithm was tested in a large virtual environment (Virtual Tübingen [24]) and shows biologically plausible navigational abilities.