Scribd
Upload
78 views

Lecture On AI - Uninformed Search Mechanisms

The document discusses several uninformed search strategies used in artificial intelligence including breadth-first search, uniform-cost search, depth-first search, depth-limited search, and iterative deepening depth-first search. These strategies explore the problem space without any heuristics or additional information. Breadth-first search explores all nodes at each level before moving to the next level. Uniform-cost search expands the lowest-cost node first. Depth-first search explores each path as deeply as possible before backtracking. Depth-limited search limits the depth of depth-first search. Iterative deepening depth-first search gradually increases the depth limit of depth-first search until a goal is found.

Uploaded by

Sujit Dunga
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
78 views

Lecture On AI - Uninformed Search Mechanisms

The document discusses several uninformed search strategies used in artificial intelligence including breadth-first search, uniform-cost search, depth-first search, depth-limited search, and iterative deepening depth-first search. These strategies explore the problem space without any heuristics or additional information. Breadth-first search explores all nodes at each level before moving to the next level. Uniform-cost search expands the lowest-cost node first. Depth-first search explores each path as deeply as possible before backtracking. Depth-limited search limits the depth of depth-first search. Iterative deepening depth-first search gradually increases the depth limit of depth-first search until a goal is found.

Uploaded by

Sujit Dunga
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Uninformed Search Strategies

ARTIFICIAL INTELLIGENCE
ARTIFICIAL INTELLIGENCE
Search Process : UNINFORMED SEARCH STRATEGIES
Breadth-First Search (BFS)

Uniform-Cost Search (UCS)

Depth-First Search (DFS)

Depth-Limited Search

Iterative Deepening Depth First Search
Definitions
Branching Factor (b) : The maximum number of successors to a node.

Depth (d) : The depth of the shallowest goal node.

Maximum path length (m) : The maximum length of any path in the state space.

Time : The number of nodes generated in the search process.

Space : The maximum number of nodes stored in memory during the search process.
ARTIFICIAL INTELLIGENCE
Search Process :
A
B
E
C
D
I
J
K
F
Start node
L
G H
Goal node
ARTIFICIAL INTELLIGENCE
Search Process : BREADTH-FIRST SEARCH (BFS)
All nodes at a given depth are expanded before any nodes at a lower level are
expanded.
A
B
E
C
D
I
J
K
F
Start node
Level 1
Level 2
L
Level 3
G H
1
2
3
4
6 5
7
8
9
Queuing: FIFO
Queue : A Queue : B,C Queue : C, D Queue : D, E, F Queue : E, F, G, H Queue : F, G, H, I, J Queue : G, H, I, J, K, L
A
Queue : I, J, K, L Queue : J, K, L Queue : K, L
A
Queue :
B
Queue : C
B
D
Queue : D
C C
Queue : E, F
D
Queue : F, G, H
E E
Queue : G, H, I, J
F
Queue : H, I, J, K, L
F
G G H H
I I
J
Added queue
Removed queue
Expanded
ARTIFICIAL INTELLIGENCE
Search Process : UNIFORM-COST SEARCH
The node with the least cost is expanded first.
Added queue
Removed queue
Expanded
Here the total path cost is considered.
A
B
E
C
D
I
J
F
G H
1
2
3
4
5
J
Queue : A Queue : C, B Queue : B, E, F Queue : D, E, F Queue : E, G, F, H Queue : J, G, F, I, H
10
5
1
7
PC: 10 + 1 = 11
PC: 5 + 7 = 12
10
PC: 5 + 10 = 15
3
PC: 11 + 3 = 14
NOTE: Node F is never
expanded, therefore, nodes
K & L from our BFS tree are
never seen in this tree.
9
PC: 11 + 9 = 20
4
PC: 12 + 4 = 16
1
PC: 12 + 1 = 13
Queue : G, F, I, H
A
Queue : Queue : B
A
C C
Queue : E, F
B B
D
Queue : E, F
D
Queue : G, F, H
E E
ARTIFICIAL INTELLIGENCE
Search Process : DEPTH-FIRST SEARCH (DFS)
Follows each path to the greatest depth before moving to the next path.
Added queue
Removed queue
Expanded
A
B
E
C
D
I
J
F
Start node
Level 1
Level 2
Level 3
G H
1
2
3
4
6
5
7
8
J
Queuing: LIFO Queue : A Queue : B,C Queue : D, C Queue : G, H, C Queue : C Queue : E, F Queue : I, J, F Queue : J, F Queue : F
11
Queue :
A A
Queue : C
B B
Queue : C
D D
Queue : H, C
G G H
Queue :
H
C
Queue : F
C
E E
I I
ARTIFICIAL INTELLIGENCE
Search Process : DEPTH-LIMITED SEARCH
Depth-Limited Search is DFS with predefined depth limit. We have a cut-
off preset at a depth limit of l.
Added queue
Removed queue
Expanded
Start node
Level 1
Level 2
Level 3
Is this result the same
as DFS?
What changes if l = 2?
A
B
E
C
D
I
J
F
G H
1
2
3
4
5
J
Queue : A Queue : B,C Queue : D, C Queue : G, H, C Queue : C Queue : E, F Queue : I, J, F Queue : J, F Queue : F
Queue :
A A
Queue : C
B B
Queue : C
D D
Queue : H, C
G H
Queue :
C
Queue : F
C
E E
I
ARTIFICIAL INTELLIGENCE
Search Process : ITERATIVE DEEPENING DEPTH-FIRST SEARCH (IDS)
IDS is DFS which gradually increases its depth limit until the goal node is
reached.
Added queue
Removed queue
Expanded
A
B
E
C
D
I
J
F
G H J
Limit = 0 Limit = 1
Queue : A Queue : B, C Queue : C
Limit = 2
Queue : D, C Queue : E, F Queue : F
Limit = 3
Queue : G, H, C Queue : H, C Queue : I, J, F Queue : J, F Queue :
A
B
C
D
E
F
G
I
H
A
B
D
E
C
1 2
3
4
5
6
7
8
9

You might also like