Scribd
Upload
35 views

Solving Problems by Searching: (Un-Informed Search)

The document discusses problem solving agents and uninformed search strategies. It introduces the vacuum world problem and provides examples of solutions. It then describes three uninformed search strategies - breadth-first search, depth-first search, and iterative deepening search. Breadth-first search uses a queue and expands the shallowest nodes first. Depth-first search uses a stack and expands the deepest nodes first. Iterative deepening search performs incremental depth-limited searches to combine the benefits of breadth-first and depth-first search.

Uploaded by

Ahmar Fauzan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
35 views

Solving Problems by Searching: (Un-Informed Search)

The document discusses problem solving agents and uninformed search strategies. It introduces the vacuum world problem and provides examples of solutions. It then describes three uninformed search strategies - breadth-first search, depth-first search, and iterative deepening search. Breadth-first search uses a queue and expands the shallowest nodes first. Depth-first search uses a stack and expands the deepest nodes first. Iterative deepening search performs incremental depth-limited searches to combine the benefits of breadth-first and depth-first search.

Uploaded by

Ahmar Fauzan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 32

Solving problems by

searching
(Un-Informed Search)

Chapter 3
Artificial Intelligent
Outline
Problem-solving agents
Problem types
Example problems
Basic search algorithms
Problem Solving Agent
Problem-solving agent is a kind of goal-
based agent
It decides what to do by finding sequences
of actions that lead to desirable states
Goal formulation
Problem formulation
Search  takes problem as input and
return solution in the form of action
sequence
Execution
Example: vacuum world
 Single-state, start in #5.
Solution?

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?
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 carpet
 Partially observable: location,
dirt at current location.
 Percept: [L, Clean], i.e., start in #5 or #7
Solution?
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 carpet
 Partially observable: location,
dirt at current location.
 Percept: [L, Clean], i.e.,
start in #5 or #7
Solution? [Right, if dirt then Suck]
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 generated
 space complexity: maximum number of nodes in memory
 optimality: does it always find a least-cost solution?

 Time and space complexity are measured in terms of


 b: maximum branching factor of the search tree
 d: depth of the least-cost solution
 m: maximum length of any path in the state space (may be
∞)
Uninformed search strategies
Uninformed search strategies use only the
information available in the problem
definition
Breadth-first search
Depth-first search
Iterative deepening search
Breadth-first search
Expand shallowest unexpanded node
Implementation:
fringe is a FIFO queue, i.e., new successors
go at end
Breadth-first search
Expand shallowest unexpanded node
Implementation:
fringe is a FIFO queue, i.e., new successors
go at end


Breadth-first search
Expand shallowest unexpanded node
Implementation:
fringe is a FIFO queue, i.e., new successors
go at end


Breadth-first search
Expand shallowest unexpanded node
Implementation:
fringe is a FIFO queue, i.e., new successors
go at end


Depth-first search
 Expand deepest unexpanded node
 Implementation:
 fringe = LIFO queue, i.e., put successors at front



Depth-first search
 Expand deepest unexpanded node
 Implementation:
 fringe = LIFO queue, i.e., put successors at front



Depth-first search
 Expand deepest unexpanded node
 Implementation:
 fringe = LIFO queue, i.e., put successors at front



Depth-first search
 Expand deepest unexpanded node
 Implementation:
 fringe = LIFO queue, i.e., put successors at front


Depth-first search
 Expand deepest unexpanded node
 Implementation:
 fringe = LIFO queue, i.e., put successors at front


Depth-first search
 Expand deepest unexpanded node
 Implementation:
 fringe = LIFO queue, i.e., put successors at front



Depth-first search
 Expand deepest unexpanded node
 Implementation:
 fringe = LIFO queue, i.e., put successors at front



Depth-first search
 Expand deepest unexpanded node
 Implementation:
 fringe = LIFO queue, i.e., put successors at front



Depth-first search
 Expand deepest unexpanded node
 Implementation:
 fringe = LIFO queue, i.e., put successors at front



Depth-first search
 Expand deepest unexpanded node
 Implementation:
 fringe = LIFO queue, i.e., put successors at front



Depth-first search
 Expand deepest unexpanded node
 Implementation:
 fringe = LIFO queue, i.e., put successors at front



Depth-first search
 Expand deepest unexpanded node
 Implementation:
 fringe = LIFO queue, i.e., put successors at front



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 terjamin
Lakukan depth-limited search dengan l = 0,1,2,… sampai
tidak cutof
Iterative deepening search l =0
Iterative deepening search l =1
Iterative deepening search l =2
Iterative deepening search l =3
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)
Summary
 Problem 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

You might also like