Optimality of Ant Foraging Jason Green Supervisor: Bernd Meyer Is it really optimal, and how do we find that out?

Slides:



Advertisements
Similar presentations
Comparing Effectiveness of Bioinspired Approaches to Search and Rescue Scenarios Emily Shaeffer and Shena Cao 4/28/2011Shaeffer and Cao- ESE 313.
Advertisements

New Mexico Computer Science For All Designing and Running Simulations Maureen Psaila-Dombrowski.
VEHICLE ROUTING PROBLEM
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
DECISION SUPPORT SYSTEM ARCHITECTURE: THE MODEL COMPONENT.
Swarm algorithms COMP308. Swarming – The Definition aggregation of similar animals, generally cruising in the same direction Termites swarm to build colonies.
GoldSim 2006 User Conference Slide 1 Vancouver, B.C. The Submodel Element.
Ant Colony Optimization. Brief introduction to ACO Ant colony optimization = ACO. Ants are capable of remarkably efficient discovery of short paths during.
LaValle, Steven M. "Rapidly-Exploring Random Trees A Цew Tool for Path Planning." (1998) RRT Navigation.
Biologically Inspired Computation Lecture 10: Ant Colony Optimisation.
Path Planning with the humanoid robot iCub Semester Project 2008 Pantelis Zotos Supervisor: Sarah Degallier Biologically Inspired Robotics Group (BIRG)
Ant Optimization in NetLogo By: Stephen Johnson. Optimization Wide spread applicability Much easier through the use of computers Very clear results.
Better Ants, Better Life? Hybridization of Constraint Propagation and Ant Colony Optimization Supervisors: Bernd Meyer, Andreas Ernst Martin Held Jun 2nd,
458 Interlude (Optimization and other Numerical Methods) Fish 458, Lecture 8.
Ant Colonies As Logistic Processes Optimizers
Ants-based Routing Marc Heissenbüttel University of Berne
Ant Colony Optimization Optimisation Methods. Overview.
Better Ants, Better Life? Hybridization of Constraint Programming and Ant Colony Optimization Supervisors: Dr. Bernd Meyer, Dr. Andreas Ernst Martin Held.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Descriptive Modelling: Simulation “Simulation is the process of designing a model of a real system and conducting experiments with this model for the purpose.
Biologically Inspired Computation Ant Colony Optimisation.
Ant Colony Optimization: an introduction
Ant Colony Optimization (ACO): Applications to Scheduling
FORS 8450 Advanced Forest Planning Lecture 19 Ant Colony Optimization.
Meet the Kiwis…. Population of kiwis… Codes… Species Region GS-Great Spotted, NIBr-NorthIsland Brown, Tok-Southern Tokoeka NWN-North West Nelson, CW-Central.
Distributed Systems 15. Multiagent systems and swarms Simon Razniewski Faculty of Computer Science Free University of Bozen-Bolzano A.Y. 2014/2015.
Minimal Spanning Trees What is a minimal spanning tree (MST) and how to find one.
CSM6120 Introduction to Intelligent Systems Other evolutionary algorithms.
Genetic Algorithms and Ant Colony Optimisation
Swarm Computing Applications in Software Engineering By Chaitanya.
Swarm Intelligence 虞台文.
Algorithms and their Applications CS2004 ( )
Art 315 Lecture 6 Dr. J. Parker. Variables Variables are one of a few key concepts in programming that must be understood. Many engineering/cs students.
Random Number Generators 1. Random number generation is a method of producing a sequence of numbers that lack any discernible pattern. Random Number Generators.
Ant Colony Optimization. Summer 2010: Dr. M. Ameer Ali Ant Colony Optimization.
Object Oriented Programming Assignment Introduction Dr. Mike Spann
Biologically Inspired Computation Ant Colony Optimisation.
Simulation is the process of studying the behavior of a real system by using a model that replicates the behavior of the system under different scenarios.
March 23 & 28, Csci 2111: Data and File Structures Week 10, Lectures 1 & 2 Hashing.
March 23 & 28, Hashing. 2 What is Hashing? A Hash function is a function h(K) which transforms a key K into an address. Hashing is like indexing.
Ant colony optimization. HISTORY introduced by Marco Dorigo (MILAN,ITALY) in his doctoral thesis in 1992 Using to solve traveling salesman problem(TSP).traveling.
DRILL Answer the following question’s in your notebook: 1.How does ACO differ from PSO? 2.What does positive feedback do in a swarm? 3.What does negative.
Remarks on the TAU grid adaptation Thomas Gerhold.
5 Fundamentals of Ant Colony Search Algorithms Yong-Hua Song, Haiyan Lu, Kwang Y. Lee, and I. K. Yu.
1 1 Slide © 2004 Thomson/South-Western Simulation n Simulation is one of the most frequently employed management science techniques. n It is typically.
Ant Colony Optimization Andriy Baranov
Biologically Inspired Computation Ant Colony Optimisation.
Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems International Conference on Mechatronics and Automation.
Ant Colony Optimisation. Emergent Problem Solving in Lasius Niger ants, For Lasius Niger ants, [Franks, 89] observed: –regulation of nest temperature.
CHAPTER 4 Designing Studies
Simulating the Evolution of Ant Behaviour in Evaluating Nest Sites
School of Computing Clemson University Fall, 2012
Lecture XVII: Distributed Systems Algorithms Inspired by Biology
Deploying PAWS: Field Optimization of the Protection Assistant for Wildlife Security Fang et al.
More about Tests and Intervals
metaheuristic methods and their applications
CHAPTER 4 Designing Studies
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
CHAPTER 4 Designing Studies
Redundant Ghost Nodes in Jacobi
traveling salesman problem
Ants and the TSP.
CHAPTER 4 Designing Studies
CHAPTER 4 Designing Studies
CHAPTER 4 Designing Studies
CHAPTER 4 Designing Studies
CHAPTER 4 Designing Studies
CHAPTER 4 Designing Studies
Foraging Year 8 Soaring Eagles.
Presentation transcript:

Optimality of Ant Foraging Jason Green Supervisor: Bernd Meyer Is it really optimal, and how do we find that out?

Context Field Studies Laboratory Studies Mathematical Models Simulations

Pheromone trails

Y - Bridge ● At a fork in the trail, more ants go towards the better food source

Y - Bridge ● The probability of an ant going a certain direction is:

Y - Bridge ● The probability of an ant going a certain direction is:

Simulating the model ● The mathematical model generalised for a grid structure

Context Field Studies Laboratory Studies Mathematical Models Simulations

Mathematical Model vs Simulations ● Mathematical models allow us to solve the problem in a closed system – Eg. Determining when the colony will converge on a single food source ● Mathematical models allow us to determine if a certain behaviour holds over a range of values – Eg. Convergence occurs irrespective of the amount of pheromone deposited ● Mathematical Models alone get too complicated – The more parameters involved make it harder to solve ● Simulations allows us to see what is actually happening – Easier to recognise patterns – Easier to assess behaviour

Existing Simulations ● Only made for proof of concept ● Lack of resolution ● Only simple behaviour Not good enough!

My Solution ● Improve the resolution ● Add extra behaviours – Crowding – True random walk – Any more? ● Fully customisable ● Gather statistical data ● Automatic Optimisation

What I have done so far ● Created a Heirarchical grid data strucutre – Only allocates memory to nodes that are in use

What I have done so far ● Created a Heirarchical grid data strucutre – Pointers to neighbouring cells for faster navigation

My Solution ● Improve the resolution ● Add extra behaviours – Crowding – True random walk – Any more? ● Fully customisable ● Gather statistical data ● Automatic Optimisation