Scribd
Upload
6 views25 pages

PAI - Unit 1 PLM Solving

Uploaded by

21MDR039 SOWBARNIKA R
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
6 views25 pages

PAI - Unit 1 PLM Solving

Uploaded by

21MDR039 SOWBARNIKA R
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/ 25

Search Algorithms in

Artificial Intelligence
Search Algorithms in Artificial Intelligence

Search algorithms are one of the most


important areas of Artificial Intelligence.
This topic will explain all about the search
algorithms in AI.
Problem-solving agents:

 In Artificial
Intelligence, Search techniques are
universal problem-solving methods.
 Rational agents or Problem-solving agents in
AI mostly used these search strategies or
algorithms to solve a specific problem and
provide the best result.
 Problem-solving agents are the goal-based
agents and use atomic representation.
 In this topic, we will learn various problem-
solving search algorithms
Search Algorithm Terminologies:

 Search

 Search tree
 Actions

 Transition model
 Path Cost
 Solution

 Optimal Solution
Search:
o Searching is a step by step procedure to solve a search-
problem in a given search space. A search problem can
have three main factors:
1. Search Space: Search space represents a set of
possible solutions, which a system may have.
2. Start
State: It is a state from where agent begins the
search.
3. Goal test: It is a function which observe the current
state and returns whether the goal state is achieved or
not.
Search tree

A tree representation of search problem is


called Search tree. The root of the search
tree is the root node which is corresponding
to the initial state.
Actions

Itgives the description of all the available


actions to the agent.
Transition model

A description of what each action do, can


be represented as a transition model.
Path Cost

Itis a function which assigns a numeric


cost to each path.
Solution

Itis an action sequence which leads from


the start node to the goal node.
Optimal Solution

Ifa solution has the lowest cost among all


solutions.
Properties of Search Algorithms:
 Completeness: A search algorithm is said to be
complete if it guarantees to return a solution if at least
any solution exists for any random input.
 Optimality: If a solution found for an algorithm is
guaranteed to be the best solution (lowest path cost)
among all other solutions, then such a solution for is
said to be an optimal solution.
 Time Complexity: Time complexity is a measure of
time for an algorithm to complete its task.
 Space Complexity: It is the maximum storage space
required at any point during the search, as the
complexity of the problem.
Types of search algorithms:
Uninformed Search/ Blind Search
Breadth First Search
Breadth First Search
Uniform Cost Search
Uniform Cost Search-Example
Write a algorithm for uniform cost
search and explain it
Depth First search
Depth First search-Example
Depth-Limited search:
Iterative deepening depth-first search:
Bidirectional Search:

You might also like