Self pruning Gaussian Synapse Networks for behavior based robots

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

Abstract

The ability to obtain the minimal network that allows a robot to perform a given behavior without having to determine what sensors the behavior requires and to what extent each must be considered is one of the objectives of behavior based robotics. In this paper we propose Gaussian Synapse Networks as a very efficient structure for obtaining behavior based controllers that verify these conditions. We present some results on the evolution of controllers using Gaussian Synapse Networks and discuss the way in which they improve the evolution through their ability to smoothly select to what extent each signal and interval is considered within the internal processing of the network. In fact, the main result presented here is the way in which these networks provide a very efficient mechanism to prune the networks, allowing the construction of minimal networks that only make use of the signal intervals required. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Becerra, J. A., Duro, R. J., & Santos, J. (2002). Self pruning Gaussian Synapse Networks for behavior based robots. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2415 LNCS, pp. 837–843). Springer Verlag. https://doi.org/10.1007/3-540-46084-5_136

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