January 2005
·
5 Reads
This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
January 2005
·
5 Reads
May 2004
·
118 Reads
The GermanTeam is a joint project of several German universities in the Sony Legged Robot League. This report describes the software developed for the RoboCup 2002 in Fukuoka. It presents the software architecture of the system as well as the methods that were developed to tackle the problems of motion, image processing, object recognition, self-localization, and robot behavior. The approaches for both playing robot soccer and mastering the challenges are presented. In addition to the software actually running on the robots, this document will also give an overview of the tools the GermanTeam used to support the development process.
January 2004
·
190 Reads
November 2003
·
18 Reads
·
24 Citations
This paper gives a brief overview of the work done in the past year. A detailed description of the entire system used in the competition---including its underlying architecture---can be found at [2]
April 2003
·
43 Reads
·
19 Citations
Lecture Notes in Computer Science
In this paper a method is presented that decreases the necessary num- ber of evaluations in Evolutionary Algorithms. A classifier with confidence in- formation is evolved to replace time consuming evaluations during tournament selection. Experimental analysis of a mathematical example and the application of the method to the problem of evolving walking patterns for quadruped robots show the potential of the presented approach.
January 2003
·
14 Reads
·
4 Citations
July 2002
·
11 Reads
·
9 Citations
Genetic programming(1) is expected to be a capable solution for designing fast and robust walking patterns for legged robots (2, 3, 4, 5). In fact, using this approach we have evolved very fast and stable patterns in the past (6). The genetic programming approach is easy to implement since the fitness function here is given implicitly by the robots' speed using a specific gait pattern. The best performing individual can be found easily by executing footraces. Unfortunately, such tournaments suffer from heavy wearout during the different stages of evolution. Therefore, different techniques are used to reduce the number of tournaments. An efficient method is to use physical simulation as a fitness module. In the past, we have made promising experiences using a physical simulation of a biped robot (7). Nevertheless, the implementation of such simulations can be very complex and expensive. In some cases, the data for motors, joints or gears might be unknown. Therefore, a physical simulation is not implementable in general. Instead, we suggest the use of a meta-model that can be generated automatically by an advanced artificial neural network. For our studies, we have used ERS 2100 quadruped robots that are provided by SONY for robot soccer purposes (8). These robots provide three degrees of freedom (DOF) per leg. Our simple walking engine works as follows: The cyclic walk is splitted into four phases. Each phase is characterized by 14 parameters: 12 motor angles, a parameter for the move- ment characteristic (point-to-point or linear), and the duration time for the entire phase. Thus, the evolutionary algorithm now has variables, the individuals
July 2002
·
12 Reads
·
7 Citations
This paper shows adaptive strategies to improve the reliability and performance of self-localization in robot soccer with legged robots. Adaptiveness is the common feature of the presented algorithms and has proved essential to enhance the quality of localization by a new classi cation technique, essential to increase the con dence level of internal information about the environment by extracting reliability information and by communicating them via parameterizable acoustic communication, and essential to circumvent manual implementations of walking patterns by evolving them automatically.
July 2002
·
30 Reads
·
46 Citations
Lecture Notes in Computer Science
We present the system SIGEL that combines the simulation and visualization of robots with a Genetic Programming system for the automated evolution of walking. It is designed to automatically generate control programs for arbitrary robots without depending on detailed analytical information of the robots' kinematic structure. Dierent tness functions as well as a variety of parameters allow the easy and interactive con guration and adaptation of the evolution process and the simulations.
June 2002
·
15 Reads
·
13 Citations
Lecture Notes in Computer Science
This paper shows adaptive strategies to improve the reliability and performance of self-localization in robot soccer with legged robots. Adaptiveness is the common feature of the presented algorithms and has proved essential to enhance the quality of localization by a new classification technique, essential to increase the confidence level of internal information about the environment by extracting reliability information and by communicating them via parameterizable acoustic communication, and essential to circumvent manual implementations of walking patterns by evolving them automatically.
... Das Bild der Chemie mit ihren vielen zeitgleich stattfindenden Reaktionen dient der ersten Gruppe von Systemen als Metapher für parallele Algorithmen und großen dezentralen Datenstrukturen ( [27,114,120]). ...
... Bei einfachen geometrischen Objekten sind die Trägheitsmomente aus Tabellenwerken entnehmbar, bei komplexen Körpern müssen sieüber ein Volumenintegral berechnet werden. Die Angabe der Hülle eines Körpers kann beispielsweiseüber eine VRML 1 -Datei erfolgen[14].Abhängig von der aktuellen Konfiguration werden die Bewegungsgleichungen (Differentialgleichungen) generiert, die anschließend im Zeitbereich gelöst werden. Dies erfolgt durch numerische Integration der Gleichungssysteme. ...
... However, this universality often proves to be a double edged sword, as will be described below. Nevertheless ANN have successfully been applied to many metamodeling problems (Xiao et al. 2003, Hillbrand and Karagiannis 2002, Dahm and Ziegler 2002, Panayiotou et al. 2000 ) ranging from economic validation of capital projects (Chaveesuk and Smith 2003), through process optimisation (Chambers and Mount-Campbell 2002 ), to microwave circuit modeling (Devabhaktuni et al. 2001, Zhang et al. 2003). An ANN consists of a number of, usually adaptive, artificial neurons that are interconnected to form a network. ...
July 2002
... One intensively researched area is surrogate-assisted design optimization, such as turbine blades [9,23,84,85], airfoils [27,86], forging [87], vehicle crash tests [88], multi-processor systems-on-chip design [89] and injection systems [90]. Other applications include drug design [2], protein design [5], hydroinformatics [91] and evolutionary robotics [92]. We must note that not many substantial successful applications of meta-model based evolutionary optimization have been reported, which, however does not necessarily mean no such work has been done. ...
January 2002
... In addition, SAEAs have been applied to problems other than CEPs, including interactive optimization problems, dynamic optimization [5], network architecture search [9] and others. SAEAs have also been successfully adopted to solve expensive real-world optimization problems from different domains, including engineering design [2], health industry [10] and interactive design [11,12]. ...
April 2003
Lecture Notes in Computer Science
... Gu and Hu [40] employed a combination of reinforcement learning [10] and evolutionary computation to learn refinements of the initially handcrafted parameters of their fuzzy logic controller architecture. Dahm and Ziegler [26] from the German Team envisioned how evolutionary computation could improve localization. Genetic programming allowed them to increase the robots' walking speed to over 20 cm/s. ...
June 2002
Lecture Notes in Computer Science
... The fundamental goal of the research program behind the present work is to develop computational systems that are living technology in the sense of Bedau et al. (2010)hardware-software artificial chemistries in digital machinery that will perform useful work for society. To some, the reach from software-based artificial chemistry to real-world utility may seem hopelessly long, and indeed this author is aware of only scattered examples-with Ziegler and Banzhaf (2001) offering one clear example. ...
February 2001
Artificial Life
... Their work was one of the first artificial chemistry models based on constructive processes, and it focused on the production of new entities (construction) over time rather than motion through predetermined state spaces (dynamics). 4,5 The model, dubbed AlChemy (for algorithmic chemistry), was based on the construction and composition of λ expressions-objects whose internal structure determines their relation and interaction with each other. 6 The original analyses of AlChemy became foundational studies in understanding the origins of self-organized complexity. ...
February 2001
Artificial Life
... This kind of approach was observed to work well for complex environments such as those in robotic soccer where multiple restrictions, not present in robotic navigation [6], can be found. Bearing this in mind, in this paper we propose an approach which combines constrained evolutionary computation methods with the Extended Kalman Filter, and a new search space definition can be effective to determine the position of a robot within the context of a robotic soccer game. ...
July 2002
... Seok et al describe a technique to perform calibration of sensors using Genetic Programming on evolvable hardware [7]. Ziegler and Banzhaf proposed to use evolutionary techniques to develop a sensory nose for a robot [9]. The Mate system proposed by Levis is a tiny virtual machine for sensor networks [2]. ...
August 2001