VI" Autonomous Agents" &" Self-Organization! Part A" Nest Building! Autonomous Agent! Nest Building by Termites" (Natural and Artificial)!

Similar documents
Decrease in Number of Piles. Lecture 10. Why does the number of piles decrease? More Termites. An Experiment to Make the Number Decrease More Quickly

Self-Organization in Social Insects

Swarm Intelligence W13: From Aggregation and Segregation to Structure Building

Introduction to Swarm Robotics

Outline. 1 Initial Definitions. 2 Examples of SI in Biology. 3 Self-Organization. 4 Stigmergy. 5 Swarm Robotics

Templates. Template is a pattern used to construct another pattern Used in conjunction with sorting behaviour:

Modelling the Role of Trail Pheromone in the Collective Construction of Termite Royal Chambers

depending only on local relations. All cells use the same updating rule, Time advances in discrete steps. All cells update synchronously.

Models of Termite Nest Construction Daniel Ladley Computer Science 2003/2004

Swarm Intelligence Systems

Sensitive Ant Model for Combinatorial Optimization

Distributed Intelligent Systems W12: Distributed Building and. and Artificial Systems

StarLogo Simulation of Streaming Aggregation. Demonstration of StarLogo Simulation of Streaming. Differentiation & Pattern Formation.

Evolving Agent Swarms for Clustering and Sorting

Outline. Ant Colony Optimization. Outline. Swarm Intelligence DM812 METAHEURISTICS. 1. Ant Colony Optimization Context Inspiration from Nature

Latency time and absence of group effect: two examples

Ant Foraging Revisited

Contact Information CS 420/527. Biologically-Inspired Computation. CS 420 vs. CS 527. Grading. Prerequisites. Textbook 1/11/12

Contact Information. CS 420/594 (Advanced Topics in Machine Intelligence) Biologically-Inspired Computation. Grading. CS 420 vs. CS 594.

Emergent Teamwork. Craig Reynolds. Cognitive Animation Workshop June 4-5, 2008 Yosemite

DRAFT VERSION: Simulation of Cooperative Control System Tasks using Hedonistic Multi-agents

Self-Organization Hypothesis. Lecture 18

Three-dimensional architectures grown by simple stigmergic agents

Meta-heuristic ant colony optimization technique to forecast the amount of summer monsoon rainfall: skill comparison with Markov chain model

Toward a Better Understanding of Complexity

Capacitor Placement for Economical Electrical Systems using Ant Colony Search Algorithm

Part B" Ants (Natural and Artificial)! Langton s Vants" (Virtual Ants)! Vants! Example! Time Reversibility!

SC741 W12: Division of Labor Part I: Fixed- and Variable- Threshold Algorithms

Stigmergy: a fundamental paradigm for digital ecosystems?

Measures of Work in Artificial Life

Computational Models of Complex Systems

The University of Birmingham School of Computer Science MSc in Advanced Computer Science. Behvaiour of Complex Systems. Termite Mound Simulator

Ant Colony Optimization: an introduction. Daniel Chivilikhin

Swarm-driven idea models From insect nests to modern architecture

3D HP Protein Folding Problem using Ant Algorithm

Metaheuristics and Local Search

Metaheuristics and Local Search. Discrete optimization problems. Solution approaches

Excavation and aggregation as organizing factors in de novo construction by mound-building termites

biologically-inspired computing lecture 22 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing

An ant colony algorithm for multiple sequence alignment in bioinformatics

Organization of work via the "common stomach" in social insects

From Local to Global Behavior in Intelligent Self-Assembly

Self-organizing nest construction in ants: individual worker behaviour and the nest s dynamics

Available online at ScienceDirect. Procedia Computer Science 20 (2013 ) 90 95

Mathematical modeling of complex systems Part 1. Overview

Title: Excavation and aggregation as organizing factors in de novo construction by moundbuilding

II. Spatial Systems. A. Cellular Automata. Structure. Cellular Automata (CAs) Example: Conway s Game of Life. State Transition Rule

Cellular Automata: Statistical Models With Various Applications

Nonlinear Diffusion. 1 Introduction: Motivation for non-standard diffusion

Complex Systems Made Simple

Lecture 20 : Markov Chains

Agent-based models of animal behaviour From micro to macro and back.

Self-Adaptive Ant Colony System for the Traveling Salesman Problem

2. Transience and Recurrence

Chapter 7.1. States of Matter

IV. Evolutionary Computing. Read Flake, ch. 20. Assumptions. Genetic Algorithms. Fitness-Biased Selection. Outline of Simplified GA

Division of Labour and Task Allocation

Biology 182 Lecture I: What is Life?

Computer Simulations

II. Spatial Systems A. Cellular Automata 8/24/08 1

Pengju

Artificial Morphogenesis as an Example of Embodied Computation

Solving Numerical Optimization Problems by Simulating Particle-Wave Duality and Social Information Sharing

Reinforcement Learning and Control

BIOL Week 5. Nervous System II. The Membrane Potential. Question : Is the Equilibrium Potential a set number or can it change?

Particles with opposite charges (positives and negatives) attract each other, while particles with the same charge repel each other.

Local and Stochastic Search

Agent-Based Modeling Using Swarm Intelligence in Geographical Information Systems

V. Evolutionary Computing. Read Flake, ch. 20. Assumptions. Genetic Algorithms. Fitness-Biased Selection. Outline of Simplified GA

Ant Algorithms. Ant Algorithms. Ant Algorithms. Ant Algorithms. G5BAIM Artificial Intelligence Methods. Finally. Ant Algorithms.

Evolving Aggregation Behaviors in a Swarm of Robots

V. Evolutionary Computing. Read Flake, ch. 20. Genetic Algorithms. Part 5A: Genetic Algorithms 4/10/17. A. Genetic Algorithms

Chapter 17: Ant Algorithms

Natural Computing. Lecture 11. Michael Herrmann phone: Informatics Forum /10/2011 ACO II

CS 4700: Foundations of Artificial Intelligence

LECTURE 11: Monte Carlo Methods III

LOCAL NAVIGATION. Dynamic adaptation of global plan to local conditions A.K.A. local collision avoidance and pedestrian models

Pedestrian traffic models

Advanced Optical Communications Prof. R. K. Shevgaonkar Department of Electrical Engineering Indian Institute of Technology, Bombay

Entropy and Self-Organization in Multi- Agent Systems. CSCE 990 Seminar Zhanping Xu 03/13/2013

1 Primals and Duals: Zero Sum Games

Lecture 2: Linear regression

Competitive Learning for Deep Temporal Networks

Toward a Multi-Robot Coordination Formalism

Motivation. Evolution has rediscovered several times multicellularity as a way to build complex living systems

Complex Systems Made Simple

Nimble Nerve Impulses OO-005-DOWN

Cellular Automata Models of Pedestrian Dynamics

FIBER OPTICS. Prof. R.K. Shevgaonkar. Department of Electrical Engineering. Indian Institute of Technology, Bombay. Lecture: 15. Optical Sources-LASER

Interacting Vehicles: Rules of the Game

, and rewards and transition matrices as shown below:

Chapter 9 Implicit integration, incompressible flows

Online Learning with Experts & Multiplicative Weights Algorithms

Emergent Computing for Natural and Social Complex Systems

Biological self-organisation phenomena on weighted networks

ARTIFICIAL INTELLIGENCE

Mid Term-1 : Practice problems

CS261: Problem Set #3

Introduction to Reinforcement Learning

Greedy Algorithms My T. UF

Transcription:

VI" Autonomous Agents" &" Self-Organization! Part A" Nest Building! 1! 2! Autonomous Agent!! a unit that interacts with its environment " (which probably consists of other agents)!! but acts independently from all other agents in that it does not take commands from some seen or unseen leader,!! nor does an agent have some idea of a global plan that it should be following. " Flake (p. 261)! 3! Nest Building by Termites" (Natural and Artificial)! 4! Basic procedure! Resnick s Termites" ( Turmites )!! Wander randomly!! If you are not carrying anything and you bump into a wood chip, pick it up.!! If you are carrying a wood chip and you bump into another wood chip, put down the woodchip you are carrying! Resnick, Turtles, Termites, and Traffic Jams! 5! 6! 1!

Microbehavior of Turmites! 1.! Search for wood chip:! a)! If at chip, pick it up! b)! otherwise wiggle, and go back to (a)! 2.! Find a wood pile:! a)! If at chip, it s found! b)! otherwise wiggle, and go back to (a)! 3.! Find an empty spot and put chip down:! a)! If at empty spot, put chip down & jump away! b)! otherwise, turn, take a step, and go to (a)! Demonstration! Run Termites.nlogo! 7! 8! Decrease in Number of Piles! Why does the number of piles decrease?!! A pile can grow or shrink!! But once the last chip is taken from a pile, it can never restart!! Is there any way the number of piles can increase?!! Yes, and existing pile can be broken into two! 9! 10! Termites! More Termites! 2000 steps! 10 000 steps! num." piles! avg." size! num." piles! avg." size! 1000! 102! 15! 47! 30! chips in piles! 4000! 10! 3! 80! 240! Termite-Mediated Condensation!! Number of chips is conserved!! Chips do not move on own; movement is mediated by termites!! Chips preferentially condense into piles!! Increasing termites, increases number of chips in fluid (randomly moving) state!! Like temperature! 11! 12! 2!

An Experiment to Make the Number Decrease More Quickly!! Problem: piles may grow or shrink!! Idea: protect investment in large piles!! Termites will not take chips from piles greater than a certain size!! Result: number decreases more quickly!! Most chips are in piles!! But never got less than 82 piles! 13! Conclusion!! In the long run, the dumber strategy is better!! Although it s slower, it achieves a better result!! By not protecting large piles, there is a small probability of any pile evaporating!! So the smaller large piles can evaporate and contribute to the larger large piles!! Even though this strategy makes occasional backward steps, it outperforms the attempt to protect accomplishments! 14! Mound Building" by Macrotermes Termites! Structure of Mound! 15! figs. from Lüscher (1961)! 16! Construction of Mound! Termite Nests! (1) First chamber made by royal couple! (2, 3) Intermediate stages of development! (4) Fully developed nest! Fig. from Wilson (1971)! 17! 18! 3!

Alternatives to Self-Organization!! Leader!! directs building activity of group!! Blueprint (image of completion)!! compact representation of spatial/temporal relationships of parts!! Recipe (program)!! sequential instructions specify spatial/temporal actions of individual!! Template!! full-sized guide or mold that specifies final pattern! 19! Basic Mechanism of Construction" (Stigmergy)!! Worker picks up soil granule!! Mixes saliva to make cement!! Cement contains pheromone!! Other workers attracted by pheromone to bring more granules!! There are also trail and queen pheromones! Fig. from Solé & Goodwin! 20! Construction of Royal Chamber! Construction of Arch (1)! 21! Fig. from Bonabeau, Dorigo & Theraulaz! 22! Construction of Arch (2)! Construction of Arch (3)! Fig. from Bonabeau, Dorigo & Theraulaz! 23! Fig. from Bonabeau, Dorigo & Theraulaz! 24! 4!

Basic Principles!! Continuous (quantitative) stigmergy!! Positive feedback:!! via pheromone deposition!! Negative feedback:!! depletion of soil granules & competition between pillars!! pheromone decay! Deneubourg Model!! H (r, t) = concentration of cement pheromone in air at location r & time t!! P (r, t) = amount of deposited cement with still active pheromone at r, t!! C (r, t) = density of laden termites at r, t!!! = constant flow of laden termites into system! 25! 26! Equation for P" (Deposited Cement with Pheromone)! " t P (rate of change of active cement) =! k 1 C (rate of cement deposition by termites)! k 2 P (rate of pheromone loss to air)! " t P = k 1 C # k 2 P Equation for H" (Concentration of Pheromone)! " t H (rate of change of concentration) =! k 2 P (pheromone from deposited material)! k 4 H (pheromone decay)! + D H # 2 H (pheromone diffusion)! " t H = k 2 P # k 4 H + D H $ 2 H 27! 28! Equation for C" (Density of Laden Termites)! " t C (rate of change of concentration) =!! (flux of laden termites)! k 1 C (unloading of termites)! + D C # 2 C (random walk)! $#%(C#H) (chemotaxis: response to pheromone gradient)! " t C = # $ k 1 C + D C % 2 C $ &% ' ( C%H) 29! y! Explanation" of Divergence! C " V y "#x CV x "y C " V x "#y CV y "x x!! velocity field = V(x,y)" = iv x (x,y) + jv y (x,y)!! C(x,y) = density!! outflow rate =" & x (CV x ) &y + & y (CV y ) &x!! outflow rate / unit area! ( ) ( ) = " x CV x + " y CV y "x "y ( ) ( ) # $ CV x + $ CV y = % & CV $x $y 30! 5!

C 0 = " k 1, H 0 = " k 4, P 0 = " k 2 Part 3A: Nest Building! Explanation of Chemotaxis Term! Simulation (T = 0)!! The termite flow into a region is the negative divergence of the flux through it! # % J = ("J x / "x + "J y / "y)!! The flux velocity is proportional to the pheromone gradient! J ' #H!! The flux density is proportional to the number of moving termites!! J ' C!! Hence, $#%J = $#%(C#H)! 31! 32! fig. from Solé & Goodwin! Simulation (T = 100)! Simulation (T = 1000)! 33! fig. from Solé & Goodwin! 34! fig. from Solé & Goodwin! Conditions for Self-Organized Pillars!! Will not produce regularly spaced pillars if:!! density of termites is too low!! rate of deposition is too low!! A homogeneous stable state results! NetLogo Simulation of Deneubourg Model! Run Pillars3D.nlogo! 35! 36! 6!

Part 3A: Nest Building! Interaction of Three Pheromones! Wasp Nest Building" and" Discrete Stigmergy!! Queen pheromone governs size and shape of queen chamber (template)!! Cement pheromone governs construction and spacing of pillars & arches (stigmergy)!! Trail pheromone:!! attracts workers to construction sites (stigmergy)!! encourages soil pickup (stigmergy)!! governs sizes of galleries (template)! 37! Fig. from Solé & Goodwin! 38! Adaptive Function of Nests! Structure of Some Wasp Nests! Fig. from Self-Org. Biol. Sys.! 39! Figs. from Self-Org. Biol. Sys,! 40! How Do They Do It?! Lattice Swarms! (developed by Theraulaz & Bonabeau)! 41! 42! 7!

Discrete vs. Continuous Stigmergy!! Recall: stigmergy is the coordination of activities through the environment!! Continuous or quantitative stigmergy!! quantitatively different stimuli trigger quantitatively different behaviors!! Discrete or qualitative stigmergy!! stimuli are classified into distinct classes, which trigger distinct behaviors! Discrete Stigmergy in Comb Construction!! Initially all sites are equivalent!! After addition of cell, qualitatively different sites created! 43! Fig. from Self-Org. Biol. Sys.! 44! Numbers and Kinds" of Building Sites! Lattice Swarm Model!! Random movement by wasps in a 3D lattice!! cubic or hexagonal!! Wasps obey a 3D CA-like rule set!! Depending on configuration, wasp deposits one of several types of bricks!! Once deposited, it cannot be removed!! May be deterministic or probabilistic!! Start with a single brick! Fig. from Self-Org. Biol. Sys.! 45! 46! Cubic Neighborhood!! Deposited brick depends on states of 26 surrounding cells!! Configuration of surrounding cells may be represented by matrices:! Hexagonal Neighborhood! " 0 0 0% " 0 0 0% " 0 0 0% $ ' $ ' $ ' $ 1 0 0 ' ( $ 1 0 ' ( $ 1 0 0 ' # $ 0 0 0& ' # $ 0 0 0& ' # $ 0 0 0& ' Fig. from Solé & Goodwin! 47! Fig. from Bonabeau, Dorigo & Theraulaz! 48! 8!

Example Construction! Another Example! Fig. from IASC Dept., ENST de Bretagne.! fig. from IASC Dept., ENST de Bretagne.! 50! A Simple Pair of Rules! Result from Deterministic Rules! 51! Fig. from Self-Org. in Biol. Sys.! 52! Fig. from Self-Org. in Biol. Sys.! Result from Probabilistic Rules! Example Rules for a More Complex Architecture! The following stimulus configurations cause the agent to deposit a type-1 brick:! 53! Fig. from Self-Org. in Biol. Sys.! 54! 9!

Second Group of Rules! For these configurations, deposit a type-2 brick!! 20(20(20 lattice!! 10 wasps!! After 20 000 simulation steps!! Axis and plateaus!! Resembles nest of Parachartergus! Result! 55! Fig. from Bonabeau & al., Swarm Intell.! 56! Architectures Generated from Other Rule Sets! More Cubic Examples! Fig. from Bonabeau & al., Swarm Intell.! 57! Fig. from Bonabeau & al., Swarm Intell.! 58! Cubic Examples (1)! Cubic Examples (2)! Figs. from IASC Dept., ENST de Bretagne.! 59! Figs. from IASC Dept., ENST de Bretagne.! 60! 10!

Cubic Examples (3)! Cubic Examples (4)! Figs. from IASC Dept., ENST de Bretagne.! 61! Figs. from IASC Dept., ENST de Bretagne.! 62! Cubic Examples (5)! An Interesting Example!! Includes!! central axis!! external envelope!! long-range helical ramp!! Similar to Apicotermes termite nest! Figs. from IASC Dept., ENST de Bretagne.! 63! Fig. from Theraulaz & Bonabeau (1995)! 64! Similar Results" with Hexagonal Lattice! More Hexagonal Examples!!!!!! 20(20(20 lattice! 10 wasps! All resemble nests of wasp species! (d) is (c) with envelope cut away! (e) has envelope cut away! Fig. from Bonabeau & al., Swarm Intell.! 65! Figs. from IASC Dept., ENST de Bretagne.! 66! 11!

Effects of Randomness" (Coordinated Algorithm)! Effects of Randomness" (Non-coordinated Algorithm)!! Specifically different (i.e., different in details)!! Generically the same (qualitatively identical)!! Sometimes results are fully constrained! Fig. from Bonabeau & al., Swarm Intell.! 67! Fig. from Bonabeau & al., Swarm Intell.! 68! Non-coordinated Algorithms!! Stimulating configurations are not ordered in time and space!! Many of them overlap!! Architecture grows without any coherence!! May be convergent, but are still unstructured! Coordinated Algorithm!! Non-conflicting rules!! can t prescribe two different actions for the same configuration!! Stimulating configurations for different building stages cannot overlap!! At each stage, handshakes and interlocks are required to prevent conflicts in parallel assembly! 69! 70! More Formally!! Let C = {c 1, c 2,, c n } be the set of local stimulating configurations!! Let (S 1, S 2,, S m ) be a sequence of assembly stages!! These stages partition C into mutually disjoint subsets C(S p )!! Completion of S p signaled by appearance of a configuration in C(S p+1 )! Example! 71! Fig. from Camazine &al., Self-Org. Biol. Sys.! 72! 12!

Modular Structure! Example!! Recurrent states induce cycles in group behavior!! These cycles induce modular structure!! Each module is built during a cycle!! Modules are qualitatively similar! fig. from IASC Dept., ENST de Bretagne.! 73! Fig. from Camazine &al., Self-Org. Biol. Sys.! 74! Possible Termination Mechanisms!! Qualitative!! the assembly process leads to a configuration that is not stimulating!! Quantitative!! a separate rule inhibiting building when nest a certain size relative to population!! empty cells rule : make new cells only when no empties available!! growing nest may inhibit positive feedback mechanisms! Observations!! Random algorithms tend to lead to uninteresting structures!! random or space-filling shapes!! Similar structured architectures tend to be generated by similar coordinated algorithms!! Algorithms that generate structured architectures seem to be confined to a small region of rule-space! 75! 76! Analysis! Factorial Correspondence Analysis!! Define matrix M:!!! 12 columns for 12 sample structured architectures!!! 211 rows for stimulating configurations!!! M ij = 1 if architecture j requires configuration i! Fig. from Bonabeau & al., Swarm Intell.! 77! Fig. from Bonabeau & al., Swarm Intell.! 78! 13!

Conclusions!! Simple rules that exploit discrete (qualitative) stigmergy can be used by autonomous agents to assemble complex, 3D structures!! The rules must be non-conflicting and coordinated according to stage of assembly!! The rules corresponding to interesting structures occupy a comparatively small region in rule-space! 79! Part 6B! 14!