To implement the theoretical concept of the Wilson-Learning Classifier System zcs within our experimental framework , we have to translate his paper into this framework. For this we have to repeat here the basic assumptions for our framework as follows:
![]() |
![]() |
![]() |
(4.43) |
![]() |
![]() |
![]() |
(4.44) |
![]() |
![]() |
![]() |
(4.45) |
![]() |
![]() |
![]() |
(4.46) |
with as a set of values indicating some performances. Within the interface one can assume as a general principle, that there is a mapping from the environment to the agent as one mapping
and a mapping from the agent to the environment
. Furthermore one can distinguish usual input
from a more abstract input
called 'fitness function'.
![]() |
![]() |
![]() |
(4.47) |
![]() |
![]() |
![]() |
(4.48) |
![]() |
![]() |
![]() |
(4.49) |
![]() |
![]() |
![]() |
(4.50) |
as well as
are special alphabets to encode input or output messages. 'F' is a set of fitness values.
Gerd Doeben-Henisch 2012-03-31