DOC PREVIEW
USC CSCI 460 - session26

This preview shows page 1-2-19-20 out of 20 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 20 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 20 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 20 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 20 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 20 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

1Genetic AlgorithmsCS 460, Session 262The Traditional Approach• Ask an expert• Adapt existing designs• Trial and errorCS 460, Session 263Nature’s Starting PointAlison Everitt’s “A User’s Guide to Men”CS 460, Session 264Optimised Man!CS 460, Session 265Example: Pursuit and Evasion• Using NNs and Genetic algorithm• 0 learning• 200 tries• 999 triesCS 460, Session 266Comparisons•Traditional• best guess• may lead to local, not global optimum•Nature• population of guesses• more likely to find a better solutionCS 460, Session 267More Comparisons•Nature• not very efficient• at least a 20 year wait between generations• not all mating combinations possible• Genetic algorithm• efficient and fast• optimization complete in a matter of minutes• mating combinations governed only by “fitness”CS 460, Session 268The Genetic Algorithm Approach• Define limits of variable parameters• Generate a random population of designs• Assess “fitness” of designs•Mate selection• Crossover•Mutation• Reassess fitness of new populationCS 460, Session 269A “Population”CS 460, Session 2610Ranking by Fitness:CS 460, Session 2611Mate Selection:Fittest are copied and replaced less-fitCS 460, Session 2612Mate Selection Roulette:Increasing the likelihood but not guaranteeing the fittest reproduction11%38%7%16%0%3%25%CS 460, Session 2613Crossover:Exchanging information through some part of information (representation)CS 460, Session 2614Mutation: Random change of binary digits from 0 to 1 and vice versa (to avoid local minima)CS 460, Session 2615Best DesignCS 460, Session 2616The GA CycleCS 460, Session 2617Genetic AlgorithmsAdv: •Good to find a region of solution including the optimal solution. But slow in giving the optimal solutionCS 460, Session 2618Genetic Approach•When applied to strings of genes, the approaches are classified as genetic algorithms (GA) •When applied to pieces of executable programs, the approaches are classified as genetic programming (GP) •GP operates at a higher level of abstraction than GACS 460, Session 2619Example: Karl Sim’s creatures• Creatures• Sea Horse• SnakeCS 460, Session 2620Typical


View Full Document

USC CSCI 460 - session26

Documents in this Course
Load more
Download session26
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view session26 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view session26 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?