Distributed Intelligent Systems W12: Distributed Building and. and Artificial Systems
|
|
- Ginger French
- 5 years ago
- Views:
Transcription
1 Distributed Intelligent Systems W12: Distributed Building and Self-Assembling in Natural and Artificial Systems
2 Distributed building Outline Stigmergy, environmental templates Natural and artificial examples Slf Self-assembling General background Artificial examples (sub-mm and cm scales)
3 Distributed Building in Natural Systems
4 Example of Wasp Nest Guy Theraulaz
5 Example of Wasp Nest (sagittal cut) Guy Theraulaz
6 Further Examples of Wasp Nests Guy Theraulaz
7 Further Examples of Wasp Nests Pascal Goetgheluck
8 Not only Wasps: Termite Nest are also Impressive m high - thermoregulated Masson
9 Coordination Mechanisms for the Building Activity
10 Hyphotheses for Distributed ib t Building Mechanisms The plan Environmental template Stigmergy
11 The Plan Hypothesis? Scott Camazine
12 Hyphotheses for Distributed Building Mechanisms 1 The plan 2 3 Environmental template Stigmergy
13 The Environmental Template lt Hypothesis The building plan pre-existsexists in the environment under the form of spatial heterogeneities. The social insect activity only outlines these pre-existing environmental template. Environmental changes performed by insects play a minimal role in the building activity itself. This isa form of centralized if information seen from the bildi building insects t perspective There are several forms of environmental template: gradients naturally existing in the environment (humidity, temperature ) chemical gradients generated by one or more (static) individualsid of the colony
14 Ex.: Nest Structure in the Ant Acantholepis Custodiens Eggs T Larvae Pupae 3.00 a.m p.m.
15 Ex.: Termite Nest built around the Queen
16 Hyphotheses for Distributed Building Mechanisms 1 The plan 2 3 Environmental template - centralized Stigmergy
17 Stigmergy Definition It defines a class of mechanisms exploited by social insects to coordinate and control their activity via indirect interactions and stimulant signs left in the environment. Response R 1 R 2 R 3 R 4 R 5 Stimulus S 1 S 2 S 3 S 4 S 5 Stop time Stigmergic mechanisms can be classified in two different categories: quantitative (or continuous) stigmergy and qualitative (or discrete) stigmergy
18 Stigmergy The role of the two different stigmergic mechanisms in distributed building: 1 Sequence of stimuli and answers quantitatively different Quantitative (continuous) positive feedback and generation of spatial pattern mediated by self- organized agents 2 Sequence of stimuli and answers qualitatively different
19 Quantitative Stigmergy gy Features The successive stimuli quantitatively differentiate in their amplitude and merely modify the answer probability of other individuals Examples : mass recruitment in ants dead ant aggregation in ant cemetery pillar building in termites
20 Quantitative Stigmergy Pillar building in termites Spatial distribution of insects and their building activity are locally controlled by the pheromone o e density. Termites impregnate with pheromones the building material Pheromones diffuse in the environment Individuals carrying ground bullets follow the chemical gradient; they climb towards the highest pheromonal concentration and drop there their bullets Material drop rate is proportional to the number of active insects in the local region (positive feedback)
21 Simulation of Termite Nest Building: Pillar Bootstrapping
22 Stigmergy The role of the two different stigmergic mechanisms in distributed building 1 Sequence of stimuli and answers quantitatively different 2 Sequence of stimuli and answers qualitatively different Qualitative (discrete) positive feedback and assembly process mediated by self-organized agents
23 Qualitative Stigmergy gy Features Successive stimuli are qualitatively different. This process generates an agentmediated assembly dynamics (possibly including some self-alignment mechanisms of the bricks themselves) A B C S 1 S 2 S 3 time
24 Summary of Distributed Building Mechanisms in Natural Systems 1 The plan 2 3 Environmental template - centralized Stigmergy - distributed Blend!
25 Nest Building in Polist Wasps
26 Nest Building in Polist Wasps Guy Theraulaz
27 Nest Building in Polist twasps Organization of the building activity it It is indirectly carried out via the different, local configurations a wasp can find in the nest A probability of deposing a new cell is associated to each configuration
28 Nest Building in Polist twasps Potential sites for building S 2 S 1 S 2 S 1 S 1 S 2 S 1 S 3 S 1 S 1 S 1 S 2
29 Nest Building in Polist Wasps Probability of creating a new cell given the configuration of neighboring cells 1,0 0,8 0,6 0,4 0,2 0, Number of adjacent cell walls
30 Si l ti f th N t Simulation of the Nest Building Process
31 A Swarm on a 3D Lattice: The Nest Simulator lt A swarm of nest builders agent features Agents team is homogeneous No global plan of the whole building Local perception of the environment Random movements on a 3D lattice, no trajectories No embodiment (1agent = 1 single cell), no interference (however 2 agents cannot occupy the same cell) Reactive actions (applying (ppy rules) Distributed action during an iteration (n agents working together means n actions, not necessarily n dropped bricks); all n agents see the same overall nest configuration at a given iteration
32 The Nest Simulator Definition of agent s neighborhood for hexagonal cells The neighborhood of each agent is defined as the 20 cells around it (7 above, 6 around, and 7 below). z+1 z z - 1 z + 1 z z X A X Neighborhood Cell contents
33 The Nest Simulator Examples of building rules Z+1 z Building process is irreversible (no cell can be removed) Deposit rules can be strictly deterministic or probabilistic Z-1
34 Example of Rule Set Example of a rule set (Polist wasps, 7 rules)
35 Example of Nest Structure Obtained structures (Polists wasps, 7 rules) With deterministic rules With probabilistic rules
36 Looking for Stable Nest Architectures What kind of nest architectures can we build with the same method? What are the rules to implement in order to obtain stable architectures? An architecture is considered stable when several runs of a simulation with ihthe same rule set (but different random generator seed) generate architectures with the same global structure. Mechanisms of stigmergic coordination reduce the number of stable architectures.
37 Examples of Stable Architectures Parachatergus (21 rules) Vespa (13 rules) Stelopolybia (12 rules)
38 Examples of Stable Architectures Chatergus (39 rules) Artificial Nest Structure (35 rules)
39 Looking for Stable Nest Architectures How to build a stable architecture? The building process is carried out in successive steps. The current local configuration generate a stimulus different from that of the previous and of the successive configuration (qualitative stigmergy). Use of «bottleneck» rules for repeated pattern (ex. floor-to-floor coordination) Only this type of building algorithms generate coherent architectures. The whole set of these algorithms generates a limited number of nest shapes.
40 Reverse Engineering a Nest Structure using ECTechniques Fitness function: weighted sum of space filling and pattern replication arbitrary criteria based on 17 human observers who were asked to evaluate the amount of structure in a set of 29 different patterns, [Bonabeau 2000]) Biased evolution: Probabilistic templates (reduction of stimulating configurations containing a large number of bricks). Start microrule. No diagonal deposits (space not filled). Problems: Fitness function: Functional? Esthetical? Biological plausible? Mathematical definition? Disruptive effect of crossover; preservation of variable length blocks of rules (sequence of microrules needed for coordinated algorithms).
41 Distributed Building in Artificial Systems
42 2D Structure Building using Kheperas Robot behavior Reactive, non- communicating, nonadaptive behavior Quantitative stigmergy minimal (clear difference with Beckers et al 1994): the bigger, the more stable the cluster big cluster (> 2) = number of manipulation sites as cluster of 2 seeds almost no difference between cluster incrementing and decrementing probabilities Qualitative stigmergy gy important: 2 rules in interaction with cluster: Avoid if interaction with the cluster body Manipulate if interaction with cluster tips 1robot state: loaded, unloaded
43 Robot Controller Start Look for seeds Object detected? N N Y Carrying a seed? Y N Pick up the seed and decrement cluster s size Obstacle? Obstacle? Y Y N Obstacle avoidance Drop the seed and increment cluster s size
44 Parameter Characterization Start Look for seeds N Object detected? Probots +Pwalls +Pclusters (kt) Carrying a seed? 1 - [Probots +Pwalls + Pclusters (kt)] Y N Obstacle? Y Y Obstacle? Pick up the seed and decrement cluster s size Drop the seed and increment cluster s size Obstacle avoidance
45 Parameter Characterization Geometric Estimations Resulting Probabilities Incrementing probabilities Decrementing probabilities Perimeters are relevant for computing the cluster modifying probabilities: robot turns on the spot for object distinction before approaching the cluster!
46 Compare with Beckers et al. Geometric Estimations Resulting Probabilities Decrementing probabilities (by 1 puck, by 2 pucks) Decrementing probabilities (by 1 puck, by 2 pucks)
47 Robot Controller From Agassounon et al, 2004, correct representation:
48 Micro-Macroscopic Models From Agassounon et al, 2004, correct representation:
49 Models: Explanations and Predictions Single cluster? All models predicted yes and in roughly how much time! Number of clusters (inter-distance between seeds = 1seed) monotonically decreases if: Probability to create a NEW cluster of 1 seed in the middle of the arena is equal to zero No hard partitioning of the arena (robot homogeneously mix clusters) Cluster are not broken in two parts by removing one seed in the middle
50 Long Distributed Building Experiments Module-Based Model (Webots) Real robots (Khepera) 10% white noise on all sensor and actuators Perfectly homogeneous team Kinematic mode Electrical floor: continuous power supply in any position and orientation Heterogeneities among teammates and components Inaccuracies in acting and sensing Dynamics (e.g., friction) plays a role
51 Results (till single cluster) 3 robots real robots (5 runs), Webots (10 runs), AB-microscopic model (100 runs) [Martinoli, Ijspeert, Mondada, 1999] Mean size of clusters Size of the biggest cluster Number of clusters
52 Example of arising 2D Structures Noise in S&A and poor navigation capabilities do not allow for precise, controllable structure building Webots Real robots
53 Macroscopic Model: Distributed ib Building Dynamics d i (kt) = decr_geom_probability i *p_find i (kt) c i (kt) = incr_geom_probability i *pfind p_find i (kt) p_find i (kt) = finding probability of all the cluster of size i If n = number of seeds -> macroscopic model of environment with n nonlinearly coupled ODE (n for each possible cluster size) + robot states [Agassounon et al, Autonomous Robots, 2004]
54 Some Results from Agassonoun et al., 2004 (1 and 5 robots always active) Model comparison: macroscopic vs. submicroscopic models Mean Cluster Size Mean Number of Clusters
55 Some Results from Agassonoun et al., 2004 (10 robots always active) Model comparison: macroscopic vs. submicroscopic (Webots) Mean Cluster Size Mean Number of Clusters
56 Self-Assembling
57 What is Self-Assembly? Spontaneous organization of pre-existing units into spatial structures or patterns without external guidance. Self-Assembly at All Scales 29 orders of magnitude, same underlying mechanism! Carbon nanotube, about 10-8 m Our galaxy, the Milky Way, about m
58 What is NOT Self-Assembly? Planned and externally guided constructions Unstructured aggregates Living beings, because they are not made of pre-existing units Gazprom building, St- Petersburg, 10 2 m Sequential, limited scalability (from a few millimeters up to a few kilometers) Boxelder bug aggregate, 10-3 m Aggregation may serve a purpose (e.g., protection, collective decision- i making), but the structure itself does not. Various animals Self-assembly may have played a key role in the initial iti appearance of life.
59 Self-Assembly at All Scales A.Crystal structure of a ribosome [Yusupov et al., 2001] B.Scaffolded DNA origami of 100 nm in diameter [Rothemund, Caltech] C.Capillary SA of 10-μm-sized hexagonal plates into large crystal structures [Whitesides, Harvard] D. SA of 1-mm-sized hexagonal plates using capillary bond [Whitesides, Harvard] E. SA of electrical networks [Whitesides, Harvard] F. Electromechanical programmable parts specifically designed for SA [Klavins, University of Washington] G. A swarm of mobile robots capable of SA [Dorigo, UniversitéLibre de Bruxelles] 59
60 Ingredients and Features Ingredients of Self-Assembly: 1. Positive feedback: binding force, structural reinforcement 2. Negative feedback: repulsive li force (otherwise, (th merely aggregation) 3. Multiple reversible interactions 4. Randomness Features of Self-Assembly: Robustness: self-assembly deals with component defects, environmental noise and external perturbations Parallelism: self-assembly occurs wherever there are interacting components Scalability: self-assembly is a strategy applicable at all scales, and even across scales Ubiquity: structures form spontaneously at all scales in Nature, and most of them exhibit similarities across scales
61 Mti Motivation for Studying Stdi Self-Assembly SlfA (1) Scientific understanding of a broad variety of phenomena: Water ripples ~10-3 m Seashell ~10-2 m School of fish ~10 1 m DNA origami Tornado Cyclone ~10-7 m ~10 2 m ~10 6 m
62 Motivation for Studying Self-Assembly (2) Manufacturing and coordination of ultra-small distributed intelligent systems: Left: A microrobot (10 μm) is inoculating a red blood cellagainst some Left: A microrobot (10 μm) is inoculating a red blood cellagainst some kind of disease. Right: This nanoscaled device (1 nm) enables a nanorobot to catch HIV individuals and destroy them.
63 The quest for miniaturization How to go from the Alice robot (2cm in size)...to fully-fledged microrobots?
64 Limitations of the Top-Down Approach HOW TO ASSEMBLE THESE INTO THESE USING THESE? ANSWER: LET THEM ASSEMBLE THEMSELVES!
65 Self-Assembly of Micro-Systems Binding surface Non-binding surface Self-Assembly Hydrophobic interaction and capillary forces (in fluid) Van der Waals forces (in dry state) Experimental challenges: imaging (3D, high speed camera, microscope) and controllability 65
66 Intelligent and less intelligent agents Alice mobile robot MEMS 2cm 100µm Typical size: 2 centimeters Typical swarm size:< 100 units Sensing, computation, communication (only local) Controllable self-locomoted units (but quite noisy) Typical size: 50 to 500 μm Typical swarm size:> 10 4 units No sensing, computation or communication, but local interactions only Stochastic motion only
67 Multi-Level Modeling Methodology Macroscopic 1: rate equations, mean field approach, whole population Macroscopic 2: Chemical Reaction Network, stochastic ti simulations Microscopic 1: Monte Carlo model, 1 robot = 1 agent, non-spatial Abs straction Common metrics Microscopic 2: Agent-Based model, 1 robot = 1 agent, spatial Realistic: faithful representation of the robots (e.g., geometry, S&A) and the environment (e.g., friction, gravity, inertia) Physical reality: real experiments, imaging with overhead cameras, tracking software rimental ti ime Expe
68 Multi-Level Modeling Methodology Macroscopic 1: rate equations, mean field approach, whole population Macroscopic 2: Chemical Reaction Network, stochastic ti simulations Microscopic 1: Monte Carlo model, 1 robot = 1 agent, non-spatial Abs straction Common metrics Microscopic 2: Agent-Based model, 1 robot = 1 agent, spatial Underlying physical reality (and, therefore submicroscopic models) may vary dramatically! rimental ti ime Expe
69 Goal Ex.1: Self-Assembly of Alice Robots Formation of chains Physical testbedtb dfor models at multiple abstraction levels Self-assembly soft binding force (implemented through local IR communication) Advantages Controllable, but still miniaturized 19 robots, accelerated 16x Experimental ease: imaging, controllability, flexibility [Evans et al., ICRA 2010]
70 Single Robot Algorithm Timer expires OR Unaligned object detected Tumble Timer expires Start Wander Aligned object detected Bond Avoid Timer expires No recent communication OR No recently aligned object Deterministic vs. stochastic variant
71 Deterministic Controller Bonded Alices communicate with each other to determine the length of their chain msg = 4 msg = 1 msg = msg + 1 msg = 2 msg = 4
72 Deterministic Controller - Sample Results with 19 robots Submicroscopic (Webots) Macroscopic (stochastic CRN)
73 Stochastic Controller Every second, an Alice leaves its current bond depending on some probability. bilit
74 Stochastic Controller - Sample Results with 19 robots Submicroscopic (Webots) Macroscopic (stochastic CRN)
75 Ex. 2: Self-Assembly Micro-Systems Ground truth: spatial microscopic model - implemented in Netlogo Abstraction: shape of the building blocks, most physical effects (e.g., friction, fluid dynamics) Assumption: building blocks can be represented as simple agents with a certain orientation and a single preferential direction Discretization of alignment state Random motion is described by a Langevin equation (Brownian motion): friction term agitation term Collisions handled in a deterministic fashion. [Mermoud et al., AAMAS 2009]
76 Microscopic Non-Spatial Model Abstraction: spatiality, i.e. the position and orientation of each agent Assumption:the system is well-mixed, homogeneous and isotropic This Monte Carlo model does not capture spatiality, but still keeps track of each aggregation/disaggregation event in the system. Geometric approximation for encountering probability (volume swept): Energy-based formulation of the break-up probabilities, which depend on the alignment of the building blocks: Energy in current state si Misalignment System agitation Maximal bond energy
77 Macroscopic Model Abstraction: ti the state (i.e., whether h it is in an aggregate or not, and with which agent) of each individual agent Assumption: the system can be modeled using a mean field approach based on rate equations. Our model is based on difference equations that keep track of the number of individuals in each state. Capturing alignment by discretizing of the space of pairs into K different alignment states, each with a different break-up probability: Pair of building blocks in a given state i Number of single building blocks
78 Macroscopic Model Validation Excellent agreement between non-spatial models (red and blue). Spatial model (agent-based, in green) converges slower: lower mixing.
79 Mean field approximation validity N0 = 500 N0 = 100 N0 = 50 Also, the faithfulness of macroscopic model with respect to microscopic spatial model degrades as the total number of building blocks N0 decreases.
80 Optimizing Self-Assembly Agitation brings mobility to the building blocks, but also mitigates the stability of bonds: find the appropriate tradeoff! Non-linearity, exploration vs exploitation tradeoff: self-assembly is a difficult control problem! Optimization of control and design parameters requires accurate and computationally inexpensive models.
81 Conclusion
82 Take Home Messages Both types of stigmergy (quantitative and qualitative) play a crucial role in natural distributed building processes Not only self-organization and stigmergy but also environmental templates can be used for coordinating the activities of distributed intelligent systems Once again microscopic and macroscopic models can help in understanding, designing, and optimizing real distributed building systems
83 Take Home Messages Self-assembly implies the constitution of structures and ordered spatial pattern (rather than just aggregate) and constituting elements that incorporate all the required assembly mechanisms (although they are not necessarily endowed with self-locomotion capabilities) Self-assembly can happen at all scales and is a powerful, parallel, potentially cheap coordination principle for a number of manufacturing applications in which traditional techniques cannot tbe used or have an excessive cost
84 Additional Literature Week 12 Papers Bonabeau E., Guérin S., Snyers D., Kuntz P. and Theraulaz G., Three-Dimensional Architectures grown by Simple Stigmergic agents. Biosystems, 56(1): 13-32, R. Gross, M. Bonani, F. Mondada, and M. Dorigo. Autonomous self- assembly in swarm-bots. IEEE Trans. on Robotics, 22(6): , 2006.
Swarm Intelligence W13: From Aggregation and Segregation to Structure Building
Swarm Intelligence W13: From Aggregation and Segregation to Structure Building Stigmergy Quantitative Qualitative Outline Distributed building in: natural systems artificial virtual systems artificial
More informationTemplates. Template is a pattern used to construct another pattern Used in conjunction with sorting behaviour:
Templates Template is a pattern used to construct another pattern Used in conjunction with sorting behaviour: Predictable behaviour Parametric Example: Define number and location of clusters Move to cluster,
More informationVI" Autonomous Agents" &" Self-Organization! Part A" Nest Building! Autonomous Agent! Nest Building by Termites" (Natural and Artificial)!
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
More informationSelf-Organization in Social Insects
Self-Organization in Social Insects Kazuo Uyehara 5/04/2008 Self-organization is a process in which complex patterns or behaviors are produced without direction from an outside or supervising source. This
More informationOPTIMIZATION OF SWARM ROBOTIC SYSTEMS VIA MACROSCOPIC MODELS
OPTIMIZATION OF SWARM ROBOTIC SYSTEMS VIA MACROSCOPIC MODELS Alcherio Martinoli Collective Robotics Group, California Institute of Technology 1200 E. California Blvd., M/C 136-93, Pasadena, CA, 91125-9300
More informationDecrease in Number of Piles. Lecture 10. Why does the number of piles decrease? More Termites. An Experiment to Make the Number Decrease More Quickly
Decrease in Number of Piles Lecture 10 9/25/07 1 9/25/07 2 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
More informationIntroduction to Swarm Robotics
COMP 4766 Introduction to Autonomous Robotics Introduction to Swarm Robotics By Andrew Vardy April 1, 2014 Outline 1 Initial Definitions 2 Examples of SI in Biology 3 Self-Organization 4 Stigmergy 5 Swarm
More informationOutline. 1 Initial Definitions. 2 Examples of SI in Biology. 3 Self-Organization. 4 Stigmergy. 5 Swarm Robotics
Outline COMP 4766 Introduction to Autonomous Robotics 1 Initial Definitions Introduction to Swarm Robotics 2 Examples of SI in Biology 3 Self-Organization By Andrew Vardy 4 Stigmergy April 1, 2014 5 Swarm
More informationSensitive Ant Model for Combinatorial Optimization
Sensitive Ant Model for Combinatorial Optimization CAMELIA CHIRA cchira@cs.ubbcluj.ro D. DUMITRESCU ddumitr@cs.ubbcluj.ro CAMELIA-MIHAELA PINTEA cmpintea@cs.ubbcluj.ro Abstract: A combinatorial optimization
More informationTOWARDS OPTIMAL CONTROL OF SELF-ORGANIZED ROBOTIC INSPECTION SYSTEMS. Nikolaus Correll and Alcherio Martinoli
TOWARDS OPTIMAL CONTROL OF SELF-ORGANIZED ROBOTIC INSPECTION SYSTEMS Nikolaus Correll and Alcherio Martinoli Swarm-Intelligent Systems Group École Polytechnique Fédérale de Lausanne, Switzerland [nikolaus.correll
More informationEvolving Agent Swarms for Clustering and Sorting
Evolving Agent Swarms for Clustering and Sorting Vegard Hartmann Complex Adaptive Organically-Inspired Systems Group (CAOS) Dept of Computer Science The Norwegian University of Science and Technology (NTNU)
More informationSwarm-bots and Swarmanoid: Two experiments in embodied swarm intelligence
Swarm-bots and Swarmanoid: Two experiments in embodied swarm intelligence Marco Dorigo FNRS Research Director IRIDIA Université Libre de Bruxelles IAT - 17.9.2009 - Milano, Italy What is swarm intelligence?
More informationSC741 W12: Division of Labor Part I: Fixed- and Variable- Threshold Algorithms
SC741 W12: Division of Labor Part I: Fixed- and Variable- Threshold Algorithms Outline Division of labor in natural systems Ants Bees, wasps Models and mechanisms Fixed-threshold mechanisms Variable-threshold
More informationOutline. Ant Colony Optimization. Outline. Swarm Intelligence DM812 METAHEURISTICS. 1. Ant Colony Optimization Context Inspiration from Nature
DM812 METAHEURISTICS Outline Lecture 8 http://www.aco-metaheuristic.org/ 1. 2. 3. Marco Chiarandini Department of Mathematics and Computer Science University of Southern Denmark, Odense, Denmark
More informationDRAFT VERSION: Simulation of Cooperative Control System Tasks using Hedonistic Multi-agents
DRAFT VERSION: Simulation of Cooperative Control System Tasks using Hedonistic Multi-agents Michael Helm, Daniel Cooke, Klaus Becker, Larry Pyeatt, and Nelson Rushton Texas Tech University, Lubbock Texas
More informationFrom Local to Global Behavior in Intelligent Self-Assembly
From Local to Global Behavior in Intelligent Self-Assembly Chris Jones and Maja J. Matarić Computer Science Department University of Southern California 941 West 37th Place, Mailcode 0781 Los Angeles,
More informationDistributed Intelligent Systems W6 A Multi-Level Modeling Methodology for Swarm Robotics
Distributed Intelligent Systems W6 A Multi-Level Modeling Methodology for Swarm Robotics Outline Multi-Level Modeling Methodology Rationale Assumptions, implementation Model Calibration Methods Open issues
More informationAn Introduction to Swarm Robotics
An Introduction to Swarm Robotics Alcherio Martinoli SNSF Professor in Computer and Communication Sciences, EPFL Part-Time Visiting Associate in Mechanical Engineering, CalTech Swarm-Intelligent Systems
More informationStigmergic navigation on an RFID floor with a multi-robot team Ali Abdul Khaliq Maurizio Di Rocco Alessandro Saffiotti
Stigmergic navigation on an RFID floor with a multi-robot team Ali Abdul Khaliq Maurizio Di Rocco Alessandro Saffiotti AASS Cognitive Robotic Systems Lab University of Örebro, Sweden 1 Motivation Stigmergy
More informationLOCAL NAVIGATION. Dynamic adaptation of global plan to local conditions A.K.A. local collision avoidance and pedestrian models
LOCAL NAVIGATION 1 LOCAL NAVIGATION Dynamic adaptation of global plan to local conditions A.K.A. local collision avoidance and pedestrian models 2 LOCAL NAVIGATION Why do it? Could we use global motion
More informationdepending only on local relations. All cells use the same updating rule, Time advances in discrete steps. All cells update synchronously.
Swarm Intelligence Systems Cellular Automata Christian Jacob jacob@cpsc.ucalgary.ca Global Effects from Local Rules Department of Computer Science University of Calgary Cellular Automata One-dimensional
More informationSelf-Organization Hypothesis. Lecture 18
Self-Organization Hypothesis Lecture 18 Simple attraction & repulsion rules generate schooling behavior positive feedback: brings individuals together negative feedback: but not too close Rules rely on
More informationMathematical modeling of complex systems Part 1. Overview
1 Mathematical modeling of complex systems Part 1. Overview P. Degond Institut de Mathématiques de Toulouse CNRS and Université Paul Sabatier pierre.degond@math.univ-toulouse.fr (see http://sites.google.com/site/degond/)
More informationContact Information CS 420/527. Biologically-Inspired Computation. CS 420 vs. CS 527. Grading. Prerequisites. Textbook 1/11/12
CS 420/527 Biologically-Inspired Computation Bruce MacLennan web.eecs.utk.edu/~mclennan/classes/420 Contact Information Instructor: Bruce MacLennan maclennan@eecs.utk.edu Min Kao 425 Office Hours: 3:30
More informationCooperative Control and Mobile Sensor Networks
Cooperative Control and Mobile Sensor Networks Cooperative Control, Part I, A-C Naomi Ehrich Leonard Mechanical and Aerospace Engineering Princeton University and Electrical Systems and Automation University
More informationCapacitor Placement for Economical Electrical Systems using Ant Colony Search Algorithm
Capacitor Placement for Economical Electrical Systems using Ant Colony Search Algorithm Bharat Solanki Abstract The optimal capacitor placement problem involves determination of the location, number, type
More informationCourse 16:198:520: Introduction To Artificial Intelligence Lecture 13. Decision Making. Abdeslam Boularias. Wednesday, December 7, 2016
Course 16:198:520: Introduction To Artificial Intelligence Lecture 13 Decision Making Abdeslam Boularias Wednesday, December 7, 2016 1 / 45 Overview We consider probabilistic temporal models where the
More informationContact Information. CS 420/594 (Advanced Topics in Machine Intelligence) Biologically-Inspired Computation. Grading. CS 420 vs. CS 594.
CS 420/594 (Advanced Topics in Machine Intelligence) Biologically-Inspired Computation Bruce MacLennan http://www.cs.utk.edu/~mclennan/classes/420 Contact Information Instructor: Bruce MacLennan maclennan@eecs.utk.edu
More informationSwarm Intelligence Systems
Swarm Intelligence Systems Christian Jacob jacob@cpsc.ucalgary.ca Department of Computer Science University of Calgary Cellular Automata Global Effects from Local Rules Cellular Automata The CA space is
More informationAn ant colony algorithm for multiple sequence alignment in bioinformatics
An ant colony algorithm for multiple sequence alignment in bioinformatics Jonathan Moss and Colin G. Johnson Computing Laboratory University of Kent at Canterbury Canterbury, Kent, CT2 7NF, England. C.G.Johnson@ukc.ac.uk
More informationModels of Termite Nest Construction Daniel Ladley Computer Science 2003/2004
Models of Termite Nest Construction Daniel Ladley Computer Science 2003/2004 The candidate confirms that the work submitted is their own and the appropriate credit has been given where reference has been
More informationArtificial Intelligence
Artificial Intelligence Roman Barták Department of Theoretical Computer Science and Mathematical Logic Summary of last lecture We know how to do probabilistic reasoning over time transition model P(X t
More informationDivision of Labour and Task Allocation
Division of Labour and Task Allocation Introduction Many species of insects have division of labour Task allocation at colony level linked to elasticity of individuals Model is based upon response thresholds
More informationIntroduction. Spatial Multi-Agent Systems. The Need for a Theory
Introduction Spatial Multi-Agent Systems A spatial multi-agent system is a decentralized system composed of numerous identically programmed agents that either form or are embedded in a geometric space.
More informationEngineering Self-Organization and Emergence: issues and directions
5/0/ Engineering Self-Organization and Emergence: issues and directions Franco Zambonelli franco.zambonelli@unimore.it Agents and Pervasive Computing Group Università di Modena e Reggio Emilia SOAS 005
More informationA Simple Approach to the Multi-Predator Multi-Prey Pursuit Domain
A Simple Approach to the Multi-Predator Multi-Prey Pursuit Domain Javier A. Alcazar Sibley School of Mechanical and Aerospace Engineering Cornell University jaa48@cornell.edu 1. Abstract We present a different
More informationAnt Foraging Revisited
Ant Foraging Revisited Liviu A. Panait and Sean Luke George Mason University, Fairfax, VA 22030 lpanait@cs.gmu.edu, sean@cs.gmu.edu Abstract Most previous artificial ant foraging algorithms have to date
More informationSwarm-bots. Marco Dorigo FNRS Research Director IRIDIA Université Libre de Bruxelles
Swarm-bots Marco Dorigo FNRS Research Director IRIDIA Université Libre de Bruxelles Swarm-bots The swarm-bot is an experiment in swarm robotics Swarm robotics is the application of swarm intelligence principles
More informationEntropy and Self-Organization in Multi- Agent Systems. CSCE 990 Seminar Zhanping Xu 03/13/2013
Entropy and Self-Organization in Multi- Agent Systems CSCE 990 Seminar Zhanping Xu 03/13/2013 Citation of the Article H. V. D. Parunak and S. Brueckner, Entropy and Self Organization in Multi-Agent Systems,
More informationSelf-Assembly. Lecture 7 Lecture 7 Dynamical Self-Assembly
Self-Assembly Lecture 7 Lecture 7 Dynamical Self-Assembly Dynamic Self-Assembly The biological example of writing information on a small scale has inspired me to think of something that should be possible.
More informationIntroduction to Reinforcement Learning. CMPT 882 Mar. 18
Introduction to Reinforcement Learning CMPT 882 Mar. 18 Outline for the week Basic ideas in RL Value functions and value iteration Policy evaluation and policy improvement Model-free RL Monte-Carlo and
More informationModelling the Role of Trail Pheromone in the Collective Construction of Termite Royal Chambers
Modelling the Role of Trail Pheromone in the Collective Construction of Termite Royal Chambers Nicholas Hill 1 and Seth Bullock Institute for Complex Systems Simulation, University of Southampton, UK,
More informationA General Methodology for Mathematical Analysis of Multi-Agent Systems
A General Methodology for Mathematical Analysis of Multi-Agent Systems Kristina Lerman Aram Galstyan Information Sciences Institute Univ. of Southern California Marina del Rey, CA 90292-6695 USA lerman@isi.edu
More informationThree-dimensional architectures grown by simple stigmergic agents
BioSystems 56 (2000) 13 32 www.elsevier.com/locate/biosystems Three-dimensional architectures grown by simple stigmergic agents Eric Bonabeau a, *, Sylvain Guérin b, Dominique Snyers b, Pascale Kuntz b,
More informationBalancing and Control of a Freely-Swinging Pendulum Using a Model-Free Reinforcement Learning Algorithm
Balancing and Control of a Freely-Swinging Pendulum Using a Model-Free Reinforcement Learning Algorithm Michail G. Lagoudakis Department of Computer Science Duke University Durham, NC 2778 mgl@cs.duke.edu
More informationMeta-heuristic ant colony optimization technique to forecast the amount of summer monsoon rainfall: skill comparison with Markov chain model
Chapter -7 Meta-heuristic ant colony optimization technique to forecast the amount of summer monsoon rainfall: skill comparison with Markov chain model 7.1 Summary Forecasting summer monsoon rainfall with
More informationCS 781 Lecture 9 March 10, 2011 Topics: Local Search and Optimization Metropolis Algorithm Greedy Optimization Hopfield Networks Max Cut Problem Nash
CS 781 Lecture 9 March 10, 2011 Topics: Local Search and Optimization Metropolis Algorithm Greedy Optimization Hopfield Networks Max Cut Problem Nash Equilibrium Price of Stability Coping With NP-Hardness
More informationHow do scientists build something so small? Materials 1 pkg of modeling materials 1 piece of butcher paper 1 set of cards 1 set of markers
Using Modeling to Demonstrate Self-Assembly in Nanotechnology Imagine building a device that is small enough to fit on a contact lens. It has an antennae and a translucent screen across the pupil of the
More informationThe University of Birmingham School of Computer Science MSc in Advanced Computer Science. Behvaiour of Complex Systems. Termite Mound Simulator
The University of Birmingham School of Computer Science MSc in Advanced Computer Science Behvaiour of Complex Systems Termite Mound Simulator John S. Montgomery msc37jxm@cs.bham.ac.uk Lecturer: Dr L. Jankovic
More informationEvolving Aggregation Behaviors in a Swarm of Robots
Evolving Aggregation Behaviors in a Swarm of Robots Vito Trianni 1, Roderich Groß 1, Thomas H. Labella 1, Erol Şahin 2, and Marco Dorigo 1 1 IRIDIA Université Libre de Bruxelles, Belgium 2 Dept. of Computer
More informationbiologically-inspired computing lecture 22 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing
lecture 22 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0
More informationEmergent Teamwork. Craig Reynolds. Cognitive Animation Workshop June 4-5, 2008 Yosemite
Emergent Teamwork Craig Reynolds Cognitive Animation Workshop June 4-5, 2008 Yosemite 1 This talk Whirlwind tour of collective behavior in nature Some earlier simulation models Recent work on agent-based
More informationToward a Multi-Robot Coordination Formalism
Toward a Multi-Robot Coordination Formalism Chris Jones and Maja J Matarić Computer Science Department University of Southern California, Los Angeles, CA 90089-0781, USA {cvjones maja}@robotics.usc.edu
More informationSwarm intelligence: Ant Colony Optimisation
Swarm intelligence: Ant Colony Optimisation S Luz luzs@cs.tcd.ie October 7, 2014 Simulating problem solving? Can simulation be used to improve distributed (agent-based) problem solving algorithms? Yes:
More informationAn Adaptive Clustering Method for Model-free Reinforcement Learning
An Adaptive Clustering Method for Model-free Reinforcement Learning Andreas Matt and Georg Regensburger Institute of Mathematics University of Innsbruck, Austria {andreas.matt, georg.regensburger}@uibk.ac.at
More informationAnt Colony Optimization: an introduction. Daniel Chivilikhin
Ant Colony Optimization: an introduction Daniel Chivilikhin 03.04.2013 Outline 1. Biological inspiration of ACO 2. Solving NP-hard combinatorial problems 3. The ACO metaheuristic 4. ACO for the Traveling
More informationCS599 Lecture 1 Introduction To RL
CS599 Lecture 1 Introduction To RL Reinforcement Learning Introduction Learning from rewards Policies Value Functions Rewards Models of the Environment Exploitation vs. Exploration Dynamic Programming
More informationSituation. The XPS project. PSO publication pattern. Problem. Aims. Areas
Situation The XPS project we are looking at a paradigm in its youth, full of potential and fertile with new ideas and new perspectives Researchers in many countries are experimenting with particle swarms
More informationTitle: Excavation and aggregation as organizing factors in de novo construction by moundbuilding
Supplemental Information Title: Excavation and aggregation as organizing factors in de novo construction by moundbuilding termites Authors: Ben Green, Paul Bardunias, J. Scott Turner, Radhika Nagpal, Justin
More informationA general modeling framework for swarms
Delft University of Technology Delft Center for Systems and Control Technical report 08-002 A general modeling framework for swarms J. van Ast, R. Babuška, and B. De Schutter If you want to cite this report,
More informationAgent-Based Modeling Using Swarm Intelligence in Geographical Information Systems
Agent-Based Modeling Using Swarm Intelligence in Geographical Information Systems Rawan Ghnemat, Cyrille Bertelle, Gérard H.E. Duchamp To cite this version: Rawan Ghnemat, Cyrille Bertelle, Gérard H.E.
More informationEusocial species. Eusociality. Phylogeny showing only eusociality Eusocial insects. Eusociality: Cooperation to the extreme
Eusociality: Cooperation to the extreme Groups form colonies with reproductive and worker castes. Eusociality has evolved most often in insects: Ants Eusocial species Honeybees Termites Wasps Phylogeny
More informationToward Online Probabilistic Path Replanning
Toward Online Probabilistic Path Replanning R. Philippsen 1 B. Jensen 2 R. Siegwart 3 1 LAAS-CNRS, France 2 Singleton Technology, Switzerland 3 ASL-EPFL, Switzerland Workshop on Autonomous Robot Motion,
More informationShort Course: Multiagent Systems. Multiagent Systems. Lecture 1: Basics Agents Environments. Reinforcement Learning. This course is about:
Short Course: Multiagent Systems Lecture 1: Basics Agents Environments Reinforcement Learning Multiagent Systems This course is about: Agents: Sensing, reasoning, acting Multiagent Systems: Distributed
More information(Crystal) Nucleation: The language
Why crystallization requires supercooling (Crystal) Nucleation: The language 2r 1. Transferring N particles from liquid to crystal yields energy. Crystal nucleus Δµ: thermodynamic driving force N is proportional
More informationFORCE-BASED BOOKKEEPING
LOCAL NAVIGATION 2 FORCE-BASED BOOKKEEPING Social force models The forces are first-class abstractions Agents are considered to be mass particles Other models use forces as bookkeeping It is merely a way
More informationELEC4631 s Lecture 2: Dynamic Control Systems 7 March Overview of dynamic control systems
ELEC4631 s Lecture 2: Dynamic Control Systems 7 March 2011 Overview of dynamic control systems Goals of Controller design Autonomous dynamic systems Linear Multi-input multi-output (MIMO) systems Bat flight
More informationFORECASTING STANDARDS CHECKLIST
FORECASTING STANDARDS CHECKLIST An electronic version of this checklist is available on the Forecasting Principles Web site. PROBLEM 1. Setting Objectives 1.1. Describe decisions that might be affected
More informationMetaheuristics and Local Search
Metaheuristics and Local Search 8000 Discrete optimization problems Variables x 1,..., x n. Variable domains D 1,..., D n, with D j Z. Constraints C 1,..., C m, with C i D 1 D n. Objective function f :
More informationAnalyzing Swarms A Stochastic Processes Approach to Studying Robotic Swarm Behavior
Analyzing Swarms A Stochastic Processes Approach to Studying Robotic Swarm Behavior Kristina Lerman USC Information Sciences Institute Tad Hogg HP Labs Thanks to: Aram Galstyan, Alcherio Martinoli, Maja
More information12. LOCAL SEARCH. gradient descent Metropolis algorithm Hopfield neural networks maximum cut Nash equilibria
12. LOCAL SEARCH gradient descent Metropolis algorithm Hopfield neural networks maximum cut Nash equilibria Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley h ttp://www.cs.princeton.edu/~wayne/kleinberg-tardos
More informationComputer Simulations
Computer Simulations A practical approach to simulation Semra Gündüç gunduc@ankara.edu.tr Ankara University Faculty of Engineering, Department of Computer Engineering 2014-2015 Spring Term Ankara University
More informationMonte Carlo Simulation of Long-Range Self-Diffusion in Model Porous Membranes and Catalysts
Monte Carlo Simulation of Long-Range Self-Diffusion in Model Porous Membranes and Catalysts Brian DeCost and Dr. Sergey Vasenkov College of Engineering, University of Florida Industrial processes involving
More informationMetaheuristics and Local Search. Discrete optimization problems. Solution approaches
Discrete Mathematics for Bioinformatics WS 07/08, G. W. Klau, 31. Januar 2008, 11:55 1 Metaheuristics and Local Search Discrete optimization problems Variables x 1,...,x n. Variable domains D 1,...,D n,
More informationNanotechnology? Source: National Science Foundation (NSF), USA
2 2 Nanotechnology? Ability to work at the atomic, molecular and even sub-molecular levels in order to create and use material structures, devices and systems with new properties and functions Source:
More informationPrincipled synthesis for large-scale systems: task sequencing
Principled synthesis for large-scale systems: task sequencing Dylan A. Shell and Maja J Matarić University of Southern California shell mataric@usc.edu Summary. This paper describes ongoing work toward
More informationARTIFICIAL INTELLIGENCE
BABEŞ-BOLYAI UNIVERSITY Faculty of Computer Science and Mathematics ARTIFICIAL INTELLIGENCE Solving search problems Informed local search strategies Nature-inspired algorithms March, 2017 2 Topics A. Short
More informationPartially Observable Markov Decision Processes (POMDPs)
Partially Observable Markov Decision Processes (POMDPs) Sachin Patil Guest Lecture: CS287 Advanced Robotics Slides adapted from Pieter Abbeel, Alex Lee Outline Introduction to POMDPs Locally Optimal Solutions
More informationCompact energy absorbing cellular structure
Structures Under Shock and Impact IX 413 Compact energy absorbing cellular structure M. Ali 1, A. Qamhiyah 2, D. Flugrad 1 & M. Shakoor 1 1 Department of Mechanical Engineering, Iowa State University,
More informationProbability Map Building of Uncertain Dynamic Environments with Indistinguishable Obstacles
Probability Map Building of Uncertain Dynamic Environments with Indistinguishable Obstacles Myungsoo Jun and Raffaello D Andrea Sibley School of Mechanical and Aerospace Engineering Cornell University
More informationAbstract. Introduction
NEW METHOD FOR RAISING QUEENS Hossein Yeganehrad Caspian Apiaries P.O. Box 16058 617, New Westminster, British Columbia, Canada, V3M 6W6 radbees@hotmail.com Paper 138, Oral Presentation XXXVIIIth Apimondia
More informationComplexity Metrics. ICRAT Tutorial on Airborne self separation in air transportation Budapest, Hungary June 1, 2010.
Complexity Metrics ICRAT Tutorial on Airborne self separation in air transportation Budapest, Hungary June 1, 2010 Outline Introduction and motivation The notion of air traffic complexity Relevant characteristics
More informationReinforcement Learning II
Reinforcement Learning II Andrea Bonarini Artificial Intelligence and Robotics Lab Department of Electronics and Information Politecnico di Milano E-mail: bonarini@elet.polimi.it URL:http://www.dei.polimi.it/people/bonarini
More informationToward a Better Understanding of Complexity
Toward a Better Understanding of Complexity Definitions of Complexity, Cellular Automata as Models of Complexity, Random Boolean Networks Christian Jacob jacob@cpsc.ucalgary.ca Department of Computer Science
More informationCell-based Model For GIS Generalization
Cell-based Model For GIS Generalization Bo Li, Graeme G. Wilkinson & Souheil Khaddaj School of Computing & Information Systems Kingston University Penrhyn Road, Kingston upon Thames Surrey, KT1 2EE UK
More informationEmulation of an Animal Limb with Two Degrees of Freedom using HIL
Emulation of an Animal Limb with Two Degrees of Freedom using HIL Iván Bautista Gutiérrez, Fabián González Téllez, Dario Amaya H. Abstract The Bio-inspired robotic systems have been a focus of great interest
More informationMotivation. Evolution has rediscovered several times multicellularity as a way to build complex living systems
Cellular Systems 1 Motivation Evolution has rediscovered several times multicellularity as a way to build complex living systems Multicellular systems are composed by many copies of a unique fundamental
More informationCE 530 Molecular Simulation
1 CE 530 Molecular Simulation Lecture 1 David A. Kofke Department of Chemical Engineering SUNY Buffalo kofke@eng.buffalo.edu 2 Time/s Multi-Scale Modeling Based on SDSC Blue Horizon (SP3) 1.728 Tflops
More informationPart B" Ants (Natural and Artificial)! Langton s Vants" (Virtual Ants)! Vants! Example! Time Reversibility!
Part B" Ants (Natural and Artificial)! Langton s Vants" (Virtual Ants)! 11/14/08! 1! 11/14/08! 2! Vants!! Square grid!! Squares can be black or white!! Vants can face N, S, E, W!! Behavioral rule:!! take
More informationDiscrete evaluation and the particle swarm algorithm
Volume 12 Discrete evaluation and the particle swarm algorithm Tim Hendtlass and Tom Rodgers Centre for Intelligent Systems and Complex Processes Swinburne University of Technology P. O. Box 218 Hawthorn
More informationLatency time and absence of group effect: two examples
Latency time and absence of group effect: two examples Jean-Louis Deneubourg 1, Eric Bonabeau 2, Guy Theraulaz 3 (1) Unit of Theoretical Behavioral Ecology, Service de Chimie-Physique, CP 231, Université
More informationUniversité Libre de Bruxelles
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle elf-assembly on Demand in a Group of Physical Autonomous Mobile Robots Navigating
More informationSWARMING, or aggregations of organizms in groups, can
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART B: CYBERNETICS, VOL. 34, NO. 1, FEBRUARY 2004 539 Stability Analysis of Social Foraging Swarms Veysel Gazi, Member, IEEE, and Kevin M. Passino, Senior
More informationIntelligent Systems and Control Prof. Laxmidhar Behera Indian Institute of Technology, Kanpur
Intelligent Systems and Control Prof. Laxmidhar Behera Indian Institute of Technology, Kanpur Module - 2 Lecture - 4 Introduction to Fuzzy Logic Control In this lecture today, we will be discussing fuzzy
More informationSignal Modeling, Statistical Inference and Data Mining in Astrophysics
ASTRONOMY 6523 Spring 2013 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Course Approach The philosophy of the course reflects that of the instructor, who takes a dualistic view
More informationSOLIDS AND LIQUIDS - Here's a brief review of the atomic picture or gases, liquids, and solids GASES
30 SOLIDS AND LIQUIDS - Here's a brief review of the atomic picture or gases, liquids, and solids GASES * Gas molecules are small compared to the space between them. * Gas molecules move in straight lines
More informationDiscrete Evaluation and the Particle Swarm Algorithm.
Abstract Discrete Evaluation and the Particle Swarm Algorithm. Tim Hendtlass and Tom Rodgers, Centre for Intelligent Systems and Complex Processes, Swinburne University of Technology, P. O. Box 218 Hawthorn
More informationModular Thermal Design Concepts: Thermal Design of a Spacecraft on a Module Level for LEO Missions
Modular Thermal Design Concepts: Thermal Design of a Spacecraft on a Module Level for LEO Missions Mark Barton AeroAstro mark.barton@aeroastro.com 703.723.9800 x 131 2005 AIAA/USU Conference on Small Satellites
More informationPHY 481/581. Some classical/quantum physics for the nanometer length scale.
PHY 481/581 Some classical/quantum physics for the nanometer length scale http://creativecommons.org/licenses/by-nc-sa/3.0/ 1 What is nano-science? the science of materials whose properties scale with
More informationBayesian Networks Inference with Probabilistic Graphical Models
4190.408 2016-Spring Bayesian Networks Inference with Probabilistic Graphical Models Byoung-Tak Zhang intelligence Lab Seoul National University 4190.408 Artificial (2016-Spring) 1 Machine Learning? Learning
More information