1 / 12

SEARCHING (2)

SEARCHING (2). KECERDASAN BUATAN. Metode Pencarian Heuristik. Heuristik berasal dari bahasa Yunani yang berarti ‘mencari’ atau ‘menemukan’.

eve
Télécharger la présentation

SEARCHING (2)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. SEARCHING (2) KECERDASAN BUATAN

  2. Metode Pencarian Heuristik Heuristik berasal dari bahasa Yunani yang berarti ‘mencari’ atau ‘menemukan’. Heuristik dapat diartikan sebagai proses yang mungkin dapat menyelesaikan suatu asalah tetapi tidak ada jaminan bahwa solusi yang dicari selalu dapat di termukan. Heurisitik  suatu fungsi yang memberikan suatu nilai berupa biaya perkiraan (estimasi) dari suatu solusi

  3. Generate and Test Metode yang paling sederhana Algoritma GT menggunakan prinsip dasar Depth First Search

  4. Generate and Test Algorithm Generate a possible solution. For some problems, this means generating a particularpointin the problem space. For others, it means generating a path from a start state. Test to see if this is actually a solution by comparing the chosen point or endpoint ofthe chosen path to the set of acceptable goal states. If a solution has been found, quit. Otherwise, return to step 1.

  5. Best First Search Metodeyang membangkitkansuksesordenganmempertimbangkanharga (didapatdarifungsiheuristiktertentu) darisetiapnode. BFS memilih simpul baru yang memiliki biaya terkecil diantara semua leaf nodes (simpul – simpul pada level terdalam)

  6. Best First Search

  7. Algoritma Best-First Search 1. Start with OPEN containing just the initial state. 2. Until a goal is found or there are no nodes left on OPEN do: a) Pick the best node on OPEN. b) Generate its successors. c) For each successor do: i. If it has not been generated, evaluate it, add it to OPEN, and record its parent. ii. If it has been generated, change the parent if this new path is better than the previous one. In that case,update the cost of getting to this node and to any successors that this node may already have.

  8. Greedy Best-First Search Salah satu jenis algoritma Best-First Search yang paling sederhana dengn hanya memperhitungkan biaya perkiraan saja f(n) = h(n)

  9. Contoh n           S       A       B       C       D      E       F      G      H     J          K         L       Mh(n)    80    80   60 70   85    74   70   0   40    100    30    20    70

  10. Greedy Best-First Search Complete ? No, can get stuck in loopsComplete if repeated-state checking is performed Time ? O(bm), but good heuristic can give dramatic improvement Space ? O(bm) – save all nodes in memory Optimal ? No, Why ?

  11. A* (A Bintang) Algoritma BFS yang menggabungkan Uniform Cost Search dan Greedy Best-First Search. Biaya yang diperhitungan = biaya sebenarnya + biaya perkiraan f(n) = g(n) + h(n)

  12. Iterative Deepning A* (IDA*) Simplified Memory-Bounded A* Bi-directioinal A* Modified Bi-directional A* Dynamic Weighting A* Beam A*

More Related