Académique Documents
Professionnel Documents
Culture Documents
1, JANUARY 2007
I. I NTRODUCTION
MBIENT Intelligence (AmI) systems are computer
framework capable of integrating computation into a
living environment [1] in order to enable the people to move
around and interact with their surroundings more naturally
than they currently do [2], [3]. Literature shows that different
computer approaches have been exploited in order to try to
integrate intelligence in living spaces in a transparent way. In
particular, Computational Intelligence approaches can be used
to realize context awareness and model a collection of relationships between environmental events. These relationships
could be derived by the application of neural or evolutionary
techniques which collect data into the user surrounding [4][5]
to define fuzzy rules modeling the behaviour of the AmI
framework. Typically, these approaches are embedded into
a distributed computing frameworks allowing the intelligent
environment to be managed in a transparent and remote way.
From this point of view an AmI system can be considered as a
distributed service oriented architecture, where each service is
designed by using computational intelligence methodologies.
However, last researches proves that an AmI system is more
than a simple integration of computational methodologies and
computer networking technologies and additional scientific
Agent h
Agent 1
Clock 1
Clock 2
...
Clock k
AmI
Concepts
User
Concepts
Cognitive Inference
AmI
Concepts
AmI
Concepts
...
User
Concepts
Actuator1
Actuato2
Cognitive Inference
AmI
Concepts
Agent Behavior
User
Concepts
...
User
Concepts
Agent Behavior
...
User
Status
...
Actuators Enviroment
Fig. 1.
(1)
j=1
j=i
x if 0 x 1
0 if x < 0
f (x) =
1 if x > 1
and
1
1 + ex
Differently from standard FCMs, the RBFCMs use a fuzzy
rule base to evaluate the weight of incoming concepts Aj
in a simultaneous and accumulative way. The time interval
between the instants t and t + 1 has referred as Base Time
(B-Time) which represents the resolution of the simulation,
i.e., the highest level of temporal detail that a simulation can
provide in the modeled system.
771
f (x) =
B. Timed Automata
As previously said, each agent of the proposed system is
modeled through a finite state machine capable of throwing
state transitions by considering time values. Timed automata
are the formal method that realizes this idea. In detail, a timed
automaton is a standard finite-state automaton extended with a
finite collection of real-valued clocks providing a straightforward way to represent time related events, whereas automatabased approaches cannot offer this feature. The transitions of
a timed automaton are labeled with a guard (a condition on
clocks), an action or symbol on alphabet , and a clock reset
(a subset of clocks to be reset). Intuitively, a timed automaton
starts execution with all clocks set to zero. Clocks increase
uniformly with time while the automaton is within a node.
A transition can be taken if the clocks fulfill the guard. By
taking the transition, all clocks in the clock reset will be set
to zero, while the remaining keep their values. Thus transitions
occur instantaneously. Semantically, a state of an automaton is
a pair of a control node and a clock assignment, i.e. the current
setting of the clocks. Transitions in the semantic interpretation
are either labeled with an action (if it is an instantaneous
switch from the current node to another) or a positive real
number i.e. a time delay (if the automaton stays within a node
letting time pass).
The set of behaviours expressed by an agent modeled by
means of a timed automaton is defined by a timed language,
i.e., a collection of timed words. Both timed concepts are
defined in the follows.
1
2
3
r : s0 , 0
s1 , 1
s2 , 2
The timed transition table together with the run concept are
the main notions used in our approach to embed dynamism in
the standard FCM definition.
772
(3)
(4)
(2)
Definition 7 (Additive modification of cognitive concept ). This operator modifies the value of a concept ct value
in additive way. Let r R be a real number, then, if r 0:
V {ct } {(ct + r)} if (ct + r) 1
VC =
(5)
V {ct } {1}
if (ct + r) > 1
or, if r < 0:
VC
773
=
if (ct + r) 0
if (ct + r) 0
(6)
(9)
fBT ime : S R
btime = fBT ime (s) and s S
w((cl ,cm ))
if (cl ,cm )=(ci ,cj )
w((cl ,cm ))
(11)
(13)
(10)
(12)
Definition 14 (Cognitive identity ). The operator represents a simple function identity that transforms a FCM F in
itself. This operator does not have practical usefulness but its
definition it is necessary to introduce the definition of TAFCM
in a more simple way.
w((cl ,cm ))
if (cl ,cm )=(ci ,cj )
774
TA = (F 0 , TM )
(0) : s0 S0
(14)
(1) : s1 S
(2) : s2 S
..
.
(j) : sj S
..
.
(0) = (s , F )
The inductive step. Let (i 1), with i > 1, be the cognitive
pair defined as:
(i 1) = (si1 , F i1 )
where si1 S and F i1 F , then:
(i) = (si , F i )
with si S, F i =
si1 , si , a, , , i EC .
i (F i1 ), i
and
j1
Fj
j
..
.
Definition 18. Let be a cognitive evolution, then a cogs, v), of a timed transition table
nitive run rc , denoted by (
, S, S0 , C, E, EC over a timed word (, ) and a collection
of cognitive operators Cop , is an infinite sequence of the
form
: N S F
(15)
Obviously, the cognitive evolution only represents a mapping between the states of timed automaton TA and the
collection of cognitive configurations computable starting from
F 0 by applying different sequence of operators in ; no
dynamic aspects are considered in the cognitive evolution
definition and, therefore, we introduce the idea of cognitive
run extending the initial idea of the run of standard timed
transition table.
F0
0
F1
1
F2
2
..
.
1 ,1
2 ,2
3 ,3
775
Sensors Side
S1
S2
S3
Seasons
Side
S4
0.8
0.1
a, , ,
-0.2
0.25
0.25
3
Adding User Side
Day
Side
Actuators Side
Human Side
Fig. 4. The timed automaton that describe a portion of the agents dynamic
behaviour of the AmI environment.
Fig. 2. The cognitive map that models interactions among sensors S1 , S2 ,
S3 , S4 , actuator A and the human status H.
Human Side
H2
0.6
S1
S2
S3
S4
0.8
-0.1
0.25
H1
Human Side
0.25
-0.2
A
Actuators Side
F 0 = (V, E)
V = {S1 , S2 , S3 , S4 , H1 , A}
E = {(H1 , S1 ), (H1 , S2 ), (H1 , S3 ), (H1 , S4 ),
(S1 , A), (S2 , A), (S3 , A), (S4 , A), (A, H1 )}
w(H1 , S1 ) = 0.2
w(H1 , S2 ) = 0.3
w(H1 , S3 ) = 0.4
w(H1 , S4 ) = 0.1
w(S1 , A) = 0.25
w(S2 , A) = 0.1
w(S3 , A) = 0.2
w(S4 , A) = 0.8
w(A, H1 ) = 0.25
2 ,2
3 ,3
776
TABLE I
T HE F 0 S B EHAVIOUR
FCM
Iteration
0
1
2
3
4
5
6
7
8
9
10
TABLE II
T HE (F 0 ) S B EHAVIOUR
Concepts
H
A
0.01
0.0
0.08 0.04
0.07 0.06
0.07 0.08
0.07 0.09
0.08
0.1
0.09 0.11
0.1
0.12
0.11 0.13
0.12 0.14
0.13 0.14
Iteration
0
1
2
3
FCM Concepts
H
A
0.13
0.14
0.13
0.14
0.13
0.14
0.13
0.14
H2
0.05
0.13
0.14
0.14
F 0 = (V, E)
V = {S1 , S2 , S3 , S4 , H1 , A}
E = {(H1 , S1 ), (H1 , S2 ), (H1 , S3 ), (H1 , S4 ),
(S1 , A), (S2 , A), (S3 , A), (S4 , A), (A, H1 )}
w(H1 , S1 ) = 0.2
w(H1 , S2 ) = 0.3
w(H1 , S3 ) = 0.4
w(H1 , S4 ) = 0.1
w(S1 , A) = 0.25
w(S2 , A) = 0.1
w(S3 , A) = 0.2
w(S4 , A) = 0.8
w(A, H1 ) = 0.25
w(H2 , S1 ) = 0.1
w(H2 , S2 ) = 0.2
w(H2 , S3 ) = 0.1
w(H2 , S4 ) = 0.1
w(A, H2 ) = 0.6
The table I and II shows the behaviour of our dynamical
cognitive agent. In detail, I describes the human(H) and actuator(A) concept with the following sensors value: S1 = 20,
S2 = 30, S3 = 15, S4 = 12. When the user H2 live
the system, the cognitive map F 0 modifies itself and the
table II presents the behaviour of the novel cognitive model.
It is important to note that the FCM (F 0 ) achieves the
convergence in only three step. This is due the fact that
the actuator A have always achieved its better value and,
consequently, the user H 2 is faster than H to accomplish its
optimal status.
777
R EFERENCES
[1] G. Acampora and V. Loia, Using fml and fuzzy technology in adaptive
ambient intelligence environments, International Journal of Computational Intelligence Research, 2005.
[2] G. Acampora and V. Loia, Fuzzy control interoperability and scalability
for adaptive domotic framework, IEEE Trans. Industrial Informatics,
2005.
[3] G. Acampora and V. Loia, A proposal of ubiquitous fuzzy computing
for ambient intelligence, Information Sciences, 2008.
[4] F. Doctor, H. Hagras, and V. Callaghan, A type-2 fuzzy embedded agent
to realise ambient intelligence in ubiquitous computing environments,
Inf. Sci. Inf. Comput. Sci., vol. 171, no. 4, pp. 309334, 2005.
[5] H. Duman, H. Hagras, and V. Callaghan, Intelligent association selection of embedded agents in intelligent inhabited environments,
Pervasive Mob. Comput., vol. 3, no. 2, pp. 117157, 2007.
[6] B. Kosko, Fuzzy cognitive maps, International Journal of ManMachine Studies, no. 24, pp. 6575, 1986.
[7] C. D. Stylios and P. P. Groumpos, Fuzzy cognitive maps in modeling
supervisory control systems, Journal of Intelligent and Fuzzy Systems,
vol. 8, pp. 8398, 2000.
[8] C. D. Stylios, V. C. Georgopoulos, G. A. Malandraki, and S. Chouliara, Fuzzy cognitive map architectures for medical decision support
systems, Appl. Soft Comput., vol. 8, no. 3, pp. 12431251, 2008.
[9] W. Stach, L. Kurgan, and W. Pedrycz, Parallel learning of large fuzzy
cognitive maps, Neural Networks, 2007. IJCNN 2007. International
Joint Conference on, pp. 15841589, Aug. 2007.
[10] H. Zhong, C. Miao, Z. Shen, and Y. Feng, Temporal fuzzy cognitive
maps, June 2008, pp. 18311840.
[11] Y. Miao, Z.-Q. Liu, C. K. Siew, and C. Y. Miao, Dynamical cognitive
network - an extension of fuzzy cognitive map, Fuzzy Systems, IEEE
Transactions on, vol. 9, no. 5, pp. 760770, Oct 2001.
[12] J. Carvalho and J. Tome, Rule based fuzzy cognitive maps-qualitative
systems dynamics, Fuzzy Information Processing Society, 2000.
NAFIPS. 19th International Conference of the North American, pp. 407
411, 2000.
[13] M. Hagiwara, Extended fuzzy cognitive maps, Fuzzy Systems, 1992.,
IEEE International Conference on, pp. 795801, Mar 1992.
[14] J. Carvalho and J. Tome, Rule based fuzzy cognitive maps - expressing
time in qualitative system dynamics, Fuzzy Systems, 2001. The 10th
IEEE International Conference on, vol. 1, pp. 280283, 2001.