Loading in 5 sec....

Topic 7: Stigmergy, Swarm Intelligence and Ant AlgorithmsPowerPoint Presentation

Topic 7: Stigmergy, Swarm Intelligence and Ant Algorithms

- By
**milek** - Follow User

- 119 Views
- Uploaded on

Download Presentation
## PowerPoint Slideshow about ' Topic 7: Stigmergy, Swarm Intelligence and Ant Algorithms' - milek

**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

### Topic 7: Stigmergy, Swarm Intelligence and Ant Algorithms

stigmergy

swarm intelligence

ant algorithms

AntNet: routing

AntSystem: TSP

Some natural Swarm Intelligence systems

- Ants
- find the shortest path to food
- go on raiding parties to gather it
- carry it cooperatively
- make cemeteries
- sort their brood by size
- etc.

- Termites
- build nests with complex features like
- fortified chambers
- spiral air vents
- fungus gardens
- etc.

- build nests with complex features like
- Bees
- gather pollen with high efficiency, exploiting the nearest richest food source first.

- Geese
- coordinate takeoff and landing
- flight patterns
- etc.

- Fish / Birds /…
- swarms

- Human societies
- economies ?

Swarm Intelligence

- “Swarm Intelligence (SI) is the property of a system whereby the collective behaviors of (unsophisticated) agents interacting locally with their environment cause coherent functional global patterns to emerge.”
- characteristics of a swarm:
- distributed, no central control or data source
- no (explicit) model of the environment
- perception of environment, i.e. sensing
- ability to change environment
- problem solving is emergent behaviour

How Do Social Insects Coordinate Their Behaviour?

- communication is necessary
- two types of communication
- direct
- antennation, trophallaxis (food or liquid exchange),mandibular contact, visual contact, chemical contact, etc.

- indirect
- two individuals interact indirectly when one of them modifies the environment and the other responds to the new environment at a later time
called stigmergy

- two individuals interact indirectly when one of them modifies the environment and the other responds to the new environment at a later time

- direct

Stigmergy

- “La coordination des taches, la regulation des constructions ne dependent pas directement des oeuvriers, mais des constructions elles-memes. L’ouvrier ne dirige pas son travail, il est guidé par lui. C’est à cette stimulation d’un type particulier que nous donnons le nom du STIGMERGIE (stigma, piqure; ergon, travail, oeuvre = oeuvre stimulante).” Grassé P. P., 1959
- [“The coordination of tasks and the regulation of constructions does not depend directly on the workers, but on the constructions themselves. The worker does not direct his work, but is guided by it. It is to this special form of stimulation that we give the name STIGMERGY (stigma, sting; ergon, work, product of labour = stimulating product of labour).”]

Nest

Example of Stigmergy: Trail Following and Ants Foraging Behaviour- while walking, ants and termites
- may deposit a pheromone on the ground
- follow with high probability pheromone trails they sense on the ground

Example of Stigmergy:Ant cemeteries in nature

- simple behaviour rules for ants
- wander around
- if you find a dead antpick it up with probability inversely proportional to the number of other dead ants nearby
- if you are carrying a dead antput it down with probability directly proportional to the number of other dead ants nearby

Stigmergy

Communication through marks in the environment …

- Marks serve as a shared memory for the agents
- Promotes loose coupling
- Robust
Stigmergy ~ action + sign:

- Agents put marks in the environment (inform other agents about issues of interest)
- other agents perceive these marks (influence their behavior)
- manipulate marks
- other agents perceive the marks
- ….etc.
Marks can be

- static (environment does not manipulate marks over time)
- e.g., flags

- dynamic (environment manipulates marks over time)
- e.g., pheromones, gradient fields

Ants Foraging BehaviourExample: The Double Bridge Experiment

15 cm

A

Nest

Food

B

Simple bridge % of ant passages on

the two branches

Goss et al., 1989, Deneubourg et al., 1990

“Artificial” Stigmergy

Indirect communicationmediated by

modifications of environmental states

which are only locally accessible by

the communicating agents

Dorigo & Di Caro, 1999

- Characteristics of artificial stigmergy:
- Indirect communication
- Local accessibility

What Are Ant Algorithms?

- Ant algorithms are multi-agent systems that exploit artificial stigmergy as a means for coordinating artificial ants for the solution of computational problems
- examples
- AntNet: network routing
- AntSystem: TSP

AntNet: An Ant Algorithm for Routing in Packet-Switched Networks (e.g. Internet)

- the routing problem
- build routing table at each node
- costs are dynamic
- adaptive routing is hard

AntNet data structure Networks (e.g. Internet)

- routing table
- probabilities of choosing each neighbor nodes for each possible final destination

- trips vector
- contains statistics about ants’ trip times from current node k to each destination node d (means and variances)

P(k,n,d)

Probabilistic rule to Networks (e.g. Internet)

choose the path

Artificial Ants in a NetworkPheromone trail

Memory

depositing

?

Source

Destination

Simple AntNet Algorithm Networks (e.g. Internet) ants memorize visited nodes and incurred costs once destination is reached, ants deterministically retrace their path backwards, updating pheromone trails that is a function of the quality of the solution they generated

- ants are launched regularlyfrom each node to randomly chosen destination
- ants build their paths probabilistically with probability function of
- artificial pheromone values
- heuristic values

- refresh + evaporation !!

AntNet Routing - Agents Networks (e.g. Internet)

- Two kinds of Agents
- Forward Ant
- explores the network and collects information
- when reaches the destination, changes into backward ant

- Backward Ant
- goes back in the same path as forward ant
- update routing tables for all the nodes in the path

- Forward Ant

( Networks (e.g. Internet)N1,T1)

(N2,T2)

(N3,T3)

(N4, T4)

(N1,T1)

(N2,T2)

(N3,T3)

(N2,T2)

(N1,T1)

(N1,T1)

Forward Ant

Forward Ant

Forward Ant

Forward Ant

AntNet: F-Ants and B-Ants- F-ants
- collect implicit and explicit information on paths and traffic load
- implicit through arrival rate at destination
- explicit by storing experienced trip times

- share queues with data packets

- collect implicit and explicit information on paths and traffic load
- B-ants
- backpropagate fast
- use higher priority queues

2

1

4

3

Backward Ant

Backward Ant

Backward Ant

Backward Ant

Using Pheromone and Memory Networks (e.g. Internet)to Choose the Next Node

Memory of

visited nodes

tijd

j

i

tikd

tird

k

r

Ants’ Probabilistic Transition Rule Networks (e.g. Internet)

- tijd is the amount of pheromone trail on edge (i,j,d)
- Jik is the set of feasible nodes ant k positioned on
node i can move to

Using Pheromone and Heuristic Networks (e.g. Internet)to Choose the Next Node

Memory of

visited nodes

a heuristic evaluation of link (i,j,d)

which introduces problem specific information

stored in pheromone table

tijd;ijd

j

i

tikd;ikd

tird;ird

k

r

Using Pheromone and Heuristic Networks (e.g. Internet)to Choose the Next Node

Memory of

visited nodes

a heuristic evaluation of link (i,j,d)

which introduces problem specific information:

for AntNet: proportional to the inverse of link (i,j) queue length

stored in pheromone table

tijd;ijd

j

i

tikd;ikd

tird;ird

k

r

- B-ants Networks (e.g. Internet) update routing tables:
- if B-ant has source node d and goes from node n to k
- Increase the probability of the channel that backward ant comes from
P(k,n,d) = P(k,n,d) + R.(1 – P(k,n,d))

- Decrease the probability of the other channels
P(k,i,d) = P(k,i,d) - R.(1 – P(k,i,d)) for all i != n

R (0 < R <= 1), function of

- T: time experienced by F-ant

- m: avg time for same destination memorized in trips table

- sigma: std. deviation for same destination memorized in trips table

P(k,n,d)

AntNet evaluation Networks (e.g. Internet)

- extensive tests and experiments
- American NSF net
- Japanese NTT net
- artificial networks
- simple graphs
- grid networks

- in short: good results
- similar throughput compared to other routing algorithms
- remarkably smaller avg. packet delay

Ant Colony Optimization (ACO) Networks (e.g. Internet)

- TSP has been a popular problem for the ACO models.
- several reasons why TSP is chosen …

- Key concepts:
- Positive feedback
- build a solution using local solutions, by keeping good solutions in memory.

- Negative feedback
- want to avoid premature convergence, evaporate the pheromone.

- Time scale
- number of runs are also critical.

- Positive feedback

Traveling Salesman Problem (TSP) Networks (e.g. Internet)

Ant Optimization of TSP Networks (e.g. Internet) ants deposit pheromone on their path with an intensity inversely proportional to the length of their tour pheromone decays with each time step repeat steps 2 - 4 until some threshold is met

- seed all paths with initial pheromone
- ants make a tour of all cities
- ant probabilistically selects next city to visit considering distance and pheromone strength on each path

[] Networks (e.g. Internet)

[]

[]

[]

[]

1

2

3

4

5

A simple TSP exampleA

B

C

D

E

dAB =100;dBC = 60…;dDE =150

[D,E,A,B] Networks (e.g. Internet)

[B,C,D,A]

[E,A,B,C]

[A,D,C,E]

[C,B,E,D]

4

2

5

1

3

Iteration 4A

B

C

D

E

[A,D,C,E,B] Networks (e.g. Internet)

[C,B,E,D,A]

[D,E,A,B,C]

[B,C,D,A,E]

[E,A,B,C,D]

1

3

4

2

5

Iteration 5A

B

C

D

E

[A,D,C,E,B] Networks (e.g. Internet)

[E,A,B,C,D]

[B,C,D,A,E]

[C,B,E,D,A]

[D,E,A,B,C]

1

5

2

3

4

Path and Pheromone EvaluationL1 =300

L2 =450

L3 =260

L4 =280

L5 =420

End of First Run Networks (e.g. Internet)

Save Best Tour (Sequence and length)

All ants die

New ants are born

stopping criteria

stagnation

max.runs

Ant cycle for TSP Networks (e.g. Internet)

- tabu list
- random walk
- priorities
- backtracing and considering edge length

5

1

4

1

1

3

2

Tabu List Networks (e.g. Internet)

n : number of cities = one city tourm : number of antsk : ant indexs : member in tabu list (current city)

for each iteration in the ant algorithm cycle:insert town in „visited node list“

for (int k = 1 ; k <= m ; k++) {

insert town of ant k in Tabuk(s) }

Random Walk & Priorities Networks (e.g. Internet)

i,j : edge between nodes i,jnij : 1/distance(i,j)a : weight for markingb : weight for node „neighbourhoodness“

allowedk : unvisited cities for ant k

from ant routing table:

probability of ant k for going from city i to city j

Backtracing Networks (e.g. Internet)

i,j : edge between nodes i,jtij (t): marking at time tr : evaporation rate (t,t+n)

Q/Lk : const/tour-length of ant k

With Tabu List, ant routing table:

marking_delta = sum of markings of all ants k who passed (i,j)

marking after tour = evaporation_rate * marking_old + marking_delta

Ant System (Ant Cycle) Dorigo [1] 1991 Networks (e.g. Internet)

t = 0; NC = 0; τij(t)=c for ∆τij=0

Place the m ants on the n nodes

Initialize

Update tabuk(s)

Tabu list management

Choose the city j to move to. Use probability

Move k-th ant to town j. Insert town j in tabuk(s)

Compute the length Lk of every ant

Update the shortest tour found

=

For every edge (i,j)

Compute

For k:=1 to m do

Yes

Yes

NC<NCmax

&& not stagn.

Set t = t + n; NC=NC+1; ∆τij=0

No

End

10-Cities-Problem CCA0 Networks (e.g. Internet)

AntSystem marking distribution at beginning and after 100 cycles

Advantages: Networks (e.g. Internet)

- positive feedback accounts for rapid discovery of good solutions
- distributed computation avoids premature convergence
- the greedy heuristic helps find acceptable solution in the early solution in the early stages of the search process
- the collective interaction of a population of agents
Disadvantages:

- slower convergence than other heuristics
- performed poorly for TSP problems larger than 75 cities

Improvements to AS: Ant Colony System (ACS) Networks (e.g. Internet)

- ACS (pheromone update)

- update pheromone trail while building the solution
- ants eat pheromone on the trail
- local search added before pheromone update

Research Summary Networks (e.g. Internet) Ant Colony System (ACS) [Dorigo & Gambardella] Max-Min Ant System (MMAS) [Stutzle & Hoos]

- Ant System (AS) [Dorigo, Maniezzo & Colorni]
- Original implementation of ant-inspired optimization

- Ants probabilistically choose exploitation or biased exploration

- Only ant with best tour deposits pheromone
- Range of pheromone limited to given interval
- Pheromone levels initialized to max levels

Research Summary Networks (e.g. Internet) Ranked Ants Elite Ants Modified 3-Opt

- refinements
- Pheromone Trail Smoothing (PTS)
- increases pheromone on all segments in proportion to the difference from the max value

- Pheromone Trail Smoothing (PTS)

- n ants with best paths deposit pheromone based on rank

- best path per cycle receives additional pheromone

- iteratively swap order of three-city sub-paths such that total path length decreases

Result Comparison Networks (e.g. Internet)

[Stutzle & Hoos, 1999]

PTS = Pheromone Trail Smoothing

MMAS = MaxMin AntSystem

ACS = Ant Colony System

AS = Ant System

10,000 cycles per run

General ACO Networks (e.g. Internet)

- a stochastic construction procedure
- probabilistically build a solution
- iteratively adding solution components to partial solutions
- heuristic information
- pheromone trail

- reinforcement
- modify the problem representation at each iteration
- ants work concurrently and independently
- collective interaction via indirect communication leads to good solutions

Conclusion Networks (e.g. Internet)

- general ACO work well on static problems like TSP, but hard to beat specialist algorithms
but most of all …

- ants are “dynamic” optimizers
- inherently capable of dealing with dynamism
Other Application Domains for Ants

- manufacturing control
- peer-2-peer
- active networking
- …
- similar principles
- artificial stigmergy / feedback through pheromones
- information decay (pheromone evaporation)
- probabilistic choice in path following
- …

- similar principles

Download Presentation

Connecting to Server..