Professional Documents
Culture Documents
H KHNH L
Ngnh:
Chuyn ngnh:
M s:
60.48.05
LUN VN THC S
NGI HNG DN KHOA HC:
PGS. TSKH. Bi Cng Cng
ii
H Ni 2009
iii
LI CAM OAN
Ti xin cam oan lun vn Mt s quy trnh suy din trong h M l cng
trnh nghin cu ca ring ti, khng sao chp ca bt k ai. Ni dung ca lun n
c trnh by t nhng kin thc tng hp ca c nhn, tng hp t cc ngun ti
liu c xut x r rng v trch dn hp php. Kt qu nghin cu c trnh by
trong lun vn ny cha tng c cng b ti bt k cng trnh no khc.
Ti xin chu hon ton trch nhim, v nu sai, ti xin chu mi hnh thc k
lut theo quy nh.
H Ni, ngy 7 thng 12 nm 2009
Hc vin thc hin
H Khnh L
iv
LI CM N
u tin, ti xin gi li cm n su sc nht ti PGS.TSKH Bi Cng
Cng, ngi hng dn khoa hc, tn tnh ch bo, gip v to iu kin
cho ti hon thnh lun vn.
Ti xin chn thnh cm n cc thy c trng i hc Cng ngh, i hc
Quc gia H Ni ging dy v truyn t kin thc cho ti.
Cui cng, ti xin cm n nhng ngi thn v cc bn b ng nghip
chia s, gip ti hon thnh lun vn ny.
Mc d ht sc c gng vi tt c s n lc ca bn thn, nhng chc lun
vn vn cn nhng thiu st. Knh mong nhn c nhng kin ng gp ca
qu Thy, C v bn b ng nghip.
Ti xin chn thnh cm n!
MC LC
Trang
Trang ba ph............................................................................................................................
LI CAM OAN..................................................................................................................iii
LI CM N........................................................................................................................iv
MC LC..............................................................................................................................v
BNG K HIU CC CH VIT TT............................................................................vii
DANH MC CC BNG...................................................................................................vii
DANH MC CC HNH V, TH..............................................................................vii
M U................................................................................................................................1
CHNG I - C S LOGIC M.........................................................................................3
1.1. Logic r v s xut hin ca logic m......................................................................................3
1.2. Cc php ton v tp m...........................................................................................................4
1.2.1. Php ph nh..................................................................................................................4
1.2.2. T - chun...........................................................................................................................5
1.2.3. T - i chun...................................................................................................................10
1.3. Mt s vn lin quan ca cc ton t trong Logic M .....................................................16
1.3.1. Php i ngu ................................................................................................................16
1.3.2. Quan h gia t - chun v t - i chun......................................................................16
1.3.3. Mt s qui tc vi php hi v php tuyn.................................................................17
1.4. Php ko theo...........................................................................................................................19
1.4.1. nh ngha php ko theo.............................................................................................19
1.4.2. Mt s dng hm ko theo c th................................................................................21
1.4.3. th mt s hm ko theo c quan tm...............................................................26
1.5. Quan h m v php hp thnh...............................................................................................27
1.5.1. Quan h m....................................................................................................................28
1.5.2. Php hp thnh..............................................................................................................28
vi
3.2. M hnh ngn ng - Linguistic models (LM).........................................................................42
3.3. Suy din vi m hnh m........................................................................................................43
3.4. M hnh Mamdani (Constructive) v Logical (Destructive)..................................................45
3.4.1. Phng php lp lun Mandani..................................................................................46
3.4.2. Phng php lp lun logic..........................................................................................49
3.5. M hnh ngn ng vi tp hp cc u ra..............................................................................54
3.6. M hnh Takagi Sugeno Kang (TSK)...............................................................................56
3.6.1. M hnh...........................................................................................................................56
3.6.2. Mt s v d m hnh TSK n gin...........................................................................58
KT LUN..........................................................................................................................76
DANH MC CNG TRNH CA TC GI.....................................................................77
TI LIU THAM KHO....................................................................................................78
vii
Tn y
LM
Linguistic Model
TSK
FIS
FLT
DANH MC CC BNG
Trang
Bng 1.1: Cc cp i ngu vi n(x) = 1-x..........................................................................17
Bng 2.1: Phng php gii m trung bnh tm vi m = 2..................................................39
DANH MC CC HNH V, TH
Trang
Hnh 1.2: th t-chun yu nht T0.....................................................................................7
Hnh 1.2: th t-chun Lukasiewiez....................................................................................8
Hnh 1.3: th t-chun T2....................................................................................................8
Hnh 1.4: th t-chun t(x,y) = x*y.....................................................................................8
Hnh 1.5: th t-chun min..................................................................................................8
Hnh 1.5: th t-chun Min-Nilpotent.................................................................................9
Hnh 1.6: th t-chun T4....................................................................................................9
Hnh 1.7: Giao ca 2 tp m dng tch.................................................................................10
Hnh 1.8: Giao ca 2 tp m dng min.................................................................................10
Hnh 1.8: th hm t-i chun SN...................................................................................13
Hnh 1.9: th T-i chun SM.........................................................................................13
Hnh 1.10: th T-i chun SP........................................................................................13
Hnh 1.11: th T-i chun S2........................................................................................14
Hnh 1.13: th T-i chun S4........................................................................................14
Hnh 1.14: th T-i chun SL........................................................................................14
Hnh 1.15: th T-i chun S0........................................................................................14
Hnh 1.16: Hp ca hai tp m dng Max............................................................................15
viii
Hnh 1.17: Hp ca hai tp m dng Lukasewiez................................................................16
Hnh 1.18: th IQL= 1-x+x2y..........................................................................................23
Hnh 1.19: th IQL= max(y,1-x).....................................................................................24
Hnh 1.20: th I(x,y)=max(1-x,min(x,y))........................................................................26
Hnh 1.21: th hm I(x,y) - Godeh..................................................................................27
Hnh 1.22: th hm I(x,y) - Goguen................................................................................27
Hnh 2.1: ng c iu khin tc khng kh. .................................................................31
Hnh 2.2: Cu trc c bn ca h suy din m ....................................................................33
Hnh 2.3: Gii m bng phng php cc i......................................................................37
Hnh 2.4: Gii m bng phng php trung bnh.................................................................37
Hnh 2.5: Gii m theo phng php trung bnh tm...........................................................37
Hnh 2.6: Hm thuc hp thnh dng i xng....................................................................37
Hnh 2.7: Gii m trung bnh tm vi m=2..........................................................................38
Hnh 3.1: Phn phi kt hp lut R1(x,y): IF U l Bi THEN V l Di..................................45
Hnh 3.2: Phng php lp lun Mamdani/Constructive......................................................48
Hnh 3.3: Kt qu tnh ton u ra bng hnh phng php Mamdani.................................48
Hnh 3.4: S khi ca phng php lp lun lgic.........................................................52
Hnh 3.5: Tnh ton kt qu u ra bng hnh ca phng php logic.................................52
Hnh 3.6: Biu din cc quan h m R tng ng vi phng php Mamdani...................53
Hnh 3.7: S khi ca c ch suy din n gin.............................................................55
Hnh 3.8: Biu din hnh hc ca h suy din v d 2.......................................................59
Hnh 4.1: Ca s son tho phn lp M- Neuron thch nghi ............................................62
Hnh 4.2: H thng suy din M c thit k bng Simulink............................................63
Hnh 4.3: M hnh cu trc GUI trong Matlab.....................................................................65
Hnh 4.4: Cu trc FIS..........................................................................................................66
Hnh 4.5: Hm thuc bin m ca bin vo Arrival.............................................................70
Hnh 4.6: Hm thuc bin m ca bin vo Queue .............................................................70
Hnh 4.7: Hm thuc bin m ca bin ra Extention............................................................70
Hnh 4.8: Biu din hnh hc ca h suy din dng Mamdani.............................................74
Hnh 4.9: Biu din hnh hc ca h suy din dng lp lun logic.......................................74
M U
T nhng nm u ca thp k 90 cho n nay, h iu khin m v mng
nron (Fuzzy system and neuron network) c cc nh khoa hc, cc k s v
sinh vin trong mi lnh vc khoa hc k thut c bit quan tm nghin cu v
ng dng vo sn xut. Tp m v logic m (Fuzzy set and Fuzzy logic) da trn
cc suy lun ca con ngi v cc thng tin khng chnh xc hoc khng y
v h thng hiu bit v iu khin h thng mt cch chnh xc. iu khin
m chnh l bt chc cch x l thng tin v iu khin ca con ngi i vi cc
i tng, do vy, iu khin m gii quyt thnh cng cc vn iu khin
phc tp trc y cha gii quyt c.
Hin nay, c th ni, cng ngh tnh ton m l mt trong nhng lnh vc
nghin cu pht trin mnh m nht, c nh du bng s ra i ca hng lot
phng php k thut ng dng trong nhiu lnh vc khc nhau. Vic tch hp cc
k thut logic m vi cc phng php phn tch khc ngy cng din ra mnh m.
Logic m c ng dng rng ri gii quyt rt nhiu bi ton ca khoa hc ng
dng. Nhng lnh vc c th k ra y l vn tr hc, h tr quyt nh, iu
khin, nhn dng mu, kinh t, qun l, x hi hc, m hnh thng k, my hc,
thit k c kh, ch to, phn lp, suy lun, thu nhn thng tin, qun l c s d
liu, chun on y t, h c s tri thc,
c bit trong lnh vc x l tri thc, cng ngh tnh ton m t ra v cng
hiu qu. Do tri thc con ngi thng c biu din bng cc th hin ngn ng,
bng cc cu hi, cc pht biu v th gii ang xt. Vn i vi vic x l tri
thc l khng ch vic lin kt cc tri thc, cc pht biu v th gii ang xt, m
cn vic nh gi s ng n ca chng. Logic hnh thc c in cho php
chng ta nh gi mt pht biu v th gii l hoc ng, hoc sai. Tuy nhin,
trong thc t, nh gi mt pht biu ch c ng hoc sai l rt kh nu khng
mun ni l phi thc t. Ly v d: i vi cc tri thc dng p sut cao, Th
tch nh, Qu to , vic xc nh mt cch chnh xc tr chn l ca chng l
ng hay sai l rt kh do cc t cao, nh hay hon ton c tnh cht m
h. T Zadeh m rng logic mnh thnh logic m, trong , mi mnh
P s c gn cho 1 tr chn l (P), mt gi tr trong on [0, 1], biu din mc
ng n ca mnh .
CHNG I - C S LOGIC M
c th tin hnh cc php ton logic trn cc mnh , chng ta cn phi
c cc php ton logic m. chnh l cc php ton ph nh, t - chun tng ng
vi php hi, t - i chun ng vi php tuyn, v php ko theo m.
Trong chng ny, chng ta s nhc li cc khi nim v c s logic m v
tm hiu h suy din m. Do gii hn ca lun vn nn c nhiu khi nim, chng
minh s khng c trnh by ht trong ni dung bi vit. Kin thc c s ca logic
m c th c xem thm cc ti liu [1, 2, 3, 5, 6, 8, 9, 18]. Trc ht, chng ta
bt u bng vic tm hiu v cc ton t m v mt s tnh cht c trng ca
chng.
Nhn
Hay nh c nh th vit:
Tri th khng nng khng ma,
Ch hiu hiu mt cho va lng nhau.
Cc khi nim nh: trng rt cao, c y, khng nng khng ma, hiu hiu
mt, tht kh cho ta a ra mt con s c th. Tuy vy khi nghe cc t ny ta
vn hnh dung c mt c tnh c th r rt v i tng.
Nhng suy ngh ny a n khi nim v logic m, chnh logic m xa
i c khi nim cng nhc ca logic r, v rng logic m :
- Cho php m t cc trng thi s vic khi s dng cc mc thay i gia
ng v sai.
- C kh nng lng ha cc hin tng nhp nhng hoc l thng tin hiu
bit v cc i tng khng hoc khng chnh xc.
- Cho php phn loi cc lp quan nim chn lp ln nhau.
1 x
, > 1 . Vi h Sugeno ny ta c
1+ x
(1 + x) (1 x )
= x vi mi 0 x 1 .
(1 + x) + (1 x)
1.2.2. T - chun
1.2.2.1. Php hi
Php hi (vn quen gi l php AND - Conjunction) l mt trong my php
ton logic c bn nht, n cng l c s nh ngha php giao ca hai tp m.
Php hi cn tho mn mn cc tin sau:
C0: v(P1 AND P2) ch ph thuc vo v(P1) v v(P2).
C1: Nu v(P1) =1 th v(P1 AND P2) = v(P2) vi mi mnh P2.
C2: Giao hon v(P1 AND P2) =v(P2 AND P1).
C3: v(P1) v(P2) th v(P1 AND P3) v(P2 AND P3), vi mi mnh P3.
C4: Kt hp: v(P1 AND (P1 AND P3)) = v((P2 AND P2) AND P3).
Nu din t php hi m (fuzzy conjunction) nh mt hm T: [ 0, 1]
[ 0, 1] , th chng ta c th cn ti hm sau:
* nh ngha 1.5:
Hm T: [ 0, 1]
cc iu kin sau:
xy
2 ( x + y xy )
xy
x + y xy
khi x + y 1
0
* nh l 1.6:
Vi T l mt t - chun bt k th bt ng thc sau lun ng vi mi x, y
[0, 1]
T0(x, y) T(x, y) TM(x, y)
T0 TL T2 TP T4 TN TM
Phn chng minh cc nh l xem trong ti liu dn [7]
* nh ngha 1.7: Cho T l t - chun. Khi y
a) T gi l lin tc nu T l hm lin tc trn [0, 1]2.
b) T l Archimed nu T(x, x) < x, vi x (0, 1).
c) T gi l cht nu T l hm tng cht trn [0, 1]2.
* V d:
1) T2 (x, y) =
xy
l Archimed v: T2(a, a) = a2/(2 - (2a - a2)).
2 ( x + y xy )
a2
Do a2 - 2a + 2 = (a - 1)2 + 1 > 1
< a2 a
2 (2a a 2 )
Vy T2(a, a) < a, vi a (0, 1).
2) TP(x, y) = xy l cht v 0 x1 < x2, 0 y1 < y2, ta c x1y1 < x2y2.
3) TM(x, y) = min(x, y) l mt hm lin tc trn [0, 1]2, nn t - chun T l
lin tc. Hn th na, ta lun c TM(x, x) = min(x, x) = x.
1.2.2.3 th ca mt s hm t - chun:
T2(x, y) =
xy
.
2 ( x + y xy )
TP(x, y) = xy
TM(x, y) = min(x, y)
khi x + y 1
0
Hnh 1.5: th t-chun Min-Nilpotent
T4(x, y) =
xy
x + y xy
A(a).B (a )
p + (1 p)( A(a) + B (a ) A(a ).B( a))
vi p 0, vi mi a ,
cn Yager (1980) xt php giao hai tp m A, B vi hm thuc cho bi
(A p B)(a)= 1 - min{ 1, ((1- A(a))p +(1- B(a))p) 1/p }, p 1, vi mi a [0, 1].
10
1.2.3. T - i chun
1.2.3.1. Php tuyn
Ging nh php hi, php tuyn hay ton t logic OR thng thng cn tha
mn cc tin sau:
D0: v(P1 OR P2), ch ph thuc vo v(P1) v v(P2).
D1: Nu v(P1) = 0, th v(P1 OR P2) = v(P2), vi mi mnh P2.
D2: Giao hon v(P1 OR P2) = v(P2 OR P1).
11
x + y 2 xy
.
1 xy
4) S4(x, y) =
x+ y
.
1 + xy
khi (x + y ) 1
0
max{x, y} khi min(x, y ) = 0
7) S0(x, y) =
12
13
khi (x + y ) 1
0
SP(x, y) = x + y xy
x + y 2 xy
1 xy
14
S4(x, y) =
x+ y
1 + xy
15
vi t [0, 1], a.
* V d: Cho U l khng gian nn: U = [0, 120] l thi gian sng.
A={Nhng ngi tui trung nin}; B ={Nhng ngi tui thanh nin}.
Khi hp ca hai tp m A, B vi T(x, y) = max(x, y) v T(x, y)= max(1,
x+y). Biu din trn hnh v nh sau:
16
17
S(x, y)
min(x, y)
max(x, y)
x.y
x + y - x.y
max{ x + y - 1, 0}
min{ x + y, 1}
min0(x, y)=
min{x, y} v i (x + y ) > 1
v i (x + y ) 1
0
max1(x, y) =
max{x, y} v i (x + y ) < 1
v i (x + y ) 1
0
Z(x, y) =
min{x, y} v i max(x, y ) = 1
v i max(x, y ) < 1
0
Z(x, y) =
max{x, y} v i min(x, y ) = 0
v i min(x, y ) > 0
0
18
(a)
S(T(x, y), x) = x, vi x, y [ 0, 1] .
(b)
* Mnh 1.19:
(a) ng khi v ch khi T(x, y) = min(x, y), vi x, y [ 0, 1] ,
(b) ng khi v ch khi S(x, y) = max(x, y), vi x, y [ 0, 1] .
- Tnh phn phi (distributivity):
* nh ngha 1.20:
C hai biu thc xc nh tnh phn phi:
S(x, T(y, z)) = T(S(x, y), S(x, z)), vi x, y, z [ 0, 1] .
(c)
(d)
* Mnh 1.21:
(c) ng khi v ch khi T(x, y) = min(x, y), vi x, y [ 0, 1] ,
(d) ng khi v ch khi S(x, y) = max(x, y), vi x, y [ 0, 1] .
- Lut De Morgan.
19
20
Php ko theo l mt hm s I: [ 0, 1]
sau:
I6: Nu x z th I(x, y) I(z, y), vi y [0, 1].
I7: Nu y u th I(x, y) I(x, u), vi x [0, 1].
I8: I(0, x) =1, vi x [0, 1].
I9: I(x, 1) =1, vi x [0, 1].
I10: I(1, 0) = 0.
Tip tc, chng ta xem xt thm mt s tnh cht khc ca php ko theo,
nhng tnh cht ny nhn c nh nhng bi bo ca Dubois v Prade:
I11: I(1, x) = x, vi x [0, 1].
I12: I(x, I(y, z)) = I(y, I(x, z)).
y l qui tc i ch, c s trn s tng ng gia hai mnh if P 1
then (if P2 then P3) v if P2 then (if P1 then P3).
I13: x y nu v ch nu I(x, y) =1 (php ko theo xc lp mt th t).
I14: I(x, 0) = N(x). (l mt php ph nh mnh).
Nh vy I14 phn nh mnh sau t logic c in (P Q) = P, nu v(Q)
= 0 (nu Q l sai).
I15: I(x, y) y vi x, y.
I16: I(x, x) = 1, vi x.
I17: I(x, y) = I(N(y), N(x)). iu kin ny phn nh php suy lun ngc
trong logic c in hai gi tr: (P Q) = ( Q P). y l iu kin mnh.
I18: I(x, y), l hm lin tc trn [0, 1].
tm hiu thm cc iu kin ny ngi ta a ra nh l sau:
* nh l 1.24:
Mi hm s I: [ 0, 1] 2 [ 0, 1] tho mn cc iu kin I7, I12, I13, th
hm I s tho mn cc iu kin I6, I8, I9, I10, I11, I15, I16.
21
x
c) Tin I8: IS(0, x) = S(n(0), x) = S(1, x) max(1, x) =1, vy IS(0, x) =1,
vi x
d) Tin I9: IS(x, 1) = S(n(x), 1) max(n(x), 1) =1, vy IS(x, 1) =1, vi x.
e) Tin I10: IS(1, 0) = S(n(1), 0) = S(0, 0) = 0, vy IS(1, 0) = 0,
IS l mt php ko theo ca logic m tho mn nh ngha 1.23.
1.4.2.2. R - Implication
* nh ngha 1.27: Cho T l mt t - chun, hm IT(x, y) xc nh trn [0, 1]2 bng
biu thc:
IT(x, y) = sup{ u:T(x, u) y }
* nh l 1.28:
22
23
Lp lun tng t khi cho P v Q trn cc khng gian nn khc nhau cng c
th dn ti cng dng hm I(x, y) ny.
1.4.2.3. QL - Implication
Nh nhn xt t u, c rt nhiu con ng mun xc nh php ko
theo. Php ko theo sau y ni chung khng tha mn tin th nht nhng
c nhiu tc gi s dng, chnh ca php ko theo ny bt ngun t biu din
php P Q theo l thuyt tp hp.
Nu P, Q l cc mnh trong logic c in hay ta biu din di dng tp
hp trong cng mt khng gian nn th (PQ) = (P(PQ).
S dng T l t - chun, S l t - i chun, n l php ph nh, th c th ngh
ti dng: I(x, y)=S(T(x, y), n(x))
* nh ngha 1.29: Cho (T, S, n) l mt b ba De Morgan vi n l php ph nh
mnh, php ko theo th ba IQL(x, y) (t Logic lng t - Quantum Logic) xc nh
trn [0, 1]2 bng biu thc:
IQL(x, y)=S(T(x, y), n(x)), 0 x, y 1 .
* V d: Chn T(x, y)= xy, S(x, y) = x+y-xy, ta c:
IQL(x, y) = S(xy, (1-x)) = xy+(1-x)-xy(1-x).
T IQL(x, y) = 1-x+x2y. Ta c hnh v sau:
24
I QL ( x, y ) = S { max ( x + y 1, 0 ) , 1 x}
= min { max ( x + y 1, 0 ) + ( 1 x ) ,1}
= min { max ( y, 1 x ) , 1}
Do
y 1
nn
lun
max( y,1- x) 1 .
c:
Khi
0.5
1
0.8
0
0
0.6
0.4
0.2
0.4
0.2
0.6
0.8
1
do min(0, 1-x)=0)
I QL ( x, y ) = 1 nu y = 1
1 x khc i
1.4.2.4. A-implication
ta
25
f (a ) = 1 a.Ta gi s rng mt
26
* Chng minh:
Trc tin chng ta nhn nhng g ta kt lun t (I0) v (I1). Vi mi a (0,
1), ta biu th f (a, b) bng fa(b). Khi , theo (I1) th hm fa tha mn tnh cht
fa(b.c) = fa(b) fa(c). V f lin tc, hm fa cng lin tc do kt qu ca cc hm
ny l:
Hoc fa(b)= 0
Hoc fa(b) = bp(a) vi p ph thuc vo a.
Chng ta ch ra rng trng hp fa(b) =f (a, b) = 0 vi mi a, b (0, 1) l
khng th xy ra.
Tht vy, trong trng hp ny t gi thit tnh lin tc ca hm f ta nhn
f ( ,1 ) =lim 0 = 0. Tri vi (I0)
c f (0, 1)= lim
s 0
Vy f (a, b) = b p ( a ) vi p(a).
T b < 1 v f (a, b) 1 ta kt lun rng p(a) 0. Do f lin tc, hm p(a)
cng lin tc.
Vy, mt hm f tha mn (I0) v (I1) th n c dng f (a, b) = bp(a) vi mi
a, b (0, 1).
27
nux y
nux > y
nux y
nux > y
28
1.5.1. Quan h m
* nh ngha 1.32:
Cho X, Y l hai khng gian nn. R gi l mt quan h m trn X Y nu R
l mt tp m trn X Y, tc l c mt hm thuc R: X Y[0, 1], y R(x, y)
= R(x, y) l thuc (membership degree) ca (x, y) vo quan h R.
* nh ngha 1.33:
Cho R1 v R2 l hai quan h m trn X Y, ta c nh ngha
1) Quan h R1 R2 vi R1R2(x, y) = max {R1(x, y), R2(x, y)}, (x, y)
X Y.
2) Quan h R1R2 vi R1R2(x, y) = min {R1(x, y), R2(x, y)} (x, y)
X Y.
* nh ngha 1.34: Quan h m trn nhng tp m
Cho tp m A vi A(x) trn X, tp m B vi B(y) trn Y.Quan h m trn
cc tp m A v B l quan h m R trn X Y tho mn iu kin:
R(x, y) A(x), yY
R(x, y) B(y), xX.
29
30
31
trn V
32
33
C s d liu
u ra
B lut
Giao din
gii m
n v thc thi quyt nh trong thc hin cc hot ng suy din trong
cc lut;
34
35
36
2.2.3.2. Gii m
Gii m c nh ngha nh l s nh x (s lm tng ng) t tp m B
trong tp c s V (thuc tp s thc R; V R; l u ra ca khi hp thnh v
suy lun m) thnh gi tr r u ra y V. Nh vy nhim v ca gii m l tm
mt im r y V lm i din tt nht cho tp m B. C ba iu lu sau y
lc chn phng php gii m:
- Tnh hp l ca kt qu. im r y* V l im i din (cho nng
lng) ca tp m B, iu ny c th cm nhn trc gic tnh hp l ca kt qu
khi c hm lin thuc ca tp m B.
- Vic tnh ton n gin. y l iu quan trng tnh ton nhanh, v cc
b iu khin m thng lm vic thi gian thc.
- Tnh lin tc. Mt s thay i nh trong tp m B ch lm thay i nh kt
qu gii m, ngha l khng gy ra thay i t bin gi tr gii m y V.
Nh vy, gii m l qu trnh xc nh mt gi tr r u ra theo hm lin
thuc hp thnh tm c t cc lut hp thnh v iu kin u vo. C ba
phng php gii m thng dng l: phng php cc i, phng php trng
tm v phng php trung bnh tm.
a) Phng php cc i
Phng php cc i gm hai bc:
Bc 1: Xc nh min cha gi tr r u ra. l min G, m gi tr r u
ra y c hm lin thuc t gi tr cc i, ngha l:
G={yY | B(y)=max}
Bc 2: Xc nh gi tr y t min G. Lc ny c ba cch tnh:
+ Cch tnh trung bnh, chng hn nh trn hnh 2.3 th:
y=
y1 + y2
2
37
y=
y. B ( y)dy
S
B ( y)dy
S
Trong S l min xc nh ca tp m.
38
y 1.hl
l =1
M
hl
l =1
39
h2
ytt
ytb
0.9
0.7
0.4258
0.4375
0.0275
0.9
0.5
0.5457
0.5385
0.0133
0.9
0.2
0.7313
0.7000
0.0428
0.6
0.7
0.3324
0.3571
0.0743
0.6
0.5
0.4460
0.4545
0.0192
0.3
0.5
0.2155
0.2500
0.1600
0.3
0.2
0.3818
0.4000
0.0476
40
Mnh 2
.
Mnh m
Kt lun
Y=B0
41
42
THEN V l D1
ALSO
43
(3.1)
ALSO
IF U l Bm THEN V l Dm
cng thc trn, U l bin u vo v V l bin u ra ca LM. Bi v Di l
tp con m ca cc c s tp hp X v Y ca U v V. Thng thng cc tp m Bi
v Di tng ng vi nhn ngn ng. Hm thuc ca tp m Bi, Di c k hiu ln
lt l Bi(x) v Di(y). Phn bn tri ca lut, c gi l gi thit v c lin quan
n u vo ca h thng; pha bn phi gi l h qu, lin quan n u ra ca
lut.
Cc LM c th c coi nh mt h thng chuyn gia ngn ng m t cho
mt h thng phc tp cho sn. Tp cc lut c th c xem nh mt php loi
suy t tp hp cc cng thc c s dng biu din cc h thng tuyn tnh v
phi tuyn trong cc k thut m hnh ha c in. Cc tp m Bi v Di l cc thng
s ca LM; s lng cc lut xc nh cu trc ca LM. tng quan trng y
l phn vng khng gian vo X vo cc vng m, mi lut c lin kt vi u ra
ring ca n. Vai tr ca cc tp m l to thnh ht (b) ca cc gi tr u vo
- u ra. Cc b ny c kt hp vi tng lut ring l. Trong mt trng hp hn
ch khi mi b cha ch mt u c v LM trng vi mt tp hp cc d liu u
vo - u ra. S lng lut ca m hnh lut c s cn thit m t c trng kh
nng cho m hnh cho tng qut.
(3.2)
44
G = A R.
(3.3)
(3.4)
(3.5)
Cng thc trn c th c vit li rt gn hn di dng lut suy din maxmin nh sau:
F=AR
(3.6)
(3.7)
(3.8)
Thc cht, lut suy din l mt dng ton t ca m hnh ngn ng; n c
xem nh l mt nh x m xc nh mt chuyn ha ca gi tr m u vo ti u
ra. l mt cch biu din li ca m hnh, c bit trong cc trng hp hn ch
khng gian trnh by. ng dng ca lut suy din cho cc tnh ton c th l kh
gii hn, c bit y l trng hp khi u vo ca h thng l gi tr dy s. Tuy
nhin, chng ta s dng n biu din li trong mt dng chuyn ha rt gn
c xc nh bi m hnh ngn ng.
i vi cc khng gian gii hn X v Y c p v q, chng ta c th biu din
cc tp m A v B, D v F bng cch s dng cc vc t hm thuc l cc dng ca
cc vc t [A] v [B], [D] v [F] vi s chiu p v q tng ng, v quan h m R l
mt ma trn [R] c (p q) chiu. Sau cc lut max-min v max-product ca suy
din c th vit li di dng ma trn:
[F] = [A] [R]
[F]= [A] [R]
(3.9)
(3.10)
45
(3.11)
(3.12)
y
D2(y)
Ri(x,y)
B2(y)
x
46
(3.13)
Ri
(3.14)
j =1
i =1
i =1
R ( x, y ) = Ri ( x, y ) = ( Bi ( x ) Di ( y ))
(3.15)
F = A oR = A o URi = A o U( Bi Di )
i =1
i =1
(3.16)
Vi hm thuc ca F ta c:
m
F ( y ) = [ A( x) R ( x, y )] = ( A( x) R ( x, y ))
x
x i=1
F ( y ) = ( A( x) Bi ( x) Di ( y ))
i =1 x
F ( y ) = [ i Di ( y )]
i =1
Trong :
(3.17)
47
i = Poss[ Bi | A] = [ Bi ( x) A( x)]
x
(3.18)
i = Poss[ Bi | A] = Bi ( x*)
(3.19)
i = x[Bi(x) A(x)] nu u vo l mt tp m A
i = Bi(x*) nu u vo l mt dy s x*
2. Tm tp m Fi c phn nh bi lut th i
Fi ( y ) = i Di ( y )
3. Tng hp cc tp m suy din Fi bng cch s dng ton t max.
m
F ( y ) = Fi ( y )
i =1
48
IF U is B1 THEN V is D1
1 = x ( B1( x ) A( x ))
1 D1( y ))
IF U is B2 THEN V is D2
2 = x ( B 2( x ) A( x ))
F2
2 D 2( y))
V=F
...
U=A
F1
IF U is Bm THEN V is Dm
m = x( B m( x ) A( x ))
Fm
m D m( y))
49
B1
THEN
D1
THEN
D2
ALSO
IF
B2
Bi
THEN
Di
(3.20)
(3.21)
Trong B i ( x) = 1 Bi ( x)
Theo cch tip cn ny kt ni gia cc lut ring l, ALSO, c dch nh
l mt kt qu lin kt trong vic tch hp cc lut ring l, tr nn hon chnh bi
php giao:
m
R = I Ri
i =1
(3.22)
50
m
i =1
i =1
R ( x, y ) = Ri ( x, y ) = B i ( x) Di ( y )
(3.23)
A oR = A o I Ri = A oI ( B i Di )
i =1
i =1
G ( y ) = [ A( x) R ( x, y )] = ( A( x ) Ri ( x, y ))
x
x i =1
= [ Bi ( x) A( x ) Di ( y ) A( x)]
x i =1
By gi hy xem xt cc tp con m F c:
F ( y ) = [ B i ( x) A( x) Di ( y ) A( x)]
i =1 x
F ( y ) = [ i Di ( y )]
i =1
(3.24)
Trong
i = Poss[ B i | A] = [ B i ( x) A( x)]
x
(3.25)
51
i = Poss[ B i | A] = 1 Bi ( x*) = 1 i
Trn y l tm tt ca thut ton sau tnh ton u ra bin dch bi LM
thng qua phng php logic:
Thut ton 2:
1. i vi mi lut ca LM (1) tnh:
i = x[ Bi A( x)] nu u vo l mt tp m A;
i = 1 Bi (u ) Nu u vo mt tp hp s u.
2. Tm tp m Ei suy ra bi cc lut
Fi ( y ) = i Di ( y )
3. Tch hp cc tp m c suy din Ei bng cch s dng ton t min:
m
F ( y ) = Fi ( y )
i =1
52
53
F ( y ) = [ i Di ( y )]
i =1
(3.26)
E ( y ) = [ i Di ( y )]
i =1
(3.27)
F ( y ) = [ i Di ( y )]
i =1
54
) ( F ( y)dy )
yF ( y )dy /
(3.28)
Vi mt U xc nh, ta c:
q
q
y* = yi F ( yi ) / F ( yi )
j =1
j =1
(3.29)
i =1
i =1
F ( y ) = Fi ( y ) = i Di ( y )
(3.30)
55
i =1
i =1
F ( y ) = Fi ( y ) = i Di ( y )
(3.31)
(3.32)
56
gin ca c ch suy din. Dng n gin ny cho php mt biu thc phn tch cho
quan h gia cc u v v u ra, v n m ra mt kh nng hc cc m hnh
m t d liu. Cng nh t biu thc (3.32), gii thut xc nh tp hp gi tr
u ra ca m hnh Mamdani thng qua 2 bc: tnh ton DOF, i v cc gi tr
thay th vo mt cng thc cui cng (3.32). Cc ton t ca vic tm kim tp m
suy din bi tng lut ring bit, vic kt hp v gii m b b qua. Phng php
suy din m n gin ha c trnh by dng s khi trong hnh 3.7.
ALSO
IF u1 l Bm1 AND AND ur l Bmr THEN y = bm0 +b11u1+ + b1rur
Trong m hnh ny, Bij, j = 1r, i =1, , m l cc bin ngn ng c nh
ngha nh l cc tp suy din m thng quan khng gian vo X1, X2,, Xr ca mt
h MISO; u1, u2, , ur l gi tr ca cc bin vo. Mi hm tuyn tnh trong phn
kt lun ca lut c th c xem nh mt m hnh tuyn tnh vi tp cc u vo
u1, u2, , ur, tp cc u ra i v cc bin bij, j = 1r, i =1, , m. Tp u ra y dch
bi m hnh m theo phng php TSK c nh ngha bng trung bnh trng s
ca tp cc u ra yi ca tng h con tuyn tnh.
m m
m
y = i y / i = i (bi 0 + bi1u1 + ... + biru r ) / i
i =1
i =1 i =1
i =1
m
(3.33)
(3.34)
57
(3.35)
58
59
60
61
62
63
64
65
66
Input
name
range
mf
Output
name
range
mf
Rules
antecedent
consequent
weight
connections
Input 1 MFs
name
type
params
Input 2 MFs
name
type
params
Output MFs
name
type
params
67
68
69
Queue
Extention
Almost
AN
Very small
VS
Zero
Few
Small
Short
Many
MY
Medium
Medium
Too many
TMY Large
Longer
70
71
72
QUEUE
AN
MY TMY
VS
73
= traffic
Type
= mamdani
NumInputs = 2
InLabels =
Arival
QUEUE
NumOutputs = 1
OutLabels =
Extention
NumRules = 16
AndMethod = min
OrMethod = max
ImpMethod = min
74
AggMethod = max
DefuzzMethod = centroid
cho ta kt qu biu din bng hnh hc nh trong hnh 4.8.
Hnh 4.9: Biu din hnh hc ca h suy din dng lp lun logic
75
76
KT LUN
Sau thi gian nghin cu v thc hin n, di s hng dn tn tnh ca
thy gio PGS.TSKH. Bi Cng Cng, em hon thnh yu cu ca lun vn
tt nghip l tm hiu cc php ton c bn ca logic m ni chung v mt s quy
trnh suy din m ni ring. Lun vn c tp trung m rng tm hiu cc
phng php lp lun xp x trong h m da trn c s cc lut m, trong h
m dng TSK l mt m hnh c tm hiu c nhiu u im v tnh nng mi.
hon thnh ti trn, em thc hin: nghin cu cc ti liu c lin
quan n ti (xem danh mc ti liu tham kho); Tham gia sinh hot Xemina ti
Vin Ton hc H ni; Nghe cc bui chuyn ti khoa Ton ng dng, i hc
Bch Khoa H Ni; Tham d hi tho trng thu "H m v ng dng" ln th
1,2,3 ti H Ni; Tham kho nghin cu s dng phm mm Matlab Mt phn
kt qu t nhng nghin cu bc u ny c trnh by trong 03 bi bo (xem
danh mc cng trnh ca tc gi).
T cc kt qu nghin cu ny cho php a cc thut ton suy din ci t
vo trong cc b iu khin m, khng cn kho st li cc c tnh ton hc chung
ca thut ton na m ch phi xt ti cc c im ring ca bi ton thc t. Cc
thut ton ny c th c kt hp vi mng n-ron m hoc a vo cc ng dng
tr tu nhn to (nh h chuyn gia, h h tr quyt nh, ...) gip cho h thng suy
din cho mt kt qu ng n v chnh xc hn, ph hp vi yu cu ca ngi
chuyn gia v yu cu thc t ca h thng suy din. Cc thut ton ny khi dng
b cng c Simulink ca Matlab c th c s dng ci t vo b iu khin
vi cc senso nhn tn hiu iu khin bn ngoi nh cc bin u vo v cc gi tr
ngng. y l mt ng dng c rt nhiu chuyn gia trong cc ngnh in t,
cng ngh thng tin qua tm.
Tuy vy, phn ln cc kt qu t c trong qu trnh nghin cu mi ch
dng li mc l thuyt v th nghim. c th p dng c trong thc t
th cn cn phi kho st, phn tch k v m hnh ho i vi tng bi ton c th.
y chnh l bc pht trin tip theo ca ti m do hn ch v thi gian thc
hin v kin thc ca tc gi nn cn cha c trin khai. Ngoi ra, m rng b
sung b cng c Logic M v kt hp vi b cng c Neuron Network Toolbox
trong Matlab s l hng pht trin tip theo ca ti, vi mong mun to ra c
cc b iu khin, ng dng suy din M vo trong nhiu lnh vc ca khoa hc v
k thut.
77
78
2.
3.
4.
5.
6.
Phm Vn Li (2001), Mt s dng suy rng ca php hi, php tuyn, php
ko theo trong logic m v mt vi ng dng, Lun vn Thc s ton hc, Vin
ton hc, 2001.
7.
Phan Xun Minh, Nguyn Don Phc (1997), L thuyt iu khin M, NXB
Khoa hc v K thut, H Ni, 1997.
8.
Nguyn Hong Phng, Bi Cng Cng, Nguyn Don Phc, Phan Xun
Minh v Chu Vn H (1998), H M v ng dng, NXB Khoa hc K thut,
H Ni, 1998.
9.
79