Formation of an ant cemetery: swarm intelligence or statistical accident 報告者 : 王敬育.

Slides:



Advertisements
Similar presentations
Stochastic Simulations Monday, 9/9/2002 Monte Carlo simulations are generally concerned with large series of computer experiments using uncorrelated random.
Advertisements

HIDDEN FACES INVESTIGATION
Swarm-Based Traffic Simulation
Comparing Effectiveness of Bioinspired Approaches to Search and Rescue Scenarios Emily Shaeffer and Shena Cao 4/28/2011Shaeffer and Cao- ESE 313.
10.2 Diffusion and Cellular Automata. Simulating Motion: Cellular Automata If all we have to work with is a grid of cells (spreadsheet), how can we simulate.
RCQ-ACS: RDF Chain Query Optimization Using an Ant Colony System WI 2012 Alexander Hogenboom Erasmus University Rotterdam Ewout Niewenhuijse.
It’s a Small World by Jamie Luo. Introduction Small World Networks and their place in Network Theory An application of a 1D small world network to model.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
Ant Inspired Data Mining Brandon Emerson April 22,
專題研討 --- 心得報告 Face Recognition System with Genetic Algorithm and ANT Colony Optimization International Journal of Innovation, Management and Technology,
Biased Coins Or “Why I am considering buying 840 blank dice” Michael Gibson.
Technion –Israel Institute of Technology Computer Networks Laboratory A Comparison of Peer-to-Peer systems by Gomon Dmitri and Kritsmer Ilya under Roi.
A Randomized Gathering Algorithm for Multiple Robots with Limited Sensing Capabilities Noam Gordon Israel A. Wagner Alfred M. Bruckstein Technion – Israel.
Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.
Ant Colony Optimization. Brief introduction to ACO Ant colony optimization = ACO. Ants are capable of remarkably efficient discovery of short paths during.
Biologically Inspired Computation Lecture 10: Ant Colony Optimisation.
2001 Winter CS215 Course Project Simulation Comparison of Routing Algorithms for Multicast with Bandwidth Reservation Zhihong Duan
ECMANSI - Energy Conserving Multicast for Ad- Hoc Networks with Swam Intelligence Chaiporn Jaikaeo Vinay Sridhara Chien-Chung Shen.
後卓越進度報告 蔡育仁老師實驗室 2006/11/13. Distribute Source Coding (DSC) in WSNs Distributed source coding (DSC) is a data compression technique to reduce the redundancy.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Kinodynamic Planning and Navigation with Movable Obstacles.
Theseus - The virtual spider robot 報告者 : 王敬育. Objectives and methods design a virtual, to simulate the completeness & consistency of the spider ’ s web.
Continuum Crowds Adrien Treuille, Siggraph 王上文.
The Small World Phenomenon: An Algorithmic Perspective by Anton Karatoun.
Physics of fusion power
Ant Colony Optimization: an introduction
Key terms in Sampling Sample: A fraction or portion of the population of interest e.g. consumers, brands, companies, products, etc Population: All the.
Lecture 12 Monte Carlo Simulations Useful web sites:
L/O/G/O Ant Colony Optimization M1 : Cecile Chu.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
Chapter 5.4 Artificial Intelligence: Pathfinding.
Sampling. Concerns 1)Representativeness of the Sample: Does the sample accurately portray the population from which it is drawn 2)Time and Change: Was.
CH 9 SEC 1 DESCRIBING MOTION GOAL/PURPOSE IN THIS SECTION STUDENTS LEARN HOW TO DESCRIBE MOTION USING TERMS DISTANCE, DISPLACEMENT, IN THIS SECTION STUDENTS.
Introduction to Inferential Statistics. Introduction  Researchers most often have a population that is too large to test, so have to draw a sample from.
Polymer Dynamic.
Particle dynamics in electron FFAG Shinji Machida KEK FFAG04, October 13-16, 2004.
Collection of Data Chapter 4. Three Types of Studies Survey Survey Observational Study Observational Study Controlled Experiment Controlled Experiment.
Selected topics in Ant 2002 By Hanh Nguyen. Selected topics in Ant 2002 Homogeneous Ants for Web Document Similarity Modeling and Categorization Ant Colonies.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
Accelerating Precursory Activity in Statistical Fractal Automata Dion Weatherley and Peter Mora QUAKES, Univ. of Qld., Australia.
The probability of a particle escaping a given cell so that it can it can move either to the cell’s right or left can be calculated as: Where  is defined.
Diffusion in Disordered Media Nicholas Senno PHYS /12/2013.
Examining Data. Constructing a variable 1. Assemble a set of items that might work together to define a construct/ variable. 2. Hypothesize the hierarchy.
Collection of Data Jim Bohan
Chapter 5 Sampling Distributions. The Concept of Sampling Distributions Parameter – numerical descriptive measure of a population. It is usually unknown.
Sampling and Statistical Analysis for Decision Making A. A. Elimam College of Business San Francisco State University.
Po-Yu Chen, Zan-Feng Kao, Wen-Tsuen Chen, Chi-Han Lin Department of Computer Science National Tsing Hua University IEEE ICPP 2011 A Distributed Flow-Based.
Janine Bolliger Swiss Federal Research Institute WSL/FNP,
Condensation in/of Networks Jae Dong Noh NSPCS08, 1-4 July, 2008, KIAS.
Ant Colony Optimization Andriy Baranov
M ulti m edia c omputing laboratory Biologically Inspired Cooperative Routing for Wireless Mobile Sensor Networks S. S. Iyengar, Hsiao-Chun Wu, N. Balakrishnan,
Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems International Conference on Mechatronics and Automation.
Percolation Percolation is a purely geometric problem which exhibits a phase transition consider a 2 dimensional lattice where the sites are occupied with.
© J. Christopher Beck Lecture 16: Local Search.
Evaluating Hypotheses. Outline Empirically evaluating the accuracy of hypotheses is fundamental to machine learning – How well does this estimate its.
A Secure Routing Protocol with Intrusion Detection for Clustering Wireless Sensor Networks International Forum on Information Technology and Applications.
Quantifying Scale and Pattern Lecture 7 February 15, 2005
Self-Organization and Templates in Swarm Computing
Navigation In Dynamic Environment
A way of collecting, organizing, and interpreting data
Department of Computer Science University of York
Overview of SWARM INTELLIGENCE and ANT COLONY OPTIMIZATION
Lecture 9: Tabu Search © J. Christopher Beck 2005.
Daniela Stan Raicu School of CTI, DePaul University
Random WALK, BROWNIAN MOTION and SDEs
traveling salesman problem
Common Types of Simulations
Examining Data.
Equilibrium Restricted Solid-on-Solid Models with
Presentation transcript:

Formation of an ant cemetery: swarm intelligence or statistical accident 報告者 : 王敬育

Abstract The model of artificial ants is proposed by Deneubourg in 1991 。 1.pick & drop 2.swarm intelligence A new model with: 1.less intelligence 2.clustering can be explained by a statistical effect 3.the cemetery formation is not a collective phenomenon

Deneubourg ’ s model The key steps are the pick up & lay down phases: the probabilities K 1 , K 2 are the parameters (K 1 = 0.1 , K 2 = 0.3 ) f : a fraction representing the number of corpses memorized by the ant along its own path 。 f = N / T N: the numbers of items that encountered in the path T: the last T motion steps (T = 50)

The minimal model Pick up and deposition rule (1)Each time an unloaded ant sees a body on one of its eight neighboring cells , it loads it with probability 1 。 If there are several bodies , it chooses one of them 。 (2) After the ant has moved at least one step away , the corpse is released provided the ant is surrounded by one or more dead bodies in its eight-cell neighborhood 。 If this is the case , the ant deposits the body in a randomly chosen empty neighboring cell 。

The minimal model (3) Contrarily to Deneubourg ’ s model , our ants never walk on a corpse 。 (maybe trapped in the cluster) Displacement rule (1)The ants move one cell at a time , but heading in the same direction for a pre-assigned random number of steps 。 (the steps we call free path) After the number of steps , the ants select at random a new direction of motion among the eight possible lattice directions and a new length for the next free path 。

The minimal model (2) The free path is chosen uniformly from the set {1,2,3 … L} , independently for each ant 。 (in this model L = 100) (3) When a corpse lies on the trajectory of the ant , a new random direction is selected as well as a new free path length 。 (4) To deal with obstacles: an ant which faces a blocking sit chooses a new direction of a new direction of motion and a new free path length 。

Result and comparisons What is the mechanism that biases the dynamics so as to form only one large cluster? In Deneubourg ’ s model: from the intelligence of ants In minimal model: the dynamics is biased towards forming larger clusters , because : (1) small ones are more likely to disappear under statistical fluctuations (2) clusters cannot build up from nothing

Cemetery formation with heterogeneities

Dynamics of the formation process The process scales as: N( t ) = F(M t ) N( t ) : the number of clusters at time t simulation M: the number of working ants in the simulation F: some unknown universal scaling function depending on the details of the model