Scribd
Upload
17 views24 pages

Informed Search Strategies: J. Felicia Lilian

The document discusses various informed search strategies including greedy best-first search, A* search, and other heuristic search algorithms. It explains that heuristic search uses heuristic functions to estimate the cost to reach the goal and guide the search towards optimal solutions more efficiently. The key conditions for heuristic functions to guarantee optimal solutions are admissibility and consistency. Memory-bounded variations of A* like iterative deepening A* and recursive best-first search are also summarized to reduce memory usage.

Uploaded by

Abhinav Panchumarthi
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
17 views24 pages

Informed Search Strategies: J. Felicia Lilian

The document discusses various informed search strategies including greedy best-first search, A* search, and other heuristic search algorithms. It explains that heuristic search uses heuristic functions to estimate the cost to reach the goal and guide the search towards optimal solutions more efficiently. The key conditions for heuristic functions to guarantee optimal solutions are admissibility and consistency. Memory-bounded variations of A* like iterative deepening A* and recursive best-first search are also summarized to reduce memory usage.

Uploaded by

Abhinav Panchumarthi
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

Informed Search Strategies

J. Felicia Lilian
(Based on Slides by Mausam
Stuart Russell, Peter Norvig, NPTEL)
Heuristic Search Strategy
• Can find solutions more efficiently
GREEDY BEST FIRST SEARCH
- Node selection based on evaluation function, f(n) –
cost – lowest is expanded first
- Heuristic function, h(n)
h(n) = estimated cost of the cheapest path from the state at node n to a goal state

• Heuristic functions are the most common form in


which additional knowledge of the problem is
imparted to the search algorithm.
GREEDY BEST FIRST SEARCH
GREEDY BEST FIRST SEARCH
Generic Tree Search
Generic Graph Search
A* Search
Conditions for Optimality
Admissible and Consistency
• The first condition we require for optimality is that h(n)
be an admissible heuristic.
• An admissible heuristic is one that never overestimates
the cost to reach the goal.
• Because g(n) is the actual cost to reach n along the
current path, and f(n)=g(n) + h(n), we have as an
immediate consequence that f(n) never overestimates
the true cost of a solution along the current path
through n.
Admissible Heuristics
• Straight-line distance is admissible because
the shortest path between any two points is a
straight line, so the straight line cannot be an
overestimate.
Consistent Heuristics
• A slightly stronger condition called consistency (or
sometimes monotonicity) is required only for
applications of to graph search.
• A heuristic h(n) is consistent if, for every node n
and every successor of n generated by any action
a, the estimated cost of reaching the goal from n
is no greater than the step cost of getting to plus
the estimated cost of reaching the goal from
h(n) ≤ c(n, a, ) + h()
Every consistent heuristic is also admissible.

Consistency is therefore a stricter requirement


than admissibility
Optimality of A*
the tree-search version of A* is optimal if h(n)
is admissible, while the graph-search version is
optimal if h(n) is consistent

The simplest way to reduce memory


requirements for A∗ is to adapt the idea of
iterative deepening to the heuristic search
context, resulting in the iterative-deepening A*
(IDA*) algorithm.
A* - Problem
• Given an initial state of a 8-puzzle problem and final
state to be reached

• Find the most cost-effective path to reach the final


state from initial state using A* Algorithm.
• Consider g(n) = Depth of node (Iteration) and
h(n) = Number of misplaced tiles.
AO* Algorithm
• It uses a Single GRAPH Structure and follows divide
and conquer strategy.
• Each of this sub-problem can then be solved to get
its sub solution. These sub solutions can then
recombined to get a solution as a whole. That is
called is Problem Reduction. AND-OR graphs or AND
- OR trees are used for representing the solution.
Memory-bounded heuristic search
• Recursive best-first search (RBFS) is a simple
recursive algorithm that attempts to mimic the
operation of standard best-first search, but
using only linear space
• Uses a f-limit variable
SMA*
• SMA* proceeds just like A*, expanding the
best leaf until memory is full.
• At this point, it cannot add a new node to the
search tree without dropping an old one.
• SMA* always drops the worst leaf node—the
one with the highest f-value

You might also like