Scribd
Upload
12 views14 pages

Lecture 17,18 AI

Informed search algorithms in AI utilize additional information, such as heuristics, to enhance the efficiency of problem-solving compared to uninformed search methods. Key features include goal-directedness, cost-based evaluations, and a focus on promising paths, with examples like greedy best search and hill climbing. Best First Search combines advantages of depth-first and breadth-first searches by selecting nodes based on evaluation functions that estimate costs to goal states.

Uploaded by

Abdul Rehman
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
12 views14 pages

Lecture 17,18 AI

Informed search algorithms in AI utilize additional information, such as heuristics, to enhance the efficiency of problem-solving compared to uninformed search methods. Key features include goal-directedness, cost-based evaluations, and a focus on promising paths, with examples like greedy best search and hill climbing. Best First Search combines advantages of depth-first and breadth-first searches by selecting nodes based on evaluation functions that estimate costs to goal states.

Uploaded by

Abdul Rehman
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/ 14

Artificial

Intelligenc
e
Lecture 17,18
Informed search
By. Engr Noor Ul Ain
Mushtaq
Department of computer
system engineering
MUET Jamshoro
OUTLINE Informed search

Heuristics

Best First search


Informed Search

– Informed search in AI is a type of search algorithm that uses


additional information to guide the search process, allowing
for more efficient problem-solving compared to uninformed
search algorithms. This information can be in the form of
heuristics, estimates of cost, or other relevant data to
prioritize which states to expand and explore.
Key Features
– Use of Heuristics – informed search algorithms use heuristics, or
additional information, to guide the search process and prioritize
which nodes to expand.
– More efficient – informed search algorithms are designed to be
more efficient than uninformed search algorithms, such as breadth-
first search or depth-first search, by avoiding the exploration of
unlikely paths and focusing on more promising ones.
– Goal-directed – informed search algorithms are goal-directed,
meaning that they are designed to find a solution to a specific
problem
– Cost-based – informed search algorithms often use cost-based
estimates to evaluate nodes, such as the estimated cost to reach
the goal or the cost of a particular path.
Parameters
Parameters Informed Search
Known as It is also known as Heuristic Search
Performance It finds a solution more quickly.
Cost Factor Cost is low.
Efficiency It is more efficient as efficiency takes into account cost and
performance. The incurred cost is less and speed of finding
solutions is quick.

Example Algorithms Greedy best search


Hill climbing algorithm
Heuristics

Heuristic means:
– To discover
– Helping to discover or learn
– Serving to discover
– An aid to discover
– Heuristics are "rules of thumb", educated guesses, intuitive
judgments or simply common sense.
– A heuristic contributes to the reduction of search in a problem-
solving activity.
Heuristics
"Educated guess" is a heuristic that allows
a person to reach a conclusion without
exhaustive research.

With an educated guess a person


considers what they have observed in the
past, and applies that history to a
situation where a more definite answer
has not yet been decided.
Heuristic Search

– Uses domain-dependent (heuristic) information in order to search


the space more efficiently.
– Ways of using heuristic information:
– Deciding which node to expand next, instead of doing the
expansion in a strictly breadth-first or depth-first order.
– In the course of expanding a node, deciding which successor or
successors to generate, instead of blindly generating all possible
successors at one time.
– Deciding that certain nodes should be discarded, or pruned, from
the search space.
Heuristic A moment's reflection will show
ourselves constantly using
Search heuristics in the course of our
everyday lives.

If the sky is grey we conclude


that it would be better to put on a
coat before going out.

We book our holidays in August


because that is when the weather
is best.
Heuristic
Function
– A heuristic function, h(n),
provides an estimate of the cost
of the path from a given node to
the closest goal state.

– Must be zero if node represents a


goal state.
Best First Search

Depth first search is good because it allows a


solution to be found without all competing
branches to be expanded.
Breadth first search is good because it does not
get trapped on dead-end paths.
Best First Search combines the advantages of the
two.
This is done by applying an appropriate heuristic
function to each of them.
Best First – An algorithm in which a node is
selected for expansion based on an
Search evaluation function f(n).

– Traditionally the node with the lowest


evaluation function is selected

– Not an accurate name...expanding the


best node first would be a straight
march to the goal.

– Choose the node that appears to be


the best
Best First
Search
– There is a whole family of Best-First
Search algorithms with different
evaluation functions.

– Each has a heuristic function h(n).

– h(n) = estimated cost of the cheapest


path from node n to a goal node.

– Example: In route planning the


estimate of the cost of the cheapest
path might be the straight line
distance between two cities.
Best first Search

– g(n) = Cost from the initial state to the current state


n.

– h(n) = Estimated cost of the cheapest path from node


n to a goal node.

– f(n) = Evaluation function to select a node for


expansion (usually the lowest cost node).

You might also like