Csm6120 introduction to intelligent systems
This presentation is the property of its rightful owner.
Sponsored Links
1 / 26

CSM6120 Introduction to Intelligent Systems PowerPoint PPT Presentation


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

CSM6120 Introduction to Intelligent Systems. Other evolutionary algorithms. Today. Other evolutionary algorithms Genetic programming Ant colony optimization Particle swarm optimization Knowledge representation Several approaches. The GA cycle. chosen parents. recombination. children.

Download Presentation

CSM6120 Introduction to Intelligent Systems

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


Csm6120 introduction to intelligent systems

CSM6120Introduction to Intelligent Systems

Other evolutionary algorithms


Today

Today

  • Other evolutionary algorithms

    • Genetic programming

    • Ant colony optimization

    • Particle swarm optimization

  • Knowledge representation

    • Several approaches


The ga cycle

The GA cycle

chosen

parents

recombination

children

selection

modification

modified

children

parents

evaluation

population

evaluated children

deleted

members

discard


Genetic programming

Genetic programming

  • Devised by John Koza

  • 36 Human-Competitive Results Produced by Genetic Programming

    • http://www.genetic-programming.com/humancompetitive.html


Genetic programming1

Genetic programming

*

*

B

A

A


Koza s algorithm

Koza’s algorithm

  • Trees consist of functions and terminals

  • Choose a set of functions and terminals, e.g

    { +, -, *, /, √}; {A,B}

  • Generate random programs (trees) which are syntactically correct

  • Follow a GA-like procedure

    • Evaluate fitness, select parents

    • Apply crossover and mutation


Crossover

Crossover

/

*

A

/

X

A

-

*

/

/

A

A

A

A

A

A

A

/

A

/

*

A

-

/

/

*

A

A

A

A

A

A

A


Examples

Examples

  • Symbolic regression (function finding)

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

    • http://www.geneticprogramming.org/symbolic/main.htm

  • Moon lander!

    • http://genetic.moonlander.googlepages.com/


Other bio inspired approaches

Other bio-inspired approaches

  • Simulated annealing

  • Ant colony optimization (ACO)

  • Particle swarm optimization (PSO)

  • ...


Ant colony optimization

Ant Colony Optimization

  • Nature: unsupervised complex problem solving

  • Simple agents working locally, displaying global intelligence

    • Ants are capable of finding the shortest route between food source and nest

    • Also react to changes in environment (obstructions etc)

nest

food source


Ant colony optimization1

Ant Colony Optimization

  • Shortest path is discovered via pheromone trails

    • Each ant moves ‘randomly’

    • Pheromone is deposited on path

    • Ants detect lead ant’s path, inclined to follow

    • More pheromone on path increases probability of path being followed

nest

food source


Ant colony optimization2

Ant Colony Optimization

  • Problem formulation for ACO

    • Graph representation (nodes and edges)

    • Heuristic desirability of edges

    • Construction of feasible solutions

    • Pheromone update rule (pheromone attached to edges)

  • Also we need a probabilistic transition rule

    • This evaluates the next step for an ant and considers both the heuristic desirability of an edge and the amount of pheromone deposited on the edge

    • The edge with the highest value of this combination is chosen by the artificial ant


Aco algorithm

ACO algorithm

  • Key idea: virtual pheromone accumulated on path edges

  • Algorithm for one ant:

    • Select starting node at random

    • While not-finished

      • Evaluate all edges from this node

      • Select the best-looking edge via probabilistic transition rule

      • Deposit artificial pheromone on the chosen edge

    • Finished path is a potential solution, analysed for optimality


Aco algorithm1

ACO algorithm

(transition rule)

Ants

Choose next

Evaluate

continue

position

node

Begin

stop

Gather

Generate

ants

solutions

Return best

continue

Evaluate

stop

Update

solution

position

pheromone


Aco tsp

ACO: TSP

Demo of ACO applied to large(ish) dynamic TSP (where cities are moved after a number of iterations)

  • http://www.tjhsst.edu/~rlatimer/techlab07/Students/RWard/ProjectV1-6/Project/tsp2.html

  • Performs well!

    • Combines heuristic knowledge with discovered knowledge


Particle swarm optimization

Particle Swarm Optimization

  • Based on the flocking/swarming behaviour of birds/insects


The basic idea

The basic idea

  • Each particle is searching for the optimum and encodes a solution (like the GA approach)

  • Each particle is moving (can’t search otherwise!), and hence has a velocity

  • Each particle remembers the position it was in where it had its best result so far (its personal best)

  • But this would not be much good on its own; particles need help in figuring out where to search


The basic idea1

The basic idea

  • The particles in the swarm co-operate

    • They exchange information about what they’ve discovered in the places they have visited

  • The co-operation need only be very simple; in basic PSO it is like this:

    • A particle has a neighbourhood associated with it

    • A particle knows the fitnesses of those in its neighbourhood, and uses the position of the one with best fitness

    • This position is simply used to adjust the particle’s velocity


Initialization positions and velocities

Initialization: Positions and velocities


What a particle does

What a particle does

  • In each time-step, a particle has to move to a new position

  • It does this by adjusting its velocity via:

    • The current velocity +

    • A weighted random portion in the direction of its personalbest +

    • A weighted random portion in the direction of the neighbourhoodbest +

    • A weighted random portion in the direction of the global best

  • Having worked out a new velocity, its position is simply its old position plus the new velocity


Pso search

PSO search


Neighbourhoods

Neighbourhoods

geographical

social


Neighbourhoods1

Neighbourhoods

Global


Csm6120 introduction to intelligent systems

  • PSO visualisation

    • http://www.projectcomputing.com/resources/psovis/index.html

  • More info on PSO

    • http://www.swarmintelligence.org/


Multi objective optimisation

Multi-objective optimisation

  • Sometimes we're searching for an answer which has to be optimal in several aspects

  • For example:

    • Finding the quickest and cheapest flight

    • Finding the lightest and strongest construction material

    • Finding the game strategy that will maximise trade profit, cities explored/conquered and health of your character.

  • Evolutionary algorithms can search the multi-objective space of solutions

    • Fitness function needs to combine the scores for the different objectives


Summary

Summary

  • What we looked at:

    • Genetic algorithms

    • Genetic programming

    • Other bio-inspired techniques

  • These are often applied to search/optimisation problems that are very challenging

  • Free (GNU licsensed) book: Global Optimization Algorithms – Thomas Weise

    • http://www.it-weise.de/projects/book.pdf


  • Login