From sensorimotor graphs to rules: An agent learns from a stream of experience

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

Abstract

In this paper we argue that a philosophically and psychologically grounded autonomous agent is able to learn recursive rules from basic sensorimotor input. A sensorimotor graph of the agent's environment is generated that stores and optimises beneficial motor activations in evaluated sensor space by employing temporal Hebbian learning. This results in a categorized stream of experience that feeds in a Minerva memory model which is enriched by a time line approach and integrated in the cognitive architecture Psi-including motivation and emotion. These memory traces feed seamlessly into the inductive rule acquisition device Igor2 and the resulting recursive rules are made accessible in the same memory store. A combination of cognitive theories from the 1980ies and state-of-the-art computer science thus is a plausible approach to the still prevailing symbol grounding problem. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Raab, M., Wernsdorfer, M., Kitzelmann, E., & Schmid, U. (2011). From sensorimotor graphs to rules: An agent learns from a stream of experience. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6830 LNAI, pp. 333–339). https://doi.org/10.1007/978-3-642-22887-2_39

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