PENCARIAN
searching?
Awal perkembangan AI
membuktikan teorema
menyelesaikan puzzle/teka-teki
permainan
AI
= search
Permasalahan AI Klasik
Mencari
Permasalahan AI Klasik
Kubus
Rubik 3*3*3
Permasalahan AI Klasik
8-puzzle
Permasalahan AI Klasik
N-queens
Permasalahan AI Klasik
5-queens:
1
1
2
3
4
5
Solusi
2
Agen Pencarian
sensors
?
lingkungan
agen
actuators
Formulasi tujuan
Formulasi permasalahan
State
Aksi
Cari solusi
Definisi Pencarian
Pemeriksaan
sistematis dari
berbagai keadaan untuk
menemukan suatu jalur dari
keadaan awal ke keadaan tujuan
ruang pencarian (state space):
himpunan keadaan yang mungkin
operator yang mendefinisikan
sambungan antar keadaan
Solusi:
dideskripsikan dengan:
Contoh Representasi
Masalah
8 puzzle
2. Labirin
1.
Klasifikasi Metode
Pencarian
2
kategori utama
PENCARIAN BUTA
BFS
C
G
D
H
E
J
O
15
A,
A
B
16
A,
B,
A
B
F
17
A,
B,C
A
B
F
C
G
18
A,
B,C,D
A
B
F
C
G
D
H
E
J
19
A,
B,C,D,E
A
B
F
C
G
D
H
E
J
20
A,
B,C,D,E,
F,
A
B
F
C
G
D
H
E
J
21
A,
B,C,D,E,
F,G
A
B
F
C
G
D
H
E
J
22
A,
B,C,D,E,
F,G,H
A
B
F
C
G
D
H
E
J
23
A,
B,C,D,E,
F,G,H,I
A
B
F
C
G
D
H
E
J
24
A,
B,C,D,E,
F,G,H,I,J,
A
B
F
C
G
D
H
E
J
25
A,
B,C,D,E,
F,G,H,I,J,
K,
A
B
C
G
D
H
E
J
26
A,
B,C,D,E,
F,G,H,I,J,
K,L
A
B
C
G
D
H
E
J
O
27
A,
B,C,D,E,
F,G,H,I,J,
K,L, M,
A
B
C
G
D
H
E
J
O
28
A,
B,C,D,E,
F,G,H,I,J,
K,L, M,N,
A
B
C
G
D
H
E
J
O
29
A,
B,C,D,E,
F,G,H,I,J,
K,L, M,N,
Goal state: O
A
B
C
G
D
H
E
J
O
30
C
G
D
H
E
J
O
31
A
B
F
C
G
D
H
E
J
O
33
A,
A
B
34
A,B,
A
B
F
35
A,B,F,
A
B
F
36
A,B,F,
G,
A
B
F
37
A,B,F,
G,K,
A
B
F
38
A,B,F,
G,K,
L,
A
B
F
O
39
A,B,F,
G,K,
L, O: Goal State
A
B
F
O
40
O
41
Depth-Limited Search
(DLS)
Depth-Limited Search
(DLS)
Limit = 0
Limit = 1
Limit = 2
B
F
C
G
D
H
E
J
O
43
Depth-Limited Search
(DLS)
A,
A
B
Limit = 2
44
Depth-Limited Search
(DLS)
A,B,
A
B
Limit = 2
45
Depth-Limited Search
(DLS)
A,B,F,
A
B
Limit = 2
46
Depth-Limited Search
(DLS)
A,B,F,
G,
A
B
Limit = 2
47
Depth-Limited Search
(DLS)
A,B,F,
G,
C,
A
B
Limit = 2
C
G
48
Depth-Limited Search
(DLS)
A,B,F,
G,
C,H,
A
B
Limit = 2
C
G
49
Depth-Limited Search
(DLS)
A,B,F,
G,
C,H,
D,
A
B
Limit = 2
C
G
D
H
E
J
50
Depth-Limited Search
(DLS)
A,B,F,
G,
C,H,
D,I
A
B
Limit = 2
C
G
D
H
E
J
51
Depth-Limited Search
(DLS)
A,B,F,
G,
C,H,
D,I
J,
A
B
Limit = 2
C
G
D
H
E
J
52
Depth-Limited Search
(DLS)
A,B,F,
G,
C,H,
D,I
J,
E
Limit = 2
A
B
F
C
G
D
H
E
J
53
Depth-Limited Search
(DLS)
A,B,F,
G,
C,H,
D,I
J,
E, Failure
Limit = 2
A
B
C
G
D
H
E
J
54
Depth-Limited Search
(DLS)
B
Limit = 2
C
G
D
H
E
J
O
55
Iterative Deepening
Search (IDS)
DFS with iterative deepening
Limit = 0
Limit = 1
Limit = 2
Limit = 3
Limit = 4
B
F
C
G
D
H
E
J
O
57
Iterative Deepening
Search (IDS)
DLS dengan limit = 0
A,
Limit = 0
59
A, Failure
Limit = 0
60
Iterative Deepening
Search (IDS)
DLS dengan limit = 1
A,
A
Limit = 1
62
A,B,
A
Limit = 1
63
A,B,
C,
A
Limit = 1
64
A,B,
C,
D,
A
Limit = 1
65
A,B
C,
D,
E,
Limit = 1
A
B
66
A,B,
C,
D,
E, Failure
Limit = 1
A
B
67
A,
A
B
Limit = 2
68
A,B,
A
B
Limit = 2
69
A,B,F,
A
B
Limit = 2
70
A,B,F,
G,
A
B
Limit = 2
71
A,B,F,
G,
C,
A
B
Limit = 2
C
G
72
A,B,F,
G,
C,H,
A
B
Limit = 2
C
G
73
A,B,F,
G,
C,H,
D,
A
B
Limit = 2
C
G
D
H
E
J
74
A,B,F,
G,
C,H,
D,I
A
B
Limit = 2
C
G
D
H
E
J
75
A,B,F,
G,
C,H,
D,I
J,
A
B
Limit = 2
C
G
D
H
E
J
76
A,B,F,
G,
C,H,
D,I
J,
E
Limit = 2
A
B
F
C
G
D
H
E
J
77
A,B,F,
G,
C,H,
D,I
J,
E, Failure
Limit = 2
A
B
C
G
D
H
E
J
O
78
Iterative Deepening
Search (IDS)
DLS dengan limit = 3
A,
A
B
Limit = 3
80
A,B,
A
B
F
Limit = 3
81
A,B,F,
A
B
F
Limit = 3
82
A,B,F,
G,
A
B
F
Limit = 3
83
A,B,F,
G,K,
A
B
F
Limit = 3
84
A,B,F,
G,K,
L,
A
B
F
Limit = 3
85
A,B,F,
G,K,
L,
C,
A
B
F
Limit = 3
C
G
86
A,B,F,
G,K,
L,
C,H,
A
B
F
Limit = 3
C
G
87
A,B,F,
G,K,
L,
C,H,
D,
A
B
F
Limit = 3
C
G
D
H
E
J
88
A,B,F,
G,K,
L,
C,H,
D,I,
A
B
F
Limit = 3
C
G
D
H
E
J
89
A,B,F,
G,K,
L,
C,H,
D,I,M,
A
B
F
Limit = 3
C
G
D
H
E
J
90
A,B,F,
G,K,
L,
C,H,
D,I,M,
J,
A
B
F
Limit = 3
C
G
D
H
E
J
91
A,B,F,
G,K,
L,
C,H,
D,I,M,
J,N,
A
B
F
Limit = 3
C
G
D
H
E
J
92
A,B,F,
G,K,
L,
C,H,
D,I,M,
J,N,
E,
A
B
F
Limit = 3
C
G
D
H
E
J
93
A,B,F,
G,K,
L,
C,H,
D,I,M,
J,N,
E,Failure
A
B
Limit = 3
C
G
D
H
E
J
O
94
Iterative Deepening
Search (IDS)
DLS dengan limit 4
A,
A
B
Limit = 4
96
A,B,
A
B
F
Limit = 4
97
A,B,F,
A
B
F
Limit = 4
98
A,B,F,
G,
A
B
F
Limit = 4
99
A,B,F,
G,K,
A
B
F
Limit = 4
10
A,B,F,
G,K,
L,
A
B
F
Limit = 4
O
10
A,B,F,
G,K,
L, O: Goal State
A
B
F
Limit = 4
O
10
O
10
Beberapa Istilah
State
space/ruang pencarian
Pohon pencarian
Initial state
Operator/Fungsi Successor
Path:
Solution path
Path cost
Goal test
Ekspansi simpul
List Simpul Open
List Simpul Closed
Algoritma searching
umum
Contoh 1. Dari S ke G
BFS,
DFS, UCS
Contoh 2: Permasalahan
Petani
Petani
Permasalahan Petani
-/PSIJ
PSIJ/-
Formulasi permasalahan
Representasi
State
P-bawa-S
P-bawa-I
P-bawa-J
P-sendiri
Biaya
Tugas Berkelompok 4
orang
Lakukan pencarian dari posisi awal
ke posisi akhir dengan metode
a. BFS
b. DFS
c. UCS
Untuk tiap metode, tunjukkan
.Pohon pencarian
.Urutan ekspansi simpul
.Jalur solusi yang ditemukan
Soal
Soal
Anggota Kelompok
Pengumpulan
Ditulis