Scribd
Upload
19 views24 pages

Unit 1 - Uninformed Search Strategies - Session 5

Uploaded by

ULAGANATHAN MS
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
19 views24 pages

Unit 1 - Uninformed Search Strategies - Session 5

Uploaded by

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

CS8691 - ARTIFICIAL INTELLIGENCE

Session 5

UNINFORMED SEARCH
ARTIFICIAL INTELLIGENCE
KNOWLEDGE REPRESENTATION

Explaination in தமி
ழ்
Uninformed search strategies
• do not have additional information about state or search space

• called blind search

• brute force-way
Uninformed search strategies
• Breadth-first Search

• Depth-first Search

• Depth-limited Search

• Iterative deepening depth-first search

• Uniform cost search

• Bidirectional Search
Uninformed search strategies
• Completeness: is the strategy guaranteed to find a solution when there is
one?

• Time complexity: how long does it take to find a solution?

• Space complexity: how much memory does it need to perform the search?

• Optimality: does the strategy find the highest-quality solution when there
are several different solutions?7
Uninformed search strategies
• b : The branching factor is the number of successors generated by a
given node.

• d : the solution could be found at any point on the dth level

• m: maximum depth of the tree


Breadth-first Search
• searches breadthwise in a tree or graph

• BFS algorithm starts searching from the root node of the tree and
expands all successor node at the current level before moving to nodes
of next level

• Breadth-first search implemented using FIFO queue data structure


Breadth-first Search
Breadth-first Search
DEPTH-first Search
• starts from the root node and follows each path to its greatest depth
node before moving to the next path.

• DFS uses a stack data structure for its implementation.


DEPTH-first Search
DEPTH-first Search
DEPTH-Limited Search
• A depth-limited search algorithm is similar to depth-first search with a
predetermined limit.

• Depth-limited search can solve the drawback of the infinite path in the
Depth-first search
DEPTH-Limited Search
DEPTH-Limited Search
Iterative deepening depth-first Search
• This algorithm performs depth-first search up to a certain "depth
limit", and it keeps increasing the depth limit after each iteration until
the goal node is found.
Iterative deepening depth-first Search
Iterative deepening depth-first Search
Bidirectional Search Algorithm
• runs two simultaneous searches, one form initial state called as
forward-search and other from goal node called as backward-search

• Bidirectional search can use search techniques such as BFS, DFS,


DLS, etc
Bidirectional Search Algorithm
Bidirectional Search Algorithm
Uniform-cost Search Algorithm
• Traversing a weighted tree or graph

• The primary goal of the uniform-cost search is to find a path to the


goal node which has the lowest cumulative cost

• A uniform-cost search algorithm is implemented by the priority queue


Uniform-cost Search Algorithm
Thank You!

You might also like