Constructing the Environment for zcs

First we will provide an environment according to the description as given in 4.4. This is a scilab programm called 'environment.sce' and it contains several functions. One is called [GRID]=gridgen(Y,X). This function generates from the two numbers Y and X a two-dimensional grid according to the structure of a wood1-world. In the theory such a function is not necessary because we simply assume some environment $ E$ as 'given'.

Realizing an environment in the computer induces another problem. If we have more than one agent active in the same environment using a sequential processing we have to define some 'protocol' how we 'simulate' simultaneous actions. The most simple approach is to make before any new action cycle a random ordering and then process every agent one after the other.

To realize this we have to assume that the simulated environment $ E^{S}$ embraces at least two components: (i) a two-dimensional grid $ G$ for the 'space' of the environment and (ii) a list of registered agents $ AL$ with the basic information agent identifier, position, direction, new action, and reward $ \langle AID, POS, DIR, ACT, REW\rangle$. Based on these informations it is possible to compute the content of visual input as well as the possible next moves. Thus we will have


$\displaystyle EF^{S}(x)$ $\displaystyle iff$ $\displaystyle x = \langle E^{S}, A, \iota, \mu\rangle$ (4.51)
$\displaystyle E^{S}$ $\displaystyle =$ $\displaystyle \langle G, AL\rangle$ (4.52)
$\displaystyle G$ $\displaystyle =$ $\displaystyle (2^{POS \times OBJ})^{n,m}$ (4.53)
$\displaystyle POS$ $\displaystyle =$ $\displaystyle Y \times X$ (4.54)
$\displaystyle OBJ$ $\displaystyle \in$ $\displaystyle \{'O', 'F', '.', 'A_{i}'\}$ (4.55)
$\displaystyle AL$ $\displaystyle \in$ $\displaystyle (AID \times POS \times DIR \times ACT \times REW)^{n}$ (4.56)
$\displaystyle A$ $\displaystyle =$ $\displaystyle Agents$ (4.57)
$\displaystyle \iota$ $\displaystyle :$ $\displaystyle E^{S} \leftrightarrow A^{n}$ (4.58)
$\displaystyle \mu$ $\displaystyle :$ $\displaystyle E^{S} \times \iota \times A^{n} \longmapsto LOG^{n}$ (4.59)
$\displaystyle A(x)$ $\displaystyle iff$ $\displaystyle x = \langle AB, \gamma\rangle$ (4.60)

Where the objects $ \{'O', 'F', '.', 'A_{i}'\}$ represent the possible objects which can placed in one position of the grid.

Gerd Doeben-Henisch 2012-03-31