The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Towards a theoretical foundation for morphological computation with compliant bodies
Open accessAbstract
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 oft he 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Slotine, J.-J. E., & Li, W. (1991) · CERN Document Server (European Organization for Nuclear Research) · Cited by 18,975
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
Maass, W., Natschläger, T., & Markram, H. (2002) · Neural Computation · doi:10.1162/089976602760407955 · Cited by 4,025 · cited 1×
“For a detailed proof, we refer to Theorem 1 in Maass et al. (2002) and Theorem 3.1 in Maass and Sontag (2000) and their corresponding proofs.”
MethodInfluentialSelf-citationThe Handbook of brain theory and neural networks
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4484 · Cited by 3,870
McGeer, T. (1990) · The International Journal of Robotics Research · doi:10.1177/027836499000900206 · Cited by 3,359
Efficient Bipedal Robots Based on Passive-Dynamic Walkers
Collins, S., Ruina, A., Tedrake, R., & Wisse, M. (2005) · Science · doi:10.1126/science.1107799 · Cited by 1,873
The Handbook of brain theory and neural networks
(2003) · Choice Reviews Online · doi:10.5860/choice.41-0300 · Cited by 1,524
Slow Feature Analysis: Unsupervised Learning of Invariances
Wiskott, L., & Sejnowski, T. J. (2002) · Neural Computation · doi:10.1162/089976602317318938 · Cited by 1,350
Self-Organization, Embodiment, and Biologically Inspired Robotics
Pfeifer, R., Lungarella, M., & Iida, F. (2007) · Science · doi:10.1126/science.1145803 · Cited by 1,227
Self-citationFading memory and the problem of approximating nonlinear operators with Volterra series
Boyd, S., & Chua, L. (1985) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1985.1085649 · Cited by 991
Running in the real world: adjusting leg stiffness for different surfaces
Ferris, D. P., Louie, M., & Farley, C. T. (1998) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.1998.0388 · Cited by 594
New results on recurrent network training: unifying the algorithms and accelerating convergence
Atiya, A. F., & Parlos, A. G. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846741 · Cited by 521
Design and control of tensegrity robots for locomotion
Paul, C., Valero-Cuevas, F. J., & Lipson, H. (2006) · IEEE Transactions on Robotics · doi:10.1109/tro.2006.878980 · Cited by 423
Design and Construction of MIKE; a 2-D Autonomous Biped Based on Passive Dynamic Walking
Wisse, M., & van Frankenhuyzen, J. (2006) · Adaptive Motion of Animals and Machines · doi:10.1007/4-431-31381-8_13 · Cited by 215
Modeling, analysis, and control of dynamic systems
Palm, W. J. (1983) · Andalas University Repository (Andalas University) · Cited by 192
Paul, C. (2006) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2006.03.003 · Cited by 183
Neural Systems as Nonlinear Filters
Maass, W., & Sontag, E. D. (2000) · Neural Computation · doi:10.1162/089976600300015123 · Cited by 66
Self-citationFumiya Iida, A., & Pfeifer, R. (2006) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2006.03.005 · Cited by 59
Self-citationVapnik-Chervonenkis dimension of neural nets
Bartlett, P. L., & Maass, W. (2003) · Cited by 54
Self-citationLegenstein, R. A., Chase, S. M., Schwartz, A. B., & Maass, W. (2009) · PubMed · Cited by 12
Self-citation
Cited by
Design, fabrication and control of soft robots
Rus, D., & Tolley, M. T. (2015) · Nature · doi:10.1038/nature14543 · Cited by 5,825
Recent advances in physical reservoir computing: A review
Tanaka, G., Yamane, T., Héroux, J. B., Nakane, R., Kanazawa, N., Takeda, S., Numata, H., Nakano, D., & Hirose, A. (2019) · Neural Networks · doi:10.1016/j.neunet.2019.03.005 · Cited by 2,146
Advances in photonic reservoir computing
Van der Sande, G., Brunner, D., & Soriano, M. C. (2017) · Nanophotonics · doi:10.1515/nanoph-2016-0132 · Cited by 591
Information Processing Capacity of Dynamical Systems
Dambre, J., Verstraeten, D., Schrauwen, B., & Massar, S. (2012) · Scientific Reports · doi:10.1038/srep00514 · Cited by 480
Physical reservoir computing—an introductory perspective
Nakajima, K. (2020) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/ab8d4f · Cited by 422
Metadata
- Authors
- Hauser, H., Ijspeert, A. J., Füchslin, R. M., Pfeifer, R., & Maass, W.
- Venue
- Biological Cybernetics
- Published
- 2011-12
- Volume
- 105
- Issue
- 5-6
- Pages
- 355-370
- ISSN
- 0340-1200 (ISSN-L)
- 1432-0770
- OpenAlex
- W2151471214
- Cited by
- 330
- References
- 23
- FWCI
- 5.47
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.