solving problems by searching chapter 3 artificial intelligent team teaching ai (created by dewi...
TRANSCRIPT
![Page 1: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/1.jpg)
Solving problems by searching
Chapter 3Artificial Intelligent
Team Teaching AI (created by Dewi Liliana)
PTIIK 2012
![Page 2: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/2.jpg)
OutlineProblem-solving agentsProblem typesProblem formulationExample problemsBasic search algorithms
![Page 3: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/3.jpg)
Problem Solving AgentProblem-solving agent is a kind of goal-
based agentIt decides what to do by finding sequences
of actions that lead to desirable statesGoal formulationProblem formulationSearch takes problem as input and
return solution in the form of action sequence
Execution
![Page 4: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/4.jpg)
Problem-solving agents
![Page 5: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/5.jpg)
Example: RomaniaOn holiday in Romania; currently in Arad.Flight leaves tomorrow from BucharesFormulate goal:
be in BucharestFormulate problem:
states: various citiesactions: drive between cities
Find solution:sequence of cities, e.g., Arad, Sibiu, Fagaras,
Bucharest
![Page 6: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/6.jpg)
Example: Romania
![Page 7: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/7.jpg)
Problem types Deterministic, fully observable single-state problem
Agent knows exactly which state it will be in; solution is a sequence
Non-observable sensorless problem (conformant problem)Agent may have no idea where it is; solution is a sequence
Nondeterministic and/or partially observable contingency problempercepts provide new information about current state
Unknown state space exploration problem
![Page 8: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/8.jpg)
Example: vacuum world Single-state, start in #5.
Solution?
![Page 9: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/9.jpg)
Example: vacuum world Single-state, start in #5.
Solution? [Right, Suck]
Sensorless, start in {1,2,3,4,5,6,7,8} e.g., Right goes to {2,4,6,8} Solution?
![Page 10: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/10.jpg)
Example: vacuum world Sensorless, start in
{1,2,3,4,5,6,7,8} e.g., Right goes to {2,4,6,8} Solution? [Right,Suck,Left,Suck]
Contingency Nondeterministic: Suck may
dirty a clean carpetPartially observable: location, dirt
at current location.Percept: [L, Clean], i.e., start in #5 or #7
Solution?
![Page 11: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/11.jpg)
Example: vacuum world Sensorless, start in
{1,2,3,4,5,6,7,8} e.g., Right goes to {2,4,6,8} Solution? [Right,Suck,Left,Suck]
Contingency Nondeterministic: Suck may
dirty a clean carpetPartially observable: location,
dirt at current location.Percept: [L, Clean], i.e.,
start in #5 or #7Solution? [Right, if dirt then Suck]
![Page 12: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/12.jpg)
Single-state problem formulationA problem is defined by four items:
1. initial state e.g., "at Arad"2. actions or successor function S(x) = set of action–state pairs
<action,successor(state)> e.g., S(Arad) = {<Arad Zerind, Zerind>, … }
3. goal test, can be explicit, e.g., x = "at Bucharest" implicit, e.g., Checkmate(x)
4. path cost (additive) Assign numeric cost to each path e.g., sum of distances, number of actions executed, etc. c(x,a,y) is the step cost, assumed to be ≥ 0
A solution is a sequence of actions leading from the initial state to a goal state
Solution quality is measured by the path cost function
![Page 13: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/13.jpg)
Selecting a state space Real world is absurdly complex
state space must be abstracted for problem solving (Abstract) state = set of real states (Abstract) action = complex combination of real actions
e.g., "Arad Zerind" represents a complex set of possible routes, detours, rest stops, etc.
(Abstract) solution = set of real paths that are solutions in the real world
Each abstract action should be "easier" than the original problem
![Page 14: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/14.jpg)
Vacuum world state space graph
states?actions?goal test?path cost?
![Page 15: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/15.jpg)
Vacuum world state space graph
states? integer dirt and robot location actions? Left, Right, Suck goal test? no dirt at all locations path cost? 1 per action
![Page 16: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/16.jpg)
Example: The 8-puzzle
states?actions?goal test?path cost?
![Page 17: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/17.jpg)
Example: The 8-puzzle
states? locations of tiles actions? move, blank, left, right, up, down goal test? = goal state (given)path cost? 1 per move
[Note: optimal solution of n-Puzzle family is NP-hard]
![Page 18: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/18.jpg)
8-Queens Problem
Letakkan 8 bidak menteri (queen!) sedemikian sehingga tidak ada yang saling “makan” (menteri bisa makan dalam satu baris, kolom, diagonal).
State: Papan catur dengan n bidak menteri, 0 n 8. Initial state: Papan catur yang kosong. Possible action: Letakkan sebuah bidak menteri di posisi kosong. Goal test: 8 bidak menteri di papan, tidak ada yang saling makan.A better formulation would prohibit placing A queen in any square that is
already attacked
![Page 19: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/19.jpg)
Example: robotic assembly
states?: real-valued coordinates of robot joint angles parts of the object to be assembled
actions?: continuous motions of robot jointsgoal test?: complete assemblypath cost?: time to execute
![Page 20: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/20.jpg)
Tree search algorithmsBasic idea:
offline, simulated exploration of state space by generating successors of already-explored states (a.k.a.~expanding states)
![Page 21: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/21.jpg)
Tree search example
![Page 22: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/22.jpg)
Tree search example
![Page 23: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/23.jpg)
Tree search example
![Page 24: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/24.jpg)
Implementation: general tree search
![Page 25: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/25.jpg)
Implementation: states vs. nodes
A state is a (representation of) a physical configuration A node is a data structure constituting part of a search
tree includes state, parent node, action, path cost g(x), depth
The Expand function creates new nodes, filling in the various fields and using the SuccessorFn of the problem to create the corresponding states.
![Page 26: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/26.jpg)
Search strategies A search strategy is defined by picking the order of node
expansion Strategies are evaluated along the following dimensions:
completeness: does it always find a solution if one exists? time complexity: number of nodes generatedspace complexity: maximum number of nodes in memoryoptimality: does it always find a least-cost solution?
Time and space complexity are measured in terms of b: maximum branching factor of the search treed: depth of the least-cost solutionm: maximum length of any path in the state space (may be
∞)
![Page 27: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/27.jpg)
Uninformed search strategiesUninformed search strategies use only the
information available in the problem definition
Breadth-first searchUniform-cost searchDepth-first searchDepth-limited searchIterative deepening search
![Page 28: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/28.jpg)
Breadth-first searchExpand shallowest unexpanded nodeImplementation:
fringe is a FIFO queue, i.e., new successors go at end
![Page 29: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/29.jpg)
Breadth-first searchExpand shallowest unexpanded nodeImplementation:
fringe is a FIFO queue, i.e., new successors go at end
![Page 30: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/30.jpg)
Breadth-first searchExpand shallowest unexpanded nodeImplementation:
fringe is a FIFO queue, i.e., new successors go at end
![Page 31: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/31.jpg)
Breadth-first searchExpand shallowest unexpanded nodeImplementation:
fringe is a FIFO queue, i.e., new successors go at end
![Page 32: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/32.jpg)
Properties of breadth-first searchComplete? Yes (if b is finite)Time? 1+b+b2+b3+… +bd + b(bd-1) = O(bd+1)Space? O(bd+1) (keeps every node in memory)Optimal? Yes (if cost = 1 per step)
Space is the bigger problem (more than time)
![Page 33: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/33.jpg)
Uniform-cost search Expand least-cost unexpanded node Implementation:
fringe = queue ordered by path cost Equivalent to breadth-first if step costs all equal Complete? Yes, if step cost ≥ ε Time? # of nodes with g ≤ cost of optimal solution,
O(bceiling(C*/ ε)) where C* is the cost of the optimal solution Space? # of nodes with g ≤ cost of optimal solution,
O(bceiling(C*/ ε)) Optimal? Yes – nodes expanded in increasing order of
g(n)
![Page 34: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/34.jpg)
Depth-first searchExpand deepest unexpanded node Implementation:
fringe = LIFO queue, i.e., put successors at front
![Page 35: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/35.jpg)
Depth-first searchExpand deepest unexpanded node Implementation:
fringe = LIFO queue, i.e., put successors at front
![Page 36: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/36.jpg)
Depth-first searchExpand deepest unexpanded node Implementation:
fringe = LIFO queue, i.e., put successors at front
![Page 37: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/37.jpg)
Depth-first searchExpand deepest unexpanded node Implementation:
fringe = LIFO queue, i.e., put successors at front
![Page 38: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/38.jpg)
Depth-first searchExpand deepest unexpanded node Implementation:
fringe = LIFO queue, i.e., put successors at front
![Page 39: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/39.jpg)
Depth-first searchExpand deepest unexpanded node Implementation:
fringe = LIFO queue, i.e., put successors at front
![Page 40: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/40.jpg)
Depth-first searchExpand deepest unexpanded node Implementation:
fringe = LIFO queue, i.e., put successors at front
![Page 41: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/41.jpg)
Depth-first searchExpand deepest unexpanded node Implementation:
fringe = LIFO queue, i.e., put successors at front
![Page 42: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/42.jpg)
Depth-first searchExpand deepest unexpanded node Implementation:
fringe = LIFO queue, i.e., put successors at front
![Page 43: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/43.jpg)
Depth-first searchExpand deepest unexpanded node Implementation:
fringe = LIFO queue, i.e., put successors at front
![Page 44: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/44.jpg)
Depth-first searchExpand deepest unexpanded node Implementation:
fringe = LIFO queue, i.e., put successors at front
![Page 45: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/45.jpg)
Depth-first searchExpand deepest unexpanded node Implementation:
fringe = LIFO queue, i.e., put successors at front
![Page 46: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/46.jpg)
Properties of depth-first searchComplete? No: fails in infinite-depth spaces, spaces
with loopsModify to avoid repeated states along path
complete in finite spaces
Time? O(bm): terrible if m is much larger than d but if solutions are dense, may be much faster than
breadth-firstSpace? O(bm), i.e., linear space!Optimal? No
![Page 47: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/47.jpg)
Depth-limited search= depth-first search with depth limit l,
i.e., nodes at depth l have no successors Recursive implementation:
![Page 48: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/48.jpg)
Iterative deepening search
o Prinsipnya: lakukan depth-limited search secara bertahap dengan nilai l yang incremental Strategi ini menggabungkan manfaat DFS dan BFS: space complexity linier & completeness terjaminLakukan depth-limited search dengan l = 0,1,2,… sampai tidak cutoff
![Page 49: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/49.jpg)
Iterative deepening search l =0
![Page 50: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/50.jpg)
Iterative deepening search l =1
![Page 51: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/51.jpg)
Iterative deepening search l =2
![Page 52: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/52.jpg)
Iterative deepening search l =3
![Page 53: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/53.jpg)
Iterative deepening search Number of nodes generated in a depth-limited search to
depth d with branching factor b: NDLS = b0 + b1 + b2 + … + bd-2 + bd-1 + bd
Number of nodes generated in an iterative deepening search to depth d with branching factor b:
NIDS = (d+1)b0 + d b^1 + (d-1)b^2 + … + 3bd-2 +2bd-1 + 1bd
For b = 10, d = 5,NDLS = 1 + 10 + 100 + 1,000 + 10,000 + 100,000 = 111,111NIDS = 6 + 50 + 400 + 3,000 + 20,000 + 100,000 = 123,456
Overhead = (123,456 - 111,111)/111,111 = 11%
![Page 54: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/54.jpg)
Sekilas strategi IDS ini kelihatan tidak efisien atau boros: banyak node digenerate ulang!
IDS sebenarnya malah lebih cepat daripada BFS (jika tree memiliki depth besar)
(root node tidak dihitung krn dianggap initial state)
Pada umumnya Iterative deepening search adalah uninformed search strategy terbaik jika state space besar dan kedalaman solusi (d) tidak diketahui
![Page 55: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/55.jpg)
Properties of iterative deepening searchComplete? YesTime? (d+1)b0 + d b1 + (d-1)b2 + … + bd =
O(bd)Space? O(bd)Optimal? Yes, if step cost = 1
![Page 56: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/56.jpg)
Summary of algorithms
![Page 57: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/57.jpg)
Repeated statesFailure to detect repeated states can turn a
linear problem into an exponential one!
![Page 58: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/58.jpg)
Graph search
![Page 59: Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012](https://reader035.vdocuments.us/reader035/viewer/2022062620/551a9db2550346761a8b5e2a/html5/thumbnails/59.jpg)
Summary Problem formulation usually requires abstracting away
real-world details to define a state space that can feasibly be explored
Variety of uninformed search strategies
Iterative deepening search uses only linear space and not much more time than other uninformed algorithms