Emergent Pattern Detection in Vegetable Population Dynamics S. - - PDF document

emergent pattern detection in vegetable population
SMART_READER_LITE
LIVE PREVIEW

Emergent Pattern Detection in Vegetable Population Dynamics S. - - PDF document

Emergent Pattern Detection in Vegetable Population Dynamics S. Bandini, S. Manzoni, G. Mauri, S. Redaelli Dept. Of Computer Science, Systems and Communication University of Milan-Bicocca 1 CAFFE (Cellular Automata For Forest Ecosystems)


slide-1
SLIDE 1

1

1

Emergent Pattern Detection in Vegetable Population Dynamics

  • S. Bandini, S. Manzoni, G. Mauri, S. Redaelli
  • Dept. Of Computer Science, Systems and

Communication University of Milan-Bicocca

2

CAFFE (Cellular Automata For Forest Ecosystems) project

CAFFE project: interdisciplinary research involving computer scientists of University of Milano-Bicocca and biologists and ecosystem managers of Austrian Research Center.

slide-2
SLIDE 2

2

3

Studying forests

Studying interaction of forest ecosystem with other

dynamic systems (humans or other natural phenomena)

Importance of studying forests by simulation.

  • Forest byorithm are very long.
  • It is impracticable to do some experiments with real plants

in a real area.

One of the main goal: design a method to support

the analysis step of simulations of forests modeled according to a distributed approach.

4

The CA-based forest model (1)

The model permits the simulation of the dynamics of an heterogeneous plant population:

– Different plant species can inhabit the same area and

compete for the same resources

– The CA reproduces a given territory

area, divided in cells

– Each cell can be inhabited by a tree – Each cell contains a given amount

  • f resources needed by plants

to sprout, grow, survive, and reproduce themselves.

slide-3
SLIDE 3

3

5

The CA-based forest model (2)

l The resources considered in the model are:

– Water – Nitrogen – Potassium – Sunlight

l Each cell contains a given amount of each resource l At each update step of the CA the plants living in the

area need a minimum amount of resources to survive, competing with the others for them

6

The CA-based forest model (3)

l The presence of a plant in a cell can also influence

surrounding area and the trees living in it

l This influence has been modeled so to keep

interactions local as follows:

– Resources flow from richer cells to poorer neighbors – Thus, a cell containing a large tree is poorer on resources,

since the tree is more “greedy”

4 6 2 5 3

slide-4
SLIDE 4

4

7

Example of forest simulation with “FORESTE”, a CA-based simulation tool.

During a simulation we can notice some emergent phenomena In this simulation screenshot we have two vegetal polulations represented in two different colors (light green and dark green)

8

We can notice the progressive shift

  • f the selected group.
slide-5
SLIDE 5

5

9

Some considerations...

l The vegetal movement is considered in a

space-time dimension through the birth/death process.

l With more plant groups emergent dynamics

are more complex and for a human operator it is very difficult to recognize all collective behaviors during a simulation.

10

Detecting emergent properties

l The idea: find meaningful recurrent patterns

  • f emergent phenomena

l Meaningful patterns: more definables, easyer

recognizables

l Problems:

  • Patterns classification
  • Patterns detection
slide-6
SLIDE 6

6

11

Using Go game patterns

l Affinity between Go and

forest systems in competition scenario.

l Using well known

spatial pattern in Go game to detect forest emergent phenomena

12

Go basic rules

Concept of liberty:

free spaces around a piece, or a group of pieces.

Territory Capture

Two people play with a Go board and Go pieces, which have two colors, black and

  • white. The players take

turns putting black and white pieces on the board to surround area, or territory. If I put the last surrounder piece...

slide-7
SLIDE 7

7

13

Go affinities

l With forests

– Representation of territory competition – Representation of two species – Single pieces can appear, disappear and can not move.

l With CA

– The presence of a grid that represents the territory area – The grid cells can have three states: void, black or white – The presence of local evolution rules

14

Go-like patterns detected for forests ecosystems (1)

Go game Ko:

Turn over in a shared area.

Geta:

A group completely surrounded it will die.

Forests

Colored arrows represent possible directions of reproduction and free space.

slide-8
SLIDE 8

8

15

Go-like patterns detected for forests ecosystems (2)

Go game Forests Shicho:

A group shifts toward more suitable area.

Iki:

A strong group that can survive for long time.

Tsugi:

Connected groups are stronger.

16

Now we have a name for the

  • bserved

phenomena.

slide-9
SLIDE 9

9

17

SHICHO

18

Experiments and simulations

l Goal:

– validation of Go-like patterns:

from a pattern suitable starting point to a specific final configuration (we let evolve the starting situation observing if the final state is in accordance with the expected result)

l Method:

– variation of some meaningful parameters: (pattern size,

characteristic of the involved species, species initial configurations, and others)

slide-10
SLIDE 10

10

19

Simulation experiments: example and results

An example of Geta simulation experiment: From a given starting point to an expected conclusion.

Patterns occurrence

Geta Ko Shicho Iki Tsugi

100% 0%

  • ccurrence

simulations / pattern ≈ 20 In general we have a high occurrence. Patterns evolve toward the expected final configuration for the phenomenon

  • ccurrence.

We have low results when it is difficult to establish a good starting situation.

20

Toward an analysis automatization in CA-based simulator system

Formalization and implementation of detection algorithms to find the studied patterns in a CA system.

Simulation Step n Simulation Step n+1 Go-like patterns detection and interpretation

slide-11
SLIDE 11

11

21

An idea: the concept of group

Ni = cell i neighborhood; n ∈ Ni Definition 1 connection Given the individuals t and s we say that t is connected to s (and vice versa) if t ∈ Ns. We will indicate this with the simbol t → s. Definition 2 belonging to a group Given an individual t and a group A we say that t ∈ A if t → k where k ∈ A. trivial group definition a single isolated element i is consider a trivial group composed by only one individual. Von Neumann neighborhood

22

Finding rules for pattern detection (examples)

Geta: verify if a group

is completely surrounded

1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8

Shicho: verify if there

is the shift of the group mass centre

Tsugi: two groups

become one

slide-12
SLIDE 12

12

23

Conclusions and future works

1.

Suitability of Go-like patterns.

2.

Detecting all patterns of emergent phenomena is very difficult for a human operator. (we remark the necessity of an automatic detection method).

3.

We will further improve the functionalities of the proposed CA-based method for forest ecosystem representation.

4.

We will implement a simulator with automatic tools for pattern detection and analysis.