The Power of Simplicity

Deepak Nayak Regd. No. :0811015087 AE1(B)

Swarm Intelligence
Collective

system capable of accomplishing difficult tasks in dynamic and varied environments without any external guidance or control and with no central coordination a collective performance which could not normally be achieved by an individual acting alone a natural model particularly suited to distributed problem solving

Achieving

Constituting

Swarm Intelligence

Swarm Intelligence

Swarm Intelligence

Swarm Intelligence

Examples

Swarms

build colonies and work in a coordinated manner yet no single member of the swarm is in control. Flocks of birds coordinate to move without collision. Ants manage to find food sources quickly and efficiently. Termites build giant structures. Schools of fish fend off predators and move as one body

Why Social Colony is a source of inspiration?

Robust: tasks are completed even if some individuals fail Decentralized: there is no central controller in the colony Self-organized: paths to solutions are emergent rather than predefined Flexible: the colony can respond to internal perturbations and external challenges

Pheromone Trails
Species

lay chemical substance pheromone while travelling from nest, to nest or possibly in both directions. evaporate.

Pheromones Pheromones

accumulate with multiple ants using same path.

Ant Colony Optimization

Natural Behavior of Ant

ACO Concept
Ants

(blind) navigate from nest to food source path is discovered via pheromone trails

Shortest

each ant moves at random, probabilistically pheromone is deposited on path ants detect lead ants path, inclined to follow, i.e., more pheromone on path increases probability of path being followed

Ant Foraging
Cooperative search by pheromone trails

1. The natural behavior of these ants and be programmed into an ant algorithm, which we can use to find the shortest path within graphs. 2. As ants move they leave behind a chemical substance called pheromone, which other ants can smell and identify that an ant has been there before.

ACO algorithm
Main steps of the ACO algorithm are given below: Pheromone trail initialization Solution construction using pheromone trail Each ant constructs a complete solution to the problem according to a probabilistic State transition rule. The state transition rule depends mainly on the state of the pheromone . Pheromone trail update.

procedure ACO_MetaHeuristic while(not_termination) generateSolutions() daemonActions() pheromoneUpdate() end while end procedure

Algorithm

Particle Swarm Optimization (PSO)

PSO is a robust stochastic optimization technique based on the movement and intelligence of swarms. PSO applies the concept of social interaction to problem solving.

PSO Search Scheme

It uses a number of agents, i.e., particles, that constitute a swarm moving around in the search space looking for the best solution. Each particle is treated as a point in a N-dimensional space which adjusts its flying according to its own flying experience as well as the flying experience of other particles.

Particle Flying Model

pbest the best solution achieved so far by that particle. gbest the best value obtained so far by any particle in the neighborhood of that particle.

The basic concept of PSO lies in accelerating each particle toward its pbest and the gbest locations, with a random weighted acceleration at each time.

 Each

agent remembers personal best value of the function (pbest) Globally best personal value is known (gbest) Both points are attracting the agent

PSO Algorithm
For each particle Initialize particle END Do For each particle Calculate fitness value If the fitness value is better than the best fitness value (pbest) in history set current value as the new pbest End Choose the particle with the best fitness value of all the particles as the gbest For each particle Calculate particle velocity according equation (*) Update particle position according equation (**) End While maximum iterations or minimum error criteria is not attained

Bad News , Good News

Bad news Difficult to predict collective behaviour from individual rules. Interrogate one of the participants, it wont tell you anything about the function of the group. Small changes in rules lead to different group-level behaviour. Individual behaviour looks like noise: how do you detect threats? Good news Possible to efficiently control organization or manipulate groups using simple rules. Possible to predict group-level outcome using bottom simulation.

Applications of SI
Swarm/crowd

programming Computer Networks: Adaptive Routing Robotics/Artificial Intelligence

simulation

Any Questions?

Thanks !!!!