Syswerda G. (1991) A study of Reproduction in Generational SteadyState Genetic Algorithms, in: Foundations of Genetic Algorithms, Rawlings G.J.E. (ed.), Morgan Kaufmann, San Mateo, CA  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the robot to slip with its wheels during a collision with an obstacle. There is an increase in friction with the walls making it hard for the circular robot to turn while in contact with a wall. 4 The Evolutionary Algorithm The GP system is a steady state tournament selection algorithm [5] [11] with the following execution cycle: 1. Select k members for tournament. 2. For all members in tournament do: a) Read out proximity sensors and feed the values to one individual in the tournament. b) Execute the individual and store the resulting robot motor speeds. c) Send motor speeds to the ....

Syswerda G. (1991) A study of Reproduction in Generational Steady-State Genetic Algortihms, in: Foundations of Genetic Algorithms, Rawlings G.J.E. (ed.), Morgan Kaufmann, San Mateo, CA

....learning form past experiences. At the outset, the population of programs is initialized with random content. Tournaments are used for the competitive selection of individuals which are allowed to produce offspring. The GP system with its simple steady state tournament selection algorithm [24] [27] has the following execution cycle: 1. Select four arbitrary programs from the population. 2. For each of the programs calculate fitness. 3. Make two copies (offspring) of the two individuals with highest fitness and subject the copies to crossover and mutation 4. Replace the two individuals of ....

Syswerda G. (1991). A study of Reproduction in Generational Steady-State Genetic Algorithms. In Foundations of Genetic Algorithms, Rawlings G.J.E. (ed.), Morgan Kaufmann, San Mateo, CA.

.... Nordin, 1996; Francone, Nordin Banzhaf, 1996) 2.2.1 The evolutionary system The population of programs is initialized with random content at the beginning of training. Tournament selection is used to determine who will survive and have offspring. We use a steady state GP population (Syswerda, 1991; Reynolds, 1994) rather than discrete generations. Figure 5 gives a schematic view of the control architecture and the GP system. Input to the GP system are sensor values communicated from the robot, output of the GP system are motor values controlling its behavior. Population four individuals ....

Syswerda, G. (1991). A Study of Reproduction in Generational Steady-State Genetic Algorithms. In G. J. E. Rawlings (Ed.), Foundations of Genetic Algorithms. Morgan Kaufmann, San Mateo, CA.

....past experiences. The population of programs is initialized with random content at the outset. A simple tournament is used for the competitive selection of individuals to produce the right distribution of offspring. The GPsystem with its simple steady state tournament selection algorithm [23] [26] has the following execution cycle: 1. Select four arbitrary programs from the population. 2. For each of the programs calculate fitness. 3. Make two copies (offspring) of the two individuals with highest fitness and let the copies be subject to crossover and mutation 4. Replace the two ....

Syswerda G. (1991) A study of Reproduction in Generational Steady-State Genetic Algorithms, in: Foundations of Genetic Algorithms, Rawlings G.J.E. (ed.), Morgan Kaufmann, San Mateo, CA

No context found.

Syswerda G. (1991) A study of Reproduction in Generational SteadyState Genetic Algorithms, in: Foundations of Genetic Algorithms, Rawlings G.J.E. (ed.), Morgan Kaufmann, San Mateo, CA

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC