Advertisement
1 / 32

Swarm Intelligence PowerPoint PPT Presentation


  • 166 Views
  • Uploaded on 31-01-2012
  • Presentation posted in: General

Outline. BackgroundWhat is a Swarm Intelligence (SI)?Examples from natureOrigins and Inspirations of SIAnt Colony OptimizationParticle Swarm OptimizationSummaryWhy do people use SI?Advantages of SIRecent developments in SI. What is a Swarm?. A loosely structured collection of interacting agentsAgents:Individuals that belong to a group (but are not necessarily identical) They contribute to and benefit from the groupThey can recognize, communicate, and/or interact with each otherThe 9458 - PowerPoint PPT Presentation

Download Presentation

Swarm Intelligence

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Swarm intelligence l.jpg

Worker Ant #1: I'm lost! Where's the line? What do I do? Worker Ant #2: Help! Worker Ant #3: We'll be stuck here forever! Mr. Soil: Do not panic, do not panic. We are trained professionals. Now, stay calm. We are going around the leaf. Worker Ant #1: Around the leaf. I-I-I don't think we can do that. Mr. Soil: Oh, nonsense. This is nothing compared to the twig of '93.

- A Bug’s Life, Walt Disney, 1998

Swarm Intelligence

Stephany Coffman-Wolph

4/11/07


Outline l.jpg

Outline

  • Background

    • What is a Swarm Intelligence (SI)?

    • Examples from nature

    • Origins and Inspirations of SI

  • Ant Colony Optimization

  • Particle Swarm Optimization

  • Summary

    • Why do people use SI?

    • Advantages of SI

    • Recent developments in SI


What is a swarm l.jpg

What is a Swarm?

  • A loosely structured collection of interacting agents

    • Agents:

      • Individuals that belong to a group (but are not necessarily identical)

      • They contribute to and benefit from the group

      • They can recognize, communicate, and/or interact with each other

  • The instinctive perception of swarms is a group of agents in motion – but that does not always have to be the case.

  • A swarm is better understood if thought of as agents exhibiting a collective behavior


Swarm intelligence si l.jpg

Swarm Intelligence (SI)

  • An artificial intelligence (AI) technique based on the collective behavior in decentralized, self-organized systems

  • Generally made up of agents who interact with each other and the environment

  • No centralized control structures

  • Based on group behavior found in nature


Examples of swarms in nature l.jpg

Examples of Swarms in Nature:

  • Classic Example: Swarm of Bees

  • Can be extended to other similar systems:

    • Ant colony

      • Agents: ants

    • Flock of birds

      • Agents: birds

    • Traffic

      • Agents: cars

    • Crowd

      • Agents: humans

    • Immune system

      • Agents: cells and molecules


Si the beginnings l.jpg

SI - The Beginnings

  • First introduced by Beni and Wang in 1989 with their study of cellular robotic systems

  • The concept of SI was expanded by Bonabeau, Dorigo, and Theraulaz in 1999 (and is widely recognized by their colleges)

    • “Using the expression ‘swarm intelligence’ to describe only this work seems unnecessarily restrictive: that is why we extend its definition to include devices inspired by the collective behavior of insect colonies and other animal societies”


Swarm robotics l.jpg

Swarm Robotics

  • Swarm Robotics

    • The application of SI principles to collective robotics

    • A group of simple robots that can only communicate locally and operate in a biologically inspired manner

    • A currently developing area of research


With the rise of computer simulation models l.jpg

With the Rise of Computer Simulation Models:

  • Scientists began by modeling the simple behaviors of ants

  • Leading to the study of how these models could be combined (and produce better results than the models of the individuals)

  • Giving us insight into the nature of humans, society, and the world

  • Further leading to adapting observations in nature to computer algorithms


Why insects l.jpg

Why Insects?

  • Insects have a few hundred brain cells

  • However, organized insects have been known for:

    • Architectural marvels

    • Complex communication systems

    • Resistance to hazards in nature

  • In the 1950’s E.O. Wilson observed:

    • A single ant acts (almost) randomly – often leading to its own demise

    • A colony of ants provides food and protection for the entire population


Two common si algorithms l.jpg

Two Common SI Algorithms

  • Ant Colony Optimization

  • Particle Swarm Optimization


Ant colony optimization aco l.jpg

Ant Colony Optimization (ACO)

  • The study of artificial systems modeled after the behavior of real ant colonies and are useful in solving discrete optimization problems

  • Introduced in 1992 by Marco Dorigo

    • Originally called it the Ant System (AS)

    • Has been applied to

      • Traveling Salesman Problem (and other shortest path problems)

      • Several NP-hard Problems

  • It is a population-based metaheuristic used to find approximate solutions to difficult optimization problems


What is metaheuristic l.jpg

What is Metaheuristic?

  • “A metaheuristic refers to a master strategy that guides and modifies other heuristics to produce solutions beyond those that are normally generated in a quest for local optimality” – Fred Glover and Manuel Laguna

  • Or more simply:

    • It is a set of algorithms used to define heuristic methods that can be used for a large set of problems


Artificial ants l.jpg

Artificial Ants

  • A set of software agents

  • Stochastic

  • Based on the pheromone model

    • Pheromones are used by real ants to mark paths. Ants follow these paths (i.e., trail-following behaviors)

  • Incrementally build solutions by moving on a graph

  • Constraints of the problem are built into the heuristics of the ants


Using aco l.jpg

Using ACO

  • The optimization problem must be written in the form of a path finding problem with a weighted graph

  • The artificial ants search for “good” solutions by moving on the graph

    • Ants can also build infeasible solutions – which could be helpful in solving some optimization problems

  • The metaheuristic is constructed using three procedures:

    • ConstructAntsSolutions

    • UpdatePheromones

    • DaemonActions


Constructantssolutions l.jpg

ConstructAntsSolutions

  • Manages the colony of ants

  • Ants move to neighboring nodes of the graph

  • Moves are determined by stochastic local decision policies based on pheromone tails and heuristic information

  • Evaluates the current partial solution to determine the quantity of pheromones the ants should deposit at a given node


Updatepheromones l.jpg

UpdatePheromones

  • Process for modifying the pheromone trails

  • Modified by

    • Increase

      • Ants deposit pheromones on the nodes (or the edges)

    • Decrease

      • Ants don’t replace the pheromones and they evaporate

  • Increasing the pheromones increases the probability of paths being used (i.e., building the solution)

  • Decreasing the pheromones decreases the probability of the paths being used (i.e., forgetting)


Daemonactions l.jpg

DaemonActions

  • Used to implement larger actions that require more than one ant

  • Examples:

    • Perform a local search

    • Collection of global information


Applications of aco l.jpg

Applications Of ACO

  • Vehicle routing with time window constraints

  • Network routing problems

  • Assembly line balancing

  • Heating oil distribution

  • Data mining


Two common si algorithms19 l.jpg

Two Common SI Algorithms

  • Ant Colony Optimization

  • Particle Swarm Optimization


Particle swarm optimization pso l.jpg

Particle Swarm Optimization (PSO)

  • A population based stochastic optimization technique

  • Searches for an optimal solution in the computable search space

  • Developed in 1995 by Dr. Eberhart and Dr. Kennedy

  • Inspiration: Swarms of Bees, Flocks of Birds, Schools of Fish


More on pso l.jpg

More on PSO

  • In PSO individuals strive to improve themselves and often achieve this by observing and imitating their neighbors

  • Each PSO individual has the ability to remember

  • PSO has simple algorithms and low overhead

    • Making it more popular in some circumstances than Genetic/Evolutionary Algorithms

    • Has only one operation calculation:

      • Velocity: a vector of numbers that are added to the position coordinates to move an individual


Psychological systems l.jpg

Psychological Systems

  • A psychological system can be thought of as an “information-processing” function

  • You can measure psychological systems by identifying points in psychological space

  • Usually the psychological space is considered to be multidimensional


Philosophical leaps required l.jpg

“Philosophical Leaps” Required:

  • Individual minds = a point in space

  • Multiple individuals can be plotted in a set of coordinates

  • Measuring the individuals result in a “population of points”

  • Individuals near each other imply that they are similar

  • Some areas of space are better than others

    • Location, location, location…


Applying social psychology l.jpg

Applying Social Psychology

  • Individuals (points) tend to

    • Move towards each other

    • Influence each other

    • Why?

      • Individuals want to be in agreement with their neighbors

  • Individuals (points) are influenced by:

    • Their previous actions/behaviors

    • The success achieved by their neighbors


What happens in pso l.jpg

What Happens in PSO

  • Individuals in a population learn from previous experiences and the experiences of those around them

    • The direction of movement is a function of:

      • Current position

      • Velocity (or in some models, probability)

      • Location of individuals “best” success

      • Location of neighbors “best” successes

  • Therefore, each individual in a population will gradually move towards the “better” areas of the problem space

  • Hence, the overall population moves towards “better” areas of the problem space


Performance of pso algorithms l.jpg

Performance of PSO Algorithms

  • Relies on selecting several parameters correctly

  • Parameters:

    • Constriction factor

      • Used to control the convergence properties of a PSO

    • Inertia weight

      • How much of the velocity should be retained from previous steps

    • Cognitive parameter

      • The individual’s “best” success so far

    • Social parameter

      • Neighbors’ “best” successes so far

    • Vmax

      • Maximum velocity along any dimension


Applications of pso l.jpg

Applications Of PSO

  • Human tremor analysis

  • Electric/hybrid vehicle battery pack state of change

  • Human performance assessment

  • Ingredient mix optimization

  • Evolving neural networks to solve problems


Pso and evolutionary algorithms l.jpg

PSO and Evolutionary Algorithms

  • PSO algorithms have been and continue to greatly influenced by evolutionary algorithms (EA)

    • i.e., methods of simulating evolution on a computer

  • Are sometimes considered a type of evolutionary algorithm – but viewed to be “an alternative way of doing things”

  • Some differences:

    • The concept of selection is not considered in PSO

    • EA uses fitness ,while PSO uses individuals’ and neighbors’ successes, to move towards a “better” solution


Why do people use aco and pso l.jpg

Why Do People Use ACO and PSO?

  • Can be applied to a wide range of applications

  • Easy to understand

  • Easy to implement

  • Computationally efficient


Advantages of si l.jpg

Advantages of SI

  • The systems are scalable because the same control architecture can be applied to a couple of agents or thousands of agents

  • The systems are flexible because agents can be easily added or removed without influencing the structure

  • The systems are robust because agents are simple in design, the reliance on individual agents is small, and failure of a single agents has little impact on the system’s performance

  • The systems are able to adapt to new situations easily


Recent developments in si applications l.jpg

Recent Developments in SI Applications

  • U.S. Military is applying SI techniques to control of unmanned vehicles

  • NASA is applying SI techniques for planetary mapping

  • Medical Research is trying SI based controls for nanobots to fight cancer

  • SI techniques are applied to load balancing in telecommunication networks

  • Entertainment industry is applying SI techniques for battle and crowd scenes


Resources l.jpg

Resources

  • Ant Colony Optimization by Marco Dorigo and Thomas Stϋtzle, The MIT Press, 2004

  • Swarm Intelligence by James Kennedy and Russell Eberhart with Yuhui Shi, Morgan Kauffmann Publishers, 2001

  • Advances in Applied Artificial Intelligence edited by John Fulcher, IGI Publishing, 2006

  • Data Mining: A Heuristic Approach by Hussein Abbass, RuhulSarker, and Charles Newton, IGI Publishing, 2002

  • “Ant Colony Optimization” Curatored by Marco Dorigo, http://www.scholarpedia.org/article/Ant_Colony_Optimization

  • “Ant Colony Optimization” by Marco Dorigo, http://iridia.ulb.ac.be/~mdorigo/ACO/ACO.htm;

  • “Particle Swarm Optimization” http://www.swarmintelligence.org

  • “Swarm Intelligence” http://en.wikipedia.org/wiki/Swarm_intelligence

  • Picture of Flik, http://www.pixar.com