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

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Mallot, H. A., Ecke, G. A., & Baumann, T. (2020). Dual Population Coding for Path Planning in Graphs with Overlapping Place Representations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12162 LNAI, pp. 3–17). Springer. https://doi.org/10.1007/978-3-030-57983-8_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free