Advanced

Intelligent
Systems
Thomas
Anung Basuki
BestFirstSearch
MemoryBounded

Advanced Intelligent Systems

Third Slide, Part B: Heuristic Search

Heuristics

Thomas Anung Basuki

September 16, 2016

Table of Contents
Advanced
Intelligent
Systems
Thomas
Anung Basuki
BestFirstSearch

1 Best First Search

MemoryBounded
Heuristics

2 Memory-Bounded Heuristic Search

3 Heuristic Functions

Best First Search

Advanced
Intelligent
Systems
Thomas
Anung Basuki
BestFirstSearch
MemoryBounded
Heuristics

Evaluates nodes based on evaluation function f (n)

f (n) is the cost estimation of taking node n
similar to uniform-cost search, except for the use of f (n)
instead of g (n)
includes a heuristic function h(n)
estimates the cost of cheapest path from n to goal state
if n is a goal state then h(n) = 0

Greedy Best First Search

Advanced
Intelligent
Systems
Thomas
Anung Basuki
BestFirstSearch
MemoryBounded
Heuristics

finds the node closest to the goal

f (n) = h(n)
incomplete and not optimal

A Search
Advanced
Intelligent
Systems
Thomas
Anung Basuki

f (n) = g (n) + h(n)

BestFirstSearch
MemoryBounded
Heuristics

f (n) is the estimated cost of the cheapest solution through n

Optimal iff:
h(n) is an admissible heuristic, never overestimates the cost to reach
the goal,
h(n) is a consistent heuristic, which satisfies the triangle inequality:
h(n) c(n, a, n ) + h(n ) for every successor n of n which is
generated by applying action a to n.
Complete iff all step costs exceed some finite and b is finite
Still has problem in memory requirement for keeping all generated nodes

Table of Contents
Advanced
Intelligent
Systems
Thomas
Anung Basuki
BestFirstSearch

1 Best First Search

MemoryBounded
Heuristics

2 Memory-Bounded Heuristic Search

3 Heuristic Functions

IDA (1)
Advanced
Intelligent
Systems
Thomas
Anung Basuki
BestFirstSearch
MemoryBounded
Heuristics

Similar to Iterative Deepening DFS

Instead of using depth, it uses f (n) as cutoff
At each iteration, the minimum f (n) that exceeds the current
cutoff is used as the next cutoff

IDA (2)
Advanced
Intelligent
Systems
Thomas
Anung Basuki
BestFirstSearch
MemoryBounded
Heuristics

Table of Contents
Advanced
Intelligent
Systems
Thomas
Anung Basuki
BestFirstSearch

1 Best First Search

MemoryBounded
Heuristics

2 Memory-Bounded Heuristic Search

3 Heuristic Functions

Heuristic Functions
Advanced
Intelligent
Systems
Thomas
Anung Basuki
BestFirstSearch
MemoryBounded
Heuristics

take a look at some 8-puzzle heuristics

the number of misplaced tiles
the sum of distances of tiles from goal positions (Manhattan
distance)

straight line distance for Romanian touring

to generate an admissible heuristic
solution of relaxed problem
total of solution cost of subproblems (pattern database)
learning from experience (in solving the same problem)