Search

In mammals, the development of reflexes is often regarded as an innate process. However, recent findings show that fetuses are endowed with favorable conditions for ontogenetic development. In this article, we hypothesize that the circuitry of at least some mammalian reflexes can be self-organized from the sensory and motor interactions brought forth in a musculoskeletal system. We focus mainly on three reflexes: the myotatic reflex, the reciprocal inhibition reflex, and the reverse myotatic reflex. To test our hypothesis, we conducted a set of experiments on a simulated musculoskeletal system using pairs of agonist and antagonist muscles. The reflex connectivity is obtained by producing spontaneous motor activity in each muscle and by correlating the resulting sensor and motor signals. Our results show that, under biologically plausible conditions, the reflex circuitry thus obtained is consistent with that identified in relation to the analogous mammalian reflexes. In addition, they show that the reflex connectivity obtained depends on the morphology of the musculoskeletal system as well as on the environment that it is embedded in. [ABSTRACT FROM AUTHOR]

The generation of robust periodic movements of complex nonlinear robotic systems is inherently difficult, especially, if parts of the robots are compliant. It has previously been proposed that complex nonlinear features of a robot, similarly as in biological organisms, might possibly facilitate its control. This bold hypothesis, commonly referred to as morphological computation, has recently received some theoretical support by Hauser et al. (Biol Cybern 105:355-370, doi:, ). We show in this article that this theoretical support can be extended to cover not only the case of fading memory responses to external signals, but also the essential case of autonomous generation of adaptive periodic patterns, as, e.g., needed for locomotion. The theory predicts that feedback into the morphological computing system is necessary and sufficient for such tasks, for which a fading memory is insufficient. We demonstrate the viability of this theoretical analysis through computer simulations of complex nonlinear mass-spring systems that are trained to generate a large diversity of periodic movements by adapting the weights of a simple linear feedback device. Hence, the results of this article substantially enlarge the theoretically tractable application domain of morphological computation in robotics, and also provide new paradigms for understanding control principles of biological organisms. [ABSTRACT FROM AUTHOR]

The control of compliant robots is, due to their often nonlinear and complex dynamics, inherently difficult. The vision of morphological computation proposes to view these aspects not only as problems, but rather also as parts of the solution. Non-rigid body parts are not seen anymore as imperfect realizations of rigid body parts, but rather as potential computational resources. The applicability of this vision has already been demonstrated for a variety of complex robot control problems. Nevertheless, a theoretical basis for understanding the capabilities and limitations of morphological computation has been missing so far. We present a model for morphological computation with compliant bodies, where a precise mathematical characterization of the potential computational contribution of a complex physical body is feasible. The theory suggests that complexity and nonlinearity, typically unwanted properties of robots, are desired features in order to provide computational power. We demonstrate that simple generic models of physical bodies, based on mass-spring systems, can be used to implement complex nonlinear operators. By adding a simple readout (which is static and linear) to the morphology such devices are able to emulate complex mappings of input to output streams in continuous time. Hence, by outsourcing parts of the computation to the physical body, the difficult problem of learning to control a complex body, could be reduced to a simple and perspicuous learning task, which can not get stuck in local minima of an error function. [ABSTRACT FROM AUTHOR]