Swarm Intelligence Flashcards

1
Q

One property of a swarm is each member’s inability to do a task by itself, but…

A

It can do the same task easily as a swarm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

The ability to do a task that a member could not do otherwise is called…

A

An emergent property of the swarm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Each element of a swarm has…

A

A simple behaviour, and a set of rules for interacting with other members and the environment

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Ant Colony Optimisation is an evolutionary algorithm inspired by ants, used for the task of…

A

Finding the shortest path/optimisation of a task (both are technically true)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Stimergy is a phenomenon we observe in nature, such that…

A

Animals communicate via interaction with the environment

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Sematonic stimergy is where…

A

The action of an agent is directly related to problem solving

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Sign-based stimergy is where…

A

The action of an agent affects the environment, but is not directly aimed at problem solving

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Ants have highly sophisticated [sematonic/sign-based] stimergy, where they communicate via […].

A

Sign-based, pheromones

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

The stronger scented a pheromone trail is, the more likely an ant has been down this path before and [failed to return/returned safely], therefore it is [less/more] likely for an ant to take this path.

A

Returned safely, more

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

In ACO, ants are […] that move along […] between nodes in a graph.

A

Agents, edges

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

In ACO, an ant’s path represents a specific…

A

Candidate solution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

In ACO, after an ant has generated a candidate solution…

A

Pheromone is laid on that path

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

In ACO, [more/less] pheromones are placed on a path based on the [ant/quality of the solution].

A

More, based on the quality of the solution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

In ACO, the initial graph begins with [no/equal/random] pheromone on along each edge.

A

Random

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

In ACO, an ant does not return to a node it has already been to due to…

A

A tabulist describing the nodes it has already visited

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

In ACO, after each [ant/iteration], we evaporate the pheromone.

17
Q

In ACO, we define the probability that an ant will go to a city as…

A

The probability we are going to that city, divided by the probability we will go to the other cities

18
Q

In ACO, pheromones are updated using the update rule, which measures each update as…

A

The original pheromone multiplied by a learning rate coefficient, plus some measure of the quality of the path

19
Q

The Max-Min Ant System updates pheromone trails based on […] ants.

20
Q

The Elitist Rank Ant System updates pheromone trails based on […] ants.

A

The best of a set number of

21
Q

Evolutionary algorithms like ACO can be applied to any problem as long as you have…

A

Relevant embedding

22
Q

A construction graph represents…

A

The construction of the problem, where we represent each decision horizontally as a node linked to each possible remaining choice

For example, given a graph of size 10, we start at the beginning node, then make some decision of the 9 remaining nodes. This becomes a new node, which is connected to 8 nodes, and so on.