Rifky Kurniadi Suharli 2402001926 TP1 W2 S3 R2 1 PDF
Rifky Kurniadi Suharli 2402001926 TP1 W2 S3 R2 1 PDF
2402001926 -LNCA
Minggu ke 2
a. Ubahlah gambar denah RS. Amelia Kediri menjadi sebuah pohon pencarian dengan node
akar node S pada ruang IGD.
b. Berdasarkan pohon pencarian yang sudah Anda buat, carilah jalur pencarian dari node S
(ruang IGD) menuju node G (ruang Donal 3) dengan menggunakan metode Depth First
Search (DFS)
Artificial Intelligence
This study source was downloaded by 100000843108429 from CourseHero.com on 11-25-2022 17:45:32 GMT -06:00
https://www.coursehero.com/file/136825509/Rifky-Kurniadi-Suharli-2402001926-TP1-W2-S3-R2-1pdf/
c. Dengan menggunakan metode Breadth First Search (BFS), tunjukkan path (jalur
pencarian) dari node C jika dimulai dari node A.
Jawab :
Artificial Intelligence
This study source was downloaded by 100000843108429 from CourseHero.com on 11-25-2022 17:45:32 GMT -06:00
https://www.coursehero.com/file/136825509/Rifky-Kurniadi-Suharli-2402001926-TP1-W2-S3-R2-1pdf/
b. jalur pencarian dari node S (ruang IGD) menuju node G (ruang Donal 3) dengan
menggunakan metode Depth First Search (DFS)
Artificial Intelligence
This study source was downloaded by 100000843108429 from CourseHero.com on 11-25-2022 17:45:32 GMT -06:00
https://www.coursehero.com/file/136825509/Rifky-Kurniadi-Suharli-2402001926-TP1-W2-S3-R2-1pdf/
c. Dengan menggunakan metode Breadth First Search (BFS), tunjukkan path (jalur
pencarian) dari node C jika dimulai dari node A.
• BFS S to G :
1 → 2 →17 → 3 → 5 → 18 →14 → 4 → 6 → 9 → 13 → 15 → 7 → 8 → 12
• BFS Greedy :
1 → 17 → 14 → 13 → 12
Artificial Intelligence
This study source was downloaded by 100000843108429 from CourseHero.com on 11-25-2022 17:45:32 GMT -06:00
https://www.coursehero.com/file/136825509/Rifky-Kurniadi-Suharli-2402001926-TP1-W2-S3-R2-1pdf/
2. Perhatikan pohon pencarian berikut:
s h(S) = 10 h(E) = 4
h(A) = 12 h(F) = 6
6 h(B) = 9 h(G) = 5
h(C) = 8 h(H) = 3
C B A h(D) = 2 h(I) = 0
I c. A*
Jawab :
a. Uniform Cost Search merupakan salah satu teknik pencarian yang memperhitungkan
cost/biaya. Dari satu state ke state yang lain memiliki nilai/bobot yang dapat diukur
untuk memilih state yang paling optimal.
f → {S};
1. f → {As, Bs,Cs} ; // 5,6,10
2. f → {EA} ; // 3
3. f → {HA} ; // 7
4. f → {IH} ; // 2
• Path :S→A→E→H→I
• Cost : 17
• No. of Expan. : 4
Artificial Intelligence
This study source was downloaded by 100000843108429 from CourseHero.com on 11-25-2022 17:45:32 GMT -06:00
https://www.coursehero.com/file/136825509/Rifky-Kurniadi-Suharli-2402001926-TP1-W2-S3-R2-1pdf/
b. Algoritma Greedy
h(S) = 10 h(E) = 4
h(A) = 12 h(F) = 6
h(B) = 9 h(G) = 5
h(C) = 8 h(H) = 3
h(D) = 2 h(I) = 0
➢ Path 1 : f(n) = S + C + D + F + I = 10 + 12 + 8 + 6 + 0 = 36
➢ Path 2 : f(n) = S + C + D + G + I = 10 + 12 + 8 + 5 + 0 = 35
➢ Path 3 : f(n) = S + B + D + F + I = 10 + 9 + 2 + 6 + 0 = 27
➢ Path 4 : f(n) = S + B + D + G + I = 10 + 9 + 2 + 5 + 0 = 26 → (shortest)
➢ Path 5 : f(n) = S + B + E + H + I = 10 + 9 + 4 + 3 + 0 = 26 → (shortest)
➢ Path 6 : f(n) = S + A + E + H + I = 10 + 12 + 4 + 3 + 0 = 29
c. A*
Path : S → B → D → G → I
S = 0 + 10 = 10 E = 18 + 4 = 12
A = 5 + 12 = 17 F = 4 + 6 = 10
B = 6 + 9 = 15 G=3+5=8
C = 10 + 8 = 18 I=2+5=7
D=6+2=8
3. Jika game “word scramble” dan aplikasi “medical diagnosis” dianggap sebagai sebuah
agen cerdas, lengkapilah tabel PEAS (Performance measure, Environment, Actuators,
Sensors) dibawah ini. Beri penjelasan dari setiap atribut yang Anda didefinisikan dalam
tabel
Artificial Intelligence
This study source was downloaded by 100000843108429 from CourseHero.com on 11-25-2022 17:45:32 GMT -06:00
https://www.coursehero.com/file/136825509/Rifky-Kurniadi-Suharli-2402001926-TP1-W2-S3-R2-1pdf/
Word
Scramble
Medical
Diagnosis
Jawab :
Artificial Intelligence
This study source was downloaded by 100000843108429 from CourseHero.com on 11-25-2022 17:45:32 GMT -06:00
https://www.coursehero.com/file/136825509/Rifky-Kurniadi-Suharli-2402001926-TP1-W2-S3-R2-1pdf/
Powered by TCPDF (www.tcpdf.org)