Simulating the Evolution of Ant Behaviour in Evaluating Nest Sites

Slides:



Advertisements
Similar presentations
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
Advertisements

Optimizing genetic algorithm strategies for evolving networks Matthew Berryman.
Valery Frolov.  The algorithm  Fitness function  Crossover  Mutation  Elite individuals  Reverse mutations  Some statistics  Run examples.
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Optimality of Ant Foraging Jason Green Supervisor: Bernd Meyer Is it really optimal, and how do we find that out?
Fast Evolutionary Optimisation Temi avanzati di Intelligenza Artificiale - Lecture 6 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Selecting Informative Genes with Parallel Genetic Algorithms Deodatta Bhoite Prashant Jain.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Travelling Salesman Problem: Convergence Properties of Optimization Algorithms Group 2 Zachary Estrada Chandini Jain Jonathan Lai.
Genetic algorithms Prof Kang Li
Optimization of multi-pass turning operations using ant colony system Authors: K. Vijayakumar, G. Prabhaharan, P. Asokan, R. Saravanan 2003 Presented by:
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
1 CS 391L: Machine Learning: Experimental Evaluation Raymond J. Mooney University of Texas at Austin.
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
1 Machine Learning: Lecture 12 Genetic Algorithms (Based on Chapter 9 of Mitchell, T., Machine Learning, 1997)
FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem Sang-Moon Soak Speaker: 洪嘉涓、陳麗徽、李振宇、黃怡靜.
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
Chapter 9 Genetic Algorithms.  Based upon biological evolution  Generate successor hypothesis based upon repeated mutations  Acts as a randomized parallel.
Innovative and Unconventional Approach Toward Analytical Cadastre – based on Genetic Algorithms Anna Shnaidman Mapping and Geo-Information Engineering.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Genetic Algorithm (Knapsack Problem)
Haploid-Diploid Evolutionary Algorithms
Chapter 14 Genetic Algorithms.
Genetic Algorithms.
Genetic Algorithms.
Dr. Kenneth Stanley September 11, 2006
Introduction to Quantitative Research
Particle Swarm Optimization (2)
Bulgarian Academy of Sciences
School of Computer Science & Engineering
A Study of Genetic Algorithms for Parameter Optimization
Example: Applying EC to the TSP Problem
CSC 380: Design and Analysis of Algorithms
Multy- Objective Differential Evolution (MODE)
Quick Review: What is evolution?
An evolutionary approach to solving complex problems

Haploid-Diploid Evolutionary Algorithms
Yu-Chi Ho Jonathan T. Lee Harvard University Sep. 7, 2000
Example: Applying EC to the TSP Problem
Sodarace: Exploring Evolution with Computational Thinking
Example: Applying EC to the TSP Problem
EVOLUTION: DARWIN vs. LAMARCK
“Hard” Optimization Problems
Introduction to Artificial Intelligence Lecture 11: Machine Evolution
Methods and Materials (cont.)
Algorithms and data structures
Boltzmann Machine (BM) (§6.4)
Searching for solutions: Genetic Algorithms
A Gentle introduction Richard P. Simpson
Machine Learning: UNIT-4 CHAPTER-2
Genetic Algorithms & Simulated Evolution
Evolution proceeds inevitably from simple toward the more complex
Testing Hypotheses about a Population Proportion
CSC 380: Design and Analysis of Algorithms
Coevolutionary Automated Software Correction
Presentation transcript:

Simulating the Evolution of Ant Behaviour in Evaluating Nest Sites James Marshall, Tim Kovacs, Anna Dornhaus and Nigel Franks

Purpose of Work Use an Evolutionary Algorithm to study evolution of behaviour in real ants Note: we use EA to optimise our simulation, not to simulate real evolution Why did ants evolve this way? Are other behaviours just as good / better? What algorithms do ants use to self-organise?

Evolutionary Trajectory of Ants Two approaches to simulation of evolution: simulate evolution in detail (hard!) compare specific alternative behaviours (easier)

Nest Size Evaluation Leptothorax albipennis appears to measure nest volume using an algorithm called Buffon’s needle Each ant makes 2 visits to potential nest: - Visit 1: lay pheromone trail - Visit 2: assess pheromone density Between visits ant returns to old nest site

Movement of a Real Ant Figure from: Mallon, E.B. and Franks, N.R. Ants Estimate Area Using Buffon’s Needle. Proc. R. Soc. Lond. B 267(2000) 765-770.

1-pass vs 2-pass Evaluation of Nest Size Why visit potential nest twice? Nest relocation often occurs in response to attacks and is time-critical Why not do both steps during same visit?

Experiments Simulate nest size evaluation and compare 1-pass and 2-pass strategies. Most importantly: does 1-pass work? i.e. can we implement Buffon’s needle with it? Also: which classifies nest size more reliably? which requires less time in nest?

Experimental Details Assumptions: Ant movement is a constrained random walk Ants measure pheromone density using an arousal level increase level when trail crossed decrease level on all time steps

Experimental Details 3 sizes of square nest used Half of ants use 1-pass and half use 2-pass Ants evolve the following characteristics: total time spent in nest t arousal decay rate classification divisor d

Experimental Details Ant converts arousal level at end of visit to size classification e using e = (c-1) -min[int(r/d), c-1] where c is number of size categories (3), r is arousal level and d is classification divisor

Fitness Calculation An ant’s fitness is given by: f = -q |e - s| - t where q = 1000 provides selective pressure towards assessment quality s is actual nest size and t is time spent in nest

Evolutionary Algorithm Rank population by fitness cull least fit 1/3 of population replace with offspring from fittest 2/3 Generate offspring: Apply uniform crossover to adjacently ranked pairs of ants with probability 10% Mutate with probability 1%: change value uniformly at random by up to 10%

Results No significant difference between 1 and 2- pass in: number of trials which reached 100% accuracy number of generations needed to reach it total time spent in nest Conclusion: Buffon’s needle can be implemented with 1-pass But 1-pass spent no less time in nest Perhaps our simulation didn’t capture something important

Discussion Note that 2-pass requires time to make an extra trip to potential nest, so 1-pass is faster Why do ants use 2-pass? Evolutionary accident? Maybe ants can’t lay and detect pheromones simultaneously We’ve shown 2-pass isn’t necessary algorithmically