Projects:
1)	Robotics (Control)
		a. navigation     (simulation exists)
		b. industrial robots (moving an arm) 
		(simulation available on internet)
		comp.robotics  FAQ
		c. predator - prey  (simulation exists)
			i. Escape
			ii. Hunt/Follow
		d. legged robots (2, 4, 6)

2)	Operations Research
		a. Scheduling
		b. Transportation Problem
		c. Travelling Salesman
		d. Assignment

3)	Design Problems
		a. analog circuits
		b. digital circuits
		c. Antennas
		d. Whatever you can find a simulaor for

		Genetic Programming
		a. GAs design code to perform a task
		(mostly Lisp code)

4)	Foundations of GAs
		a. encodings
		b. combinations of GAs with other methods
		c. operators

5) 	Classifier Systems


Theory:

Important Information:

1.	Strings and their  Fitnesses

2.	SIMILARITIES among strings
		

Crossover cuts and splices strings

So Individual strings do not survive across
generations.

So what do we analyse?
What does survive to be analyzed?

Bits and Pieces of strings !!

What kind of bits and pieces ?

Pieces that CORRELATE with HIGH FITNESS

Can we get more specific?

Formally:

How do we denote bits and pieces?

SCHEMAS

examples with four (4) bits:

 1111			00*1

 111*			****

 101*			0**1

 *1*0			1***

GAs process strings (0's and 1's)
But when we analyse GAs we have to analyze the
information that GAs process.

Strings + Fitness + Similarities (schemas)

What is the effect of

	Selection 
	Crossover
	Mutations

on 
	these bits and pieces of similar strings
	called SCHEMAS ?