Information Technology Reference
In-Depth Information
Al
g
1
=
(
X
1
,
f
1
)
f
1
:
X
0
×
X
1
×
X
2
ₒ
X
0
×
X
1
×
X
2
(2.42)
f
1
(
0
,
0
,
1
)
=
(
0
,
1
,
0
),
f
1
(
1
,
1
,
0
)
=
(
1
,
0
,
0
)
Al
g
2
=
(
X
2
,
f
2
)
f
2
:
X
0
×
X
1
×
X
2
ₒ
X
0
×
X
1
×
X
2
(2.43)
f
2
(
0
,
0
,
0
)
=
(
0
,
0
,
1
),
f
2
(
0
,
1
,
0
)
=
(
1
,
1
,
0
)
The observation function
Obs
12
realizing (modelling) the process of recognition of
the behaviour of the algorithm
Al
g
2
by the algorithm
Al
g
1
may be denoted as follows:
Obs
12
:
X
0
×
X
0
ₒ
X
2
x
i
−
1
0
x
i
0
)
=
Obs
12
(
,
x
2
(2.44)
Obs
12
(
0
,
0
)
=
1
,
Obs
12
(
0
,
1
)
=
0
In effect, the algorithm
Al
g
1
may be considered as autonomous towards the algo-
rithm
Al
g
2
due to the observation function
Obs
12
, which informally can be denoted
as follows:
Al
g
1
=
(
X
1
,
f
1
,
Obs
12
)
(2.45)
x
i
−
1
0
x
i
0
))
=
(
f
1
(
x
0
,
x
1
,
x
2
)
=
f
1
(
x
0
,
x
1
,
Obs
12
(
,
x
0
,
x
1
,
x
2
)
It corresponds to taking into consideration stored “historical” global data (data on
the state of the environment) along with the next step of an algorithm, which may be
presented as follows:
Al
g
1
=
(
X
1
,
f
1
,
Obs
12
)
(2.46)
x
i
−
1
0
x
i
+
1
0
x
i
+
1
1
x
i
+
1
2
x
i
0
,
x
i
1
,
x
i
2
)
=
x
i
0
,
x
i
1
,
x
i
0
))
=
(
f
1
(
f
1
(
Obs
12
(
,
,
,
)
In conclusion, in this example we may observe the manner of gaining autonomy
due to the observation operation, which causes the algorithm
Al
g
1
to be considered
as autonomous towards the algorithm
Al
g
2
(because of cooperation between the
algorithms through
X
0
).
2.6 Multi-agent System as a Result
of Decomposition of an Algorithm
The problem of decomposition of an algorithm may be considered from many
perspectives.
Asmentioned above, the problemof decomposition of the algorithm
Al
g
=
(
)
may be considered as decomposition of the set
U
and the function
F
, or may be the
result of the Cartesian product application in which case decomposition of the set
X
is used.
U
,
F
