Genetic programming l.jpg
This presentation is the property of its rightful owner.
Sponsored Links
1 / 32

Genetic Programming PowerPoint PPT Presentation


  • 174 Views
  • Uploaded on
  • Presentation posted in: General

Genetic Programming. A Brief Overview. Darius Makaitis CSC 650 - Advanced Artificial Intelligence Creighton University. What is Genetic Programming?.

Download Presentation

Genetic Programming

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Genetic programming l.jpg

Genetic Programming

A Brief Overview

Darius Makaitis

CSC 650 - Advanced Artificial Intelligence

Creighton University


What is genetic programming l.jpg

What is Genetic Programming?

  • Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to handle a complex problem. … Genetic programming can be viewed as an extension of the genetic algorithm, a model for testing and selecting the best choice among a set of results, each represented by a string.

http://whatis.techtarget.com/definition/0%2C%2Csid9_gci214639%2C00.html


Outline of the genetic algorithm l.jpg

Outline of the Genetic Algorithm

  • Randomly generate a set of possible solutions to a problem, representing each as a fixed length character string

  • Test each possible solution against the problem using a fitness function to evaluate each solution

  • Keep the best solutions, and use them to generate new possible solutions

  • Repeat the previous two steps until either an acceptable solution is found, or until the algorithm has iterated through a given number of cycles (generations)


Why genetic programming l.jpg

Why Genetic Programming?

  • “It is difficult, unnatural, and overly restrictive to attempt to represent hierarchies of dynamically varying size and shape with fixed length character strings.” “For many problems in machine learning and artificial intelligence, the most natural representation for a solution is a computer program.” [Koza, 1994]

  • A parse tree is a good representation of a computer program for Genetic Programming


Using trees to represent computer programs l.jpg

Functions

+

2

3

*

/

X

7

Y

5

Terminals

Using Trees To Represent Computer Programs

(+ 2 3 (* X 7) (/ Y 5))


Genetic operations l.jpg

Genetic Operations

  • Random Generation of the initial population of possible solutions

  • Mutation of promising solutions to create new possible solutions

  • Genetic Crossover of two promising solutions to create new possible solutions


Randomly generating programs l.jpg

Randomly Generating Programs

  • Randomly generate a program that takes two arguments and uses basic arithmetic to return an answer

    • Function set = {+, -, *, /}

    • Terminal set = {integers, X, Y}

  • Randomly select either a function or a terminal to represent our program

  • If a function was selected, recursively generate random programs to act as arguments


Randomly generating programs8 l.jpg

Randomly Generating Programs

(+ …)

+


Randomly generating programs9 l.jpg

Randomly Generating Programs

(+ 2 …)

+

2


Randomly generating programs10 l.jpg

Randomly Generating Programs

(+ 2 3 …)

+

2

3


Randomly generating programs11 l.jpg

Randomly Generating Programs

(+ 2 3 (* …) …)

+

2

3

*


Randomly generating programs12 l.jpg

Randomly Generating Programs

(+ 2 3 (* X 7) (/ …))

+

2

3

*

/

X

7


Randomly generating programs13 l.jpg

Randomly Generating Programs

(+ 2 3 (* X 7) (/ Y 5))

+

2

3

*

/

X

7

Y

5


Mutation l.jpg

Mutation

(+ 2 3 (* X 7) (/ Y 5))

+

2

3

*

/

X

7

Y

5


Mutation15 l.jpg

*

X

7

Mutation

First pick a random node

(+ 2 3 (* X 7) (/ Y 5))

+

2

3

/

Y

5


Mutation16 l.jpg

Mutation

Delete the node and its children, and replace with a randomly generated program

(+ 2 3 (+ (* 4 2) 3) (/ Y 5))

+

2

3

+

/

*

3

Y

5

4

2


Crossover l.jpg

Crossover

(+ X (* 3 Y))

(- (/ 25 X) 7)

+

-

X

*

/

7

3

Y

25

X


Crossover18 l.jpg

Crossover

(+ X (* 3 Y))

(- (/ 25 X) 7)

Pick a random node in each program

+

-

X

*

/

7

3

Y

25

X


Crossover19 l.jpg

Crossover

(+ X (* (/ 25 X) Y))

(- 3 7)

Swap the two nodes

+

-

X

*

3

7

/

Y

25

X


What about just randomly generating programs l.jpg

What About Just RandomlyGenerating Programs?

  • Is Genetic Programming really better than just randomly creating new functions?

  • Yes!

    • Pete Angeline compared the result of evolving a tic-tac-toe algorithm for 200 generations, with a population size of 1000 per generation, against 200,000 randomly generated algorithms

    • The best evolved program was found to be significantly superior to the best randomly generated program [Genetic Programming FAQ, 2002]

  • The key lies in using a fitness measure to determine which functions survive to reproduce in each generation


Building a better mouse l.jpg

Building a Better Mouse

  • Apply Genetic Programming to the problem of navigating a maze

  • What are our terminal and function sets?

    • Function Set ={If-Movement-Blocked, While-Not-At-Cheese*}

    • Terminal Set ={Move-Forward, Turn-Left, Turn-Right}

* While-Not-At-Cheese will be used exclusively as the root node of the parse tree


Building a better mouse22 l.jpg

One possible solution:

While not at the cheese

If the way ahead is blocked

Turn left 90 degrees

Otherwise

Move forward

Turn right 90 degrees

Cheese?

Blocked?

Building a Better Mouse

How to get the starving mouse to the cheese?

Is there a better solution for this maze? How good is this solution?


Building a better mouse23 l.jpg

Our mouse will die 10 moves from the exit after spending 100 units, so the fitness measure for our program is 12100

Building a Better Mouse

A fitness function:

  • Each function and terminal other than the root node shall cost one unit to execute

  • If the mouse spends more than 100 units, it dies of hunger

  • The fitness measure for a program is determined be executing the program, then squaring the sum of the total units spent and the final distance from the exit

  • A lower fitness measure is preferable to a higher fitness measure

Cheese?

Blocked?


Building a better mouse24 l.jpg

Building a Better Mouse

While not at the cheese (12996)

If the way ahead is blocked

Turn left 90 degrees

Otherwise

Move forward one space

While not at the cheese (12996)

Move forward one space

Turn right 90 degrees

Turn left 90 degrees


Building a better mouse25 l.jpg

Building a Better Mouse

While not at the cheese (12996)

If the way ahead is blocked

Turn left 90 degrees

Otherwise

Move forward one space

While not at the cheese (12996)

Move forward one space

Turn right 90 degrees

Turn left 90 degrees

Mutation:

While not at the cheese (12996)

If the way ahead is blocked

Turn left 90 degrees

Otherwise

Turn left 90 degrees


Building a better mouse26 l.jpg

Building a Better Mouse

While not at the cheese (12996)

If the way ahead is blocked

Turn left 90 degrees

Otherwise

Move forward one space

While not at the cheese (12996)

Move forward one space

Turn right 90 degrees

Turn left 90 degrees

Crossover:

While not at the cheese (11664)

If the way ahead is blocked

Move forward one space

Turn right 90 degrees

Otherwise

Move forward one space

While not at the cheese (12996)

Turn left 90 degrees

Turn left 90 degrees


Building a better mouse27 l.jpg

Fitness measure: 2809

Building a Better Mouse

(after 4202 generations, with 1000 programs per generation)

While not at the cheese

If the way ahead is blocked

Turn right 90 degrees

Move forward one space

Move forward one space

Move forward one space

Otherwise

Move forward one space

Turn right 90 degrees

Move forward one space

Move forward one space

Turn left 90 degrees

If the way ahead is blocked

Turn left 90 degrees

Otherwise

Move forward one space

Is this better?


Real world applications l.jpg

Real World Applications

  • Lockheed Martin Missiles and Space Co. - Near-Minimum-Time Spacecraft Maneuvers [Howley, 96]

  • GP applied to the problem of rest-to-rest reorientation maneuvers for satellites

  • Optimal time solution is a vector of nonlinear differential equations, which are difficult to solve

  • An approximate solution is necessary for a real-time controller

  • Results: Rest-to-Rest Maneuver Times (8 test cases)

    • Optimal Solution: 287.93 seconds

    • Expert Solution: 300.3 seconds

    • GP Solution: 292.8 seconds


Real world applications29 l.jpg

Real World Applications

  • Symbolic Regression

  • Problem: Given a set of data points, find a mathematical model

http://alphard.ethz.ch/gerber/approx/default.html


Real world applications30 l.jpg

Real World Applications

  • Neural Network Optimization [Zhang, Mühlenbein, 1993]

  • Image Analysis [Poli, 1996a]

  • Generation of a knowledge base for expert systems [Bojarczuk, Lopes, Freitas, 2000]

  • Fuzzy Logic Control [Akbarzadeh, Kumbla, Tunstel, Jamshidi, 2000]

  • Hardware Evolution (Field-Programmable Gate Array) [Thompson, 1997]


What s next l.jpg

What’s Next?

  • Parallel Distributed Genetic Programming [Poli, 1996b]

    • Operates on graphs rather than parse trees

  • Finite State Automata

  • Asymetric Recurrent Neural Networks [Pujol, Poli, 1997]


References l.jpg

References

  • Genetic Programming FAQ, 2002. http://www.cs.ucl.ac.uk/research/genprog/gp2faq/gp2faq.html

  • Akbarzadeh, M.R., Kumbla, K., Tunstel, E., Jarnshidi, M., “Soft Comuting for Autonomous Robotic Systems”, Computers and Electrivcal Engineering, 2002: 26, pp. 5-32.

  • Bojarczuk, C.C., Lopes, H.S., Freitas, A.A., “Genetic Programming for Knowledge Discovery In Chest-Pain Diagnosis”, IEEE Engineering in Medicine and Biology Magazine, 2000: 19, v. 4, pp. 38-44.

  • Howley, B., “Genetic Programming of Near-Minimum-Time Spacecraft Attitude Maneuvers”, Proceedings of Genetic Programming 1996, Koza, J.R. et al. (Eds), MIT Press, 1996, pp. 98-109.

  • Koza, J., “Genetic Programming as a Means for Programming Computers by Natural Selection“, 1994.

  • Poli, R., “Genetic Programming for Image Analysis”, Proceedings of Genetic Programming 1996, Koza, J.R. et al. (Eds), MIT Press, 1996, pp. 363-368.

  • Poli, R., “Parallel Distributed Genetic Programming”, Technical report, The University of Birmingham, School of Computer Science, 1996.

  • Pujol, J.C.F., Poli, R., “Efficient Evolution of Asymetric Recurrent Neural Networks Using a Two-dimensional Representation”, 1997.

  • Thompson, A., “Artificial Evolution in the Physical World”, Evolutionary Robotics: From Intelligent Robots to Artificial Life, Gomi, T. (Ed.), AAI Books, 1997, pp. 101-125.

  • Zhang, B.T., Mühlenbein, H., “Genetic Programming of Minimal Neural Nets Using Occam’s Razor”, Proc. Of 5th Int. Conf. On Genetic Algorithms, 1993, pp. 342-349.


  • Login