The Power of Pheromones in Ant Foraging Christoph Lenzen Tsvetormira Radeva.

Slides:



Advertisements
Similar presentations
Limitations of Quantum Advice and One-Way Communication Scott Aaronson UC Berkeley IAS Useful?
Advertisements

Quantum Search of Spatial Regions Scott Aaronson (UC Berkeley) Joint work with Andris Ambainis (U. Latvia)
Truthful Mechanisms for Combinatorial Auctions with Subadditive Bidders Speaker: Shahar Dobzinski Based on joint works with Noam Nisan & Michael Schapira.
Chapter 5: Tree Constructions
Ulams Game and Universal Communications Using Feedback Ofer Shayevitz June 2006.
Improved Approximation for Orienting Mixed Graphs Iftah Gamzu CS Division, The Open Univ., and CS School, Tel-Aviv University Moti Medina EE School, Tel-Aviv.
Reactive and Potential Field Planners
110/6/2014CSE Suprakash Datta datta[at]cse.yorku.ca CSE 3101: Introduction to the Design and Analysis of Algorithms.
Shortest Vector In A Lattice is NP-Hard to approximate
1 SOFSEM 2007 Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles Eiji Miyano Kyushu Institute of Technology, Japan Joint.
ROBOT RENDEZVOUS: 3 OR MORE ROBOTS USING 1-DIMENSIONAL SEARCH !!!!!!! !
Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
Comparing Effectiveness of Bioinspired Approaches to Search and Rescue Scenarios Emily Shaeffer and Shena Cao 4/28/2011Shaeffer and Cao- ESE 313.
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
Sensor Based Planners Bug algorithms.
Motion Planning for Point Robots CS 659 Kris Hauser.
Lecture 7: Synchronous Network Algorithms
Polynomial Time Approximation Schemes Presented By: Leonid Barenboim Roee Weisbert.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
A Randomized Gathering Algorithm for Multiple Robots with Limited Sensing Capabilities Noam Gordon Israel A. Wagner Alfred M. Bruckstein Technion – Israel.
Christoph PODC 2009 Tight Bounds for Clock Synchronization Christoph Lenzen, Thomas Locher, and Roger Wattenhofer.
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.
The Antnet Routing Algorithm - A Modified Version Firat Tekiner, Z. Ghassemlooy Optical Communications Research Group, The University of Northumbria, Newcastle.
Navigating Nets: Simple algorithms for proximity search Robert Krauthgamer (IBM Almaden) Joint work with James R. Lee (UC Berkeley)
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
The Rate of Convergence of AdaBoost Indraneel Mukherjee Cynthia Rudin Rob Schapire.
A Robust Interference Model for Wireless Ad-Hoc Networks Pascal von Rickenbach Stefan Schmid Roger Wattenhofer Aaron Zollinger.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
Investigation of antnet routing algorithm by employing multiple ant colonies for packet switched networks to overcome the stagnation problem Firat Tekiner.
Job Scheduling Lecture 19: March 19. Job Scheduling: Unrelated Multiple Machines There are n jobs, each job has: a processing time p(i,j) (the time to.
Preference Analysis Joachim Giesen and Eva Schuberth May 24, 2006.
1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)
Motion Planning in Dynamic Environments Two Challenges for Optimal Path planning.
OPTIMAL PHEROMONE UTILIZATION Roman Kecher Joint work with: Yehuda Afek and Moshe Sulamy Tel-Aviv University.
Distributed Algorithms on a Congested Clique Christoph Lenzen.
Distributed Verification and Hardness of Distributed Approximation Atish Das Sarma Stephan Holzer Danupon Nanongkai Gopal Pandurangan David Peleg 1 Weizmann.
Genetic Algorithms and Ant Colony Optimisation
1 Constant Following Distance Simulations CS547 Final Project December 6, 1999 Jeremy Elson.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Search Algorithms Winter Semester 2004/ Jan.
1 Autonomous Foraging in a Simulated Environment.
Multiple-Source Shortest Paths in Planar Graphs Allowing Negative Lengths Philip Klein Brown University.
Franck Petit INRIA, LIP Lab. Univ. / ENS of Lyon France Optimal Probabilistic Ring Exploration by Semi-Synchronous Oblivious Robots Joint work with Stéphane.
David Luebke 1 10/16/2015 CS 332: Algorithms Go Over Midterm Intro to Graph Algorithms.
Consensus and Its Impossibility in Asynchronous Systems.
Kavita Singh CS-A What is Swarm Intelligence (SI)? “The emergent collective intelligence of groups of simple agents.”
Ant Colony Optimization. Summer 2010: Dr. M. Ameer Ali Ant Colony Optimization.
Private Approximation of Search Problems Amos Beimel Paz Carmi Kobbi Nissim Enav Weinreb (Technion)
1 Splay trees (Sleator, Tarjan 1983). 2 Goal Support the same operations as previous search trees.
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
Quantum random walks and quantum algorithms Andris Ambainis University of Latvia.
The Cost of Fault Tolerance in Multi-Party Communication Complexity Binbin Chen Advanced Digital Sciences Center Haifeng Yu National University of Singapore.
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.
Data Structures Haim Kaplan & Uri Zwick December 2013 Sorting 1.
Biologically Inspired Computation Ant Colony Optimisation.
Andrea CLEMENTI Radio Networks The Model Broadcast.
Jaroslaw Kutylowski 1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Maintaining Communication Between an Explorer and a Base.
Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems International Conference on Mechatronics and Automation.
Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.
Computationally Efficient Fault Tolerant ANTS
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Spectral Clustering.
Enumerating Distances Using Spanners of Bounded Degree
Fine-Grained Complexity Analysis of Improving Traveling Salesman Tours
Great Ideas: Algorithm Implementation
Data Structures Sorting Haim Kaplan & Uri Zwick December 2014.
traveling salesman problem
Clustering.
Motion Planning for a Point Robot (1/2)
Presentation transcript:

The Power of Pheromones in Ant Foraging Christoph Lenzen Tsvetormira Radeva

Background Feinerman and Korman, DISC ’12: Memory Lower Bounds for Randomized Collaborative Search and Implications to Biology Feinerman et al., PODC ’12: Collaborative Search on the Plane without Communication - ants search for a food item on 2-dimensional grid - ants know their position - no communication (after leaving the nest) - oracle provides B bits (before the search) - minimize T(k,D): time for k ants to find food in distance D

Background: (Trivial) Lower Bound minimize T(k,D): time for k ants to find food in distance D T(k,D) ≥ 2D T(k,D) ≥ 4D(D+1)/k

Background: Oracle Size Lower Bound Feinerman and Korman, DISC ’12: Memory Lower Bounds for Randomized Collaborative Search and Implications to Biology Feinerman et al., PODC ’12: Collaborative Search on the Plane without Communication …provides asymptotically matching bounds T(k,D) in O((D+D 2 /k) log 1-ε k) → Ω(log log k) oracle bits

Background: Algorithm by F. et al. 1. use oracle bits to encode (approximation of) k 2. for C=1,… for c=1,…,C move to random grid point in distance ≤ 2 c spiral search 4∙2 2c /k grid points return to nest

Background: Algorithm by F. et al. + asymptotically optimal… - …with constant approximation of k (log log k oracle bits) + highly fault-tolerant + asynchronous - Ω(log D) state bits - exact counting required

Background: Algorithm by F. et al. + asymptotically optimal… - …with constant approximation of k (log log k oracle bits) + highly fault-tolerant + asynchronous - Ω(log D) state bits - exact counting required Can we avoid this with indirect communication?

New: Adding Pheromones Assumption: ants “mark” each visited grid point - ants sense pheromones on adjacent points - also: ants now know direction of, but not distance to nest

Algorithm clock away

How It May Look Like Works asynchronously?

Analysis Proof: Suppose (x,y) is marked, but clock(x,y) not. → Some ant moved to (x,y) at some point, marking it. → It must still be there, as it would move to clock(x,y) and mark it upon leaving. Lemma 1 Suppose (x,y) is marked, but clock(x,y) is not. Then there is an ant on (x,y).

Analysis Lemma 1 Suppose (x,y) is marked, but clock(x,y) is not. Then there is an ant on (x,y). Corollary If an ant reaches distance D from the nest, 8D asynchronous rounds later all grid points in distance at most D from the nest are visited.

Analysis Proof: There are 4D(D+1) unmarked grid points within distance D. Each move marks a grid point or leads away from the nest. → Within D+4D(D+1)/k rounds, an ant reaches distance D. Lemma 2 Within D+4D(D+1)/k asynchronous rounds, an ant reaches distance D from the nest.

Analysis - if ants move counterclockwise if the clockwise direction is explored, this improves to factor proof goes by showing an analog to Lemma 1 for the counterclockwise direction Theorem The algorithm is 5.5-competitive.

Summary of Results + asymptotically optimal algorithm + very simple (no memory, no counting, deterministic) + asynchronous - no fault-tolerance/robustness - requires repelling pheromone

Summary of Results + asymptotically optimal algorithm + very simple (no memory, no counting, deterministic) + asynchronous - no fault-tolerance/robustness - requires repelling pheromone

Robustness Issues - obstacles - dying/disappearing ants - self-stabilization - continuously appearing targets …

Robustness Issues - obstacles - dying/disappearing ants - self-stabilization - continuously appearing targets … deals locally with one dying ant (maybe two with modification) Also move towards nest if unexplored!

Robustness Issues - obstacles - dying/disappearing ants - self-stabilization - continuously appearing targets … requires some degree of synchrony (analysis becomes challenging) Also move towards nest if unexplored!

Robustness Issues - obstacles - dying/disappearing ants - self-stabilization - continuously appearing targets … Multiple pheromones? repeat search with different pheromones

Summary of Results + asymptotically optimal algorithm + very simple (no memory, no counting, deterministic) + asynchronous - no fault-tolerance/robustness - requires repelling pheromone

Very Nice, but… …it turns out that ants don’t use pheromones that way! possible reasons: - cost in producing pheromone - danger of alerting enemies - robust variants inefficient or complicated? Is the approach useful in other contexts? - other animals? - robots sweeping an area (if literal, marking is implicit)?