Treffer: Evolving locomotion gaits for quadruped walking robots

Title:
Evolving locomotion gaits for quadruped walking robots
Source:
Robots used for the manufacture of domestic appliancesIndustrial robot. 32(3):259-267
Publisher Information:
Bradford: Emerald, 2005.
Publication Year:
2005
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, University of Essex, Colchester, United Kingdom
ISSN:
0143-991X
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16891442
Database:
PASCAL Archive

Weitere Informationen

Purpose - This paper presents an evolutionary algorithm (EA) for Sony legged robots to learn good walking behaviours with little or no interaction with the designers. Once the learning method is put into place, the module can learn through its interaction with the real world. Design/methodology/approach - An EA for developing locomotion gaits of quadruped walking robots is presented in this paper. It is based on a hybrid approach that changes the probability of genetic operators in respect to the performance of the operator's offspring. Findings - The mutating and combination behaviours of the genetic algorithms allow the process to develop a useful behaviour over time. The resulting gait from this training proved to be a better solution than the non-interference training for movements over all types of surfaces, pointing to a local optima being discovered in the non-environmental interference situation. Research limitations/implications - The behaviour of these algorithms is stochastic so that they may potentially present different solutions in different runs of the same algorithm. The mechanism described here has several features that should be noted. It allows rapid parameterisation of operator probabilities across the range of potential genetic algorithms and operator set. It is tailored to a steady state reproduction scheme. It would not be literally applicable to problems with noisy evaluation functions. Originality/value - Provides novel application of genetic algorithms to a potentially practical application area.