Professional Documents
Culture Documents
Baigiangtrituenhantao PDF
Baigiangtrituenhantao PDF
Artificial Intelligence
TS. Nguyn nh Thun
Khoa Cng ngh Thng tin
i hc Nha Trang
Email: thuanvinh122@gmail.com
Nha Trang 8-2007
M u
Lnh vc nghin cu ca AI
ng dng ca AI
Cc vn t ra
Slide 2
Bi ton tm kim
Gii thut tng qut
Depth first search (DFS)
Breath first search (BFS)
Chng 5: My hc
Cc hnh thc hc
Thut gii Quinland
Hc theo bt nh
Slide 4
Slide 5
1.1 M u
Tr tu l g:
Theo t in Bch khoa ton th Webster:
Tr tu l kh nng:
S Thng Minh
Khi nim v tnh thng minh ca mt i
tng thng biu hin qua cc hot ng:
S
Cc khi nim:
Slide 9
Slide 11
Slide 12
C ch lu tr tri thc
C ch khai thc tri thc
Slide 14
(Bng n t hp mn vi m>=10)
Slide 15
Slide 18
ng dung AI
Slide 20
Cc bi ton
Xt cc bi ton sau:
1.
i tin (Vt cn v Heuristic)
2.
Tm kim chiu rng v su
3.
Tic tac toe.
4.
ong du.
5.
Bi ton TSP
6.
8 puzzle.
7.
C vua
8.
C tng
9.
Ngi nng dn qua sng.
10. Con th v con co
11. Con kh v ni chui
Slide 21
Bi ton tm kim
Tm kim ci g?
Biu din v tm kim l k thut ph bin gii cc bi
ton trong lnh vc AI
Cc vn kh khn trong tm kim vi cc bi ton
AI
c t vn phc tp
Khng gian tm kim ln
c tnh i tng tm kim thay i
p ng thi gian thc
Meta knowledge v kt qu ti u
Kh khn v k thut
Slide 23
Slide 24
K hiu:
s nh xut pht
g: nh ch
n: nh ang xt
(n): tp cc nh c th i trc tip t nh n
Open: tp cc nh c th xt bc k tip
Close: tp cc nh xt
Slide 25
V d:
Xt graph sau:
s = A l nh bt u
g= G l nh ch
A
B
F
I
D
G
Slide 27
Ln lp
Xt graph sau:
A
B
0
1
2
3
D4
5
6
7
A
B
C
D
E
F
G
(n)
Open
Close
{B, C, D}
{E, F}
{F, G}
{H, I}
{J}
{A}
{B, C, D}
{C, D, E, F}
{D, E, F, G}
{E, F, G}
{F, G, H, I}
{G, H, I, J}
{A}
{A, B}
{A, B, C}
{A, B, C, D}
{A, B, C, D, E}
{A, B, C, D, E, F}
True
Slide 28
Ln lp
Xt graph sau:A->U
A
B
F
I
G
J
0
1
2
3
D4
5
6
7
8
9
10
(n)
Open
{A}
A {B, C, D} {B,C,D}
B {E, F}
{C,D, E,F}
C {F, G}
{D,E, F,G}
D
{E, F, G}
E {H, I}
{F, G, H, I}
F {J}
{G, H, I, J}
G
{H, I, J}
H
{I, J}
I
{J}
J
FALSE
Close
{A}
{A, B}
{A, B, C}
{A, B, C, D}
{A, B, C, D, E}
{A, B, C, D, E, F}
{A, B, C, D, E, F,G}
{A,B,C, D, E, F,G,H}
{A,B,C, D, E,
F,G,H,I}
{A,B,C, D, E,
F,G,H,I,J}
Slide 29
V d:
Xt graph sau:
A
B
F
I
D
G
Slide 30
Ln lp n
Xt graph sau:
A
B
F
I
G
J
0
1
2
3
4
5
6
7
8
9
(n)
Open
{A}
A {B, C, D} {B, C, D}
B {E, F}
{E, F, C, D}
{H, I, F, C, D}
DE {H, I}
H
{I, F, C, D}
I
{F, C, D}
F {J}
{J, C, D}
J
{C, D}
C {F, G}
{G, D}
G True
Close
{A}
{A, B}
{A, B, E}
{A, B, E, H}
{A, B, E, H, I}
{A, B, E, H, I, F}
{A, B, E, H, I, F,J}
{A,B,E,H,I, F,J,C}
Slide 31
Kt qu
Tm Kim Rng
1.
2.
2.
3.
4.
5.
6.
Slide 33
Tm kim Su
1.
2.
3.
4.
5.
6.
7.
8.
9.
Slide 34
Heuristic l g?
Heuristic dng lm g?
Heuristic (tip)
Heuristic (tip)
C nhiu phng php xy dng mt thut gii Heuristic, trong
ngi ta thng da vo mt s nguyn l c bn nh sau:
Heuristic Greedy
V d: TSP vi n=8
1
730
640
840
800
430
380
1010
730
710
1040
500
300
540
470
640
710
1420
1050
600
920
1160
840
1040
1420
740
950
570
900
800
500
1050
740
520
460
200
430
300
600
950
520
390
690
380
540
920
570
460
390
660
1010
470
1160
900
200
690
660
0
Slide 41
V d: TSP vi n=8
*Vi Greedy 1:
1 7 6 2 8 5 4 3 1
Tng chi ph: 4540
*Vi Greedy 2:
1 7 4 5 8 2 6 3 1
Tng chi ph: 3900
Bi ton 3: Bi ton t mu bn
Slide 42
Heuristic (tt)
Kt qu ca tm kim vi Heuristic
Slide 44
Begin
Begin
open:={s};
While (open<> ) do
begin
n:= Retrieve(Open) //Chn trng thi tt nht tOpen.
if (n=g) then return True
else begin
To (n)
for mi nt con m ca (n) do
Gn gi tr chi ph cho m
Open:=Open{m};
end;
End;
Return False;
End;
Open := {s};
Close := ;
While (Open <> ) do
begin
n:=Retrieve(Open);
if (n=g) then Return True;
Open := Open (n); // ((n) Close)
Close := Close {n};
end;
Return False;
Slide 45
Slide 46
Slide 47
Begin
open:={s};
While (open<> ) do
begin
n:= Retrieve(Open) //Chn n sao cho g(n) nh nht t Open.
if (n=g) then return True
else begin
To (n)
for mi nt con m ca (n) do
if (m
Open) then
Begin
g(m):=g(n)+Cost(n,m)
Open:=Open{m};
end
else So snh g(m) va gNew (m) v cp nht
end;
Return False;
End;
Slide 48
Slide 49
V d:
Xt graph sau:
A
20
35
40
30
H
15
45
30
10
25
10
I
20
J
s = A l nh bt u
g= J l nh ch
Slide 50
V d:
Xt
graphSau
sau:
Trc
*
A
A
B
A
C
A
D
B
E
C
F
C
G
F
J
s = A l nh bt u
g= J l nh ch
Ln lp
(n)
0
1
Open
{(A,0)}
{B,C,D}
{E,F}
(C,35), (D,30),(E,60),(F,65)
(C,35),(E,60),(F,65)
{F,G}
(E,60),(F,50),(G,45)
{J}
(E,60),(F,50),(J,65)
(J}
(E,60),(J,60)
J
Slide 51
Begin
open:={s};
While (open<> ) do
begin
n:= Retrieve(Open) //Chn n sao cho f(n) nh nht t Open.
if (n=g) then return True
else begin
To (n)
for mi nt con m ca (n) do
Begin
g(m):=g(n)+Cost(n,m)
f(m):= g(m)+h(m);
Open:=Open{m};
end;
end;
Return False;
End;
Slide 52
Thut gii A*
A* l mt phin bn c bit ca AKT p dng cho trng hp th.
Thut gii A* c s dng thm tp hp CLOSE lu tr nhng
trng hp c xt n. A* m rng AKT bng cch b sung cch
gii quyt trng hp khi "m" mt nt m nt ny c sn trong
OPEN hoc CLOSE.
Slide 53
m Open:
if n c m bng mt path ngn hn
then Cp nht li m trong Open.
m Close
if n c m bng mt path ngn hn
then begin
Close:=Close-{m}
Open:=Open{m}
end;
end; /*end case*/
Close:=Close{n}
end; / while/
return false;
End;
Slide 54
Hm lng gi Heuristic
Tr 8 hay 15
Trng thi ban u
Tr
15
Tr
8
11
14
10
Trng thi ch
12
13
14
13
15
11
15
12
10
3
4
Slide 56
Thut gii A* V d
l
Xt bi ton 8 pussle
vi goal l:
2 8 3
1 6 4
7 5
1 2 3
8
7 6 5
2 8 3
1
Heuristic 1: Tng s
ming sai v tr
Heuristic
2:
Tng
khong cch sai v tr
ca tng ming.
7 6 5
2 8 3
1 6 4
7 5
Slide 58
Thut gii A* V d
l
1 2 3
1 6 4
7 6 5
Bt u
ch
m Open:
if n c m bng mt path ngn hn
then Cp nht li m trong Open.
m Close
if n c m bng mt path ngn hn
then begin
Close:=Close-{m}
Open:=Open{m}
end;
end; /*end case*/
Close:=Close{n}
end; / while/
return false;
End;
Slide 60
V d
1
State H
State B
State E
F(e) =2+3=5
F(h) =3+3=6
F(a) =0+4=4
F(b) =1+5=6
State A
4
6
State C
F(c) =1+3=4
State F
F(f) =2+3=5
State I
F(i) =3+4=7
1
7
3
5
State D
F(D) =1+5=6
State G
F(g) =2+4=6
3
4
Slide 61
V d
4
1
7
F(j) =3+2=5
F(l) =4+1=5
State J
State L
State Close
F(f) =2+3=5
State K
F(k) =3+4=7
3
4
State Close
State N
Close
8
7
State F
State M
4
6
F(m) =5+0=5
F(n) =5+1=7
Slide 62
Tr chi 8-puzzle
Slide 63
0
1
2
3
4
5
6
7
A4
C4
E5
F5
J5
l5
m5
Open
{A4}
{C4,B6,D6}
{E5,F5,G6,B6,D6}
{F5,H6,G6,B6,D6,I7}
{J5,H6,G6,B6,D6,K7,I7}
{L5,H6,G6,B6,D6,K7,I7}
{M5,H6,G6,B6,D6,K7,I7,N7}
Close
{}
{A4}
{A4,C4}
{A4,C4,E5}
{A4,C4,E5,F5}
{A4,C4,E5,F5,J5}
{A4,C4,E5,F5,J5,L5}
Slide 64
N
: Trng thi bt k
G(n) : Ph tn i t nt bt u n nt n
H(n) : Ph tn c lng heuristic i t nt n n goal
c gi l gii thut A
Monotonicity n iu
1 nu l MAX thng,
0 nu l MIN thng.
C 4 Tm kim Heuristic
Slide 67
C 4 Tm kim Heuristic
Slide 68
Minimax vi su lp c nh
Cc nt l c gn cc gi tr heuristic
Cn gi tr ti cc nt trong l cc gi tr nhn c da trn
gii thut Minimax
C 4 Tm kim Heuristic
Slide 69
Hm Heuristic:
E(n) = M(n) O(n)
Trong :
M(n) l tng s ng thng c th ca ti
O(n) l tng s ng thng c th ca i th
E(n) l tr s nh gi tng cng cho trng thi n
C 4 Tm kim Heuristic
Slide 70
C 4 Tm kim Heuristic
Slide 71
Gii thut ct ta -
C 4 Tm kim Heuristic
Slide 72
Ct ta
S=
MAX
MIN
A=
Z
- cut
=z
z
C 4 Tm kim Heuristic
Slide 73
Ct ta
MIN
MAX
S =
A=
Z
- cut
=z
z
C 4 Tm kim Heuristic
Slide 74
GT Ct Ta -
p dng cho KGTT gi nh
Cc nt khng c gi tr l
cc nt khng c duyt
qua
C 4 Tm kim Heuristic
Slide 75
4.1. M u
2.
4.2. Cc
3.
4.
5.
Tri thc c cu trc: m t tri thc theo cu trc. Loi tri thc ny
Slide 78
Slide 79
Slide 80
Slide 81
4.3.2 Cc lut dn
Slide 83
2. Li khuyn:
IF Xe khng khi ng c
THEN i b
3. Hng dn
IF Xe khng khi ng c AND H thng nhin liu tt
THEN Kim tra h thng in
Slide 84
5. Din gii
IF Xe n AND ting gin
THEN ng c hot ng bnh thng
6. Chn on
IF St cao AND hay ho AND Hng
THEN Vim hng
7. Thit k
IF L n AND Da sng
THEN Nn chn Xe Spacy AND Chn mu sng
Slide 85
Slide 86
p=(a+b+c)/2
Slide 90
4.3.4 Frame
4.3.5 Logic
1. Logic mnh
IF Xe khng khi ng c (A)
AND Khong cch t nh n ch lm l xa (B)
THEN S tr gi lm (C)
Lut trn c th biu din li nh sau:A
B
C
2. Logic v t
2. Modus tollens
1. E2
2. E1 E2
3. E1
Slide 93
Slide 94
Slide 95
Slide 96
Slide 98
Slide 99
Slide 100
Chng 5
My hc
5.1 M U
K s tri thc cn thu nhn tri thc t chuyn gia lnh vc.
Cn bit cc lut m t lnh vc c th.
Bi ton khng c biu din tng minh theo lut, s kin hay cc
quan h.
Slide 103
V d v CC HNH THC HC
V d:
- H MYCIN
- Mng Neural nhn to
- Thut ton hc Quinland
- Bi ton nhn dng
- My chi c car, c tng
Slide 104
Slide 105
Size
Nationality
Family
Conclusion
Small
German
Single
Large
French
Single
Large
German
Single
Small
Italian
Single
Large
German
Married
Large
Italian
Single
Large
Italian
Married
Small
German
Married
B
Slide 106
Slide 107
STT
Size
Family
Conclusion
Small
Single
Large
Single
Large
Married
Small
Married
Nationality
Italian
French
German
Single
Married
Slide 108
Nationality
Italian
French
German
Single
Married
Slide 109
Age
Old
Midle
Midle
Old
New
New
Midle
New
Midle
Old
Competition
No
Yes
No
No
No
No
No
Yes
Yes
Yes
Type
Software
Software
Hardware
Hardware
Hardware
Software
Software
Software
Hardware
Hardware
Profit
Down
Down
Up
Down
Up
Up
Up
Up
Down
Down
Slide 110
Hc theo bt nh(tip)
bt nh ca X:
E ( X ) = - p i log 2 p i
i =1
E ( C / A ) = - p ( c i , a i ) log 2 p ( c i , a i )
i =1
4
4 2
2
E ( C / Competitio n = No ) = - log 2 - log 2 = 0 . 918
6
6 6
6
1
1 3
3
E ( C / Competitio n = Yes ) = - log 2 - log 2 = 0 . 811
4
4 4
4
E ( C / Competitio n ) = 0 . 6 * 0 .918 + 0 .4 * 0 . 811 = 0 .8752
Slide 111
Hc theo bt nh(tip)
Tng t:
E(C/Age) = 0.4
E(C/Type) = 1
Age cho nhiu thng tin
nht
STT
Competition
Type
Profit
Yes
Software
Down
No
Hardware
Up
No
Software
Up
Yes
Hardware
Down
Age
Old
Milde
New
Down
Competition
Up
No
Up
Yes
Down
Slide 112
Hc theo bt nh(tip)
Age
Old
Milde
New
Down
Competition
Up
No
Up
Yes
Down
Slide 113