Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Stiesberg, G. R.
Right arrow Articles by Huerta, R.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Stiesberg, G. R.
Right arrow Articles by Huerta, R.
(Neural Computation. 2007;19:974-993.)
© 2007 The MIT Press


Letter

Connection Topology Selection in Central Pattern Generators by Maximizing the Gain of Information

Gregory R. Stiesberg

grs26{at}cornell.edu Institute for Nonlinear Science, University of California San Diego, La Jolla 92093–0402, U.S.A.

Marcelo Bussotti Reyes

mbreyes{at}ucsd.edu Instituto de Física, Universidade de São Paulo, São Paulo 05508–090, Brazil

Pablo Varona

pablo.varona{at}uam.es Institute for Nonlinear Science, University of California San Diego, La Jolla 92093–0402, U.S.A., and Departamento de Ingeniería Informática, Universidad Autónoma de Madrid, Madrid, Spain

Reynaldo D. Pinto

reynaldo{at}if.usp.br Instituto de Física, Universidade de São Paulo, São Paulo 05508–090, Brazil, and Institute for Nonlinear Science, University of California San Diego, La Jolla 92093–0402, U.S.A.

Ramón Huerta

rhuerta{at}ucsd.edu Institute for Nonlinear Science, University of California San Diego, La Jolla 92093–0402, U.S.A.

A study of a general central pattern generator (CPG) is carried out by means of a measure of the gain of information between the number of available topology configurations and the output rhythmic activity. The neurons of the CPG are chaotic Hindmarsh-Rose models that cooperate dynamically to generate either chaotic or regular spatiotemporal patterns. These model neurons are implemented by computer simulations and electronic circuits. Out of a random pool of input configurations, a small subset of them maximizes the gain of information. Two important characteristics of this subset are emphasized: (1) the most regular output activities are chosen, and (2) none of the selected input configurations are networks with open topology. These two principles are observed in living CPGs as well as in model CPGs that are the most efficient in controlling mechanical tasks, and they are evidence that the information-theoretical analysis can be an invaluable tool in searching for general properties of CPGs.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2007 by The MIT Press.