Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Self Pruning Gaussian Synapse Networks for Behavior Based Robots
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2415/2002
Book
Artificial Neural Networks — ICANN 2002
DOI
10.1007/3-540-46084-5
Copyright
2002
ISBN
978-3-540-44074-1
DOI
10.1007/3-540-46084-5_136
Pages
790-792
Subject Collection
Computer Science
SpringerLink Date
Tuesday, January 01, 2002
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (222.5 KB)
Free Preview
Self Pruning Gaussian Synapse Networks for Behavior Based Robots
J. A. Becerra
5
, R. J. Duro
5
and J. Santos
5
(5)
Grupo de Sistemas Autónomos, Universidade da Coruña, Spain
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.
J.
A.
Becerra
Email:
ronin@mail2.udc.es
R.
J.
Duro
Email:
richard@udc.es
J.
Santos
Email:
santos@udc.es
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.108 • Server: MPWEB25
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)