Scribd
Upload
53 views24 pages

Search With C Sts and Heuristic Search

This document discusses various search algorithms including uninformed and heuristic search. It covers depth-first search, breadth-first search, least-cost-first search, and best-first search. It defines key properties like completeness, optimality, and time/space complexity for each algorithm. Examples are provided to illustrate how heuristic functions can guide best-first search to be more informed than uninformed searches.

Uploaded by

Naveen Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
53 views24 pages

Search With C Sts and Heuristic Search

This document discusses various search algorithms including uninformed and heuristic search. It covers depth-first search, breadth-first search, least-cost-first search, and best-first search. It defines key properties like completeness, optimality, and time/space complexity for each algorithm. Examples are provided to illustrate how heuristic functions can guide best-first search to be more informed than uninformed searches.

Uploaded by

Naveen Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 24

Search with Costs and Heuristic Search

CPSC 322 Search 3 January 17, 2011

Textbook 3.5.3, 3.6.1 Taught by: Mike Chiang


1

Todays Lecture
Recap from last lecture, combined with AIspace demo Search with costs: Least Cost First Search

Heuristic Search: Best First Search

Learning Goals from last class


Apply basic properties of search algorithms:
- completeness - optimality - time and space complexity of search algorithms

Select the most appropriate search algorithms for specific problems.


Depth-First Search vs. Breadth-First Search

DFS and BFS

Depth-First Search, DFS

Breadth-First Search, BFS

Lets look at these algorithms in action:

Comparing Searching Algorithms:


Will it find a solution? The best one?
Def. : A search algorithm is complete if whenever there is at least one solution, the algorithm is guaranteed to find it within a finite amount of time.
BFS is complete, DFS is not Def.: A search algorithm is optimal if when it finds a solution, it is the best one

BFS is optimal, DFS is not


5

Comparing Searching Algorithms: Complexity


Def.: The time complexity of a search algorithm is the worst-case amount of time it will take to run, expressed in terms of - maximum path length m - maximum forward branching factor b. Both BFS and DFS take time O(bm) in the worst case Def.: The space complexity of a search algorithm is the worst-case amount of memory that the algorithm will use (i.e., the maxmial number of nodes on the frontier). BFS:
DFS:

O(bm)
O(bm)

O(mb)
O(mb)

O(bm) O(bm)

O(b+m)
O(b+m)
6

Todays Lecture
Recap from last lecture, combined with AIspace demo Search with costs: Least Cost First Search

Heuristic Search: Best First Search

Example: edge costs in the delivery robot domain

Search with Costs


Sometimes there are costs associated with arcs.
Def.: The cost of a path is the sum of the costs of its arcs
cost n0 , , nk cost( ni 1 , ni )
k i 1

In this setting we often don't just want to find any solution


we usually want to find the solution that minimizes cost

Def.: A search algorithm is optimal if when it finds a solution, it is the best one

Search with Costs


Sometimes there are costs associated with arcs.
Def.: The cost of a path is the sum of the costs of its arcs
cost n0 , , nk cost( ni 1 , ni )
k i 1

In this setting we often don't just want to find any solution


we usually want to find the solution that minimizes cost

Def.: A search algorithm is optimal if when it finds a solution, it is the best one: it has the lowest path cost
10

Lowest-Cost-First Search (LCFS)


Lowest-cost-first search finds the path with the lowest cost to a goal node At each stage, it selects the path with the lowest cost on the frontier.

The frontier is implemented as a priority queue ordered by path cost. Lets look at this in action:

11

When arc costs are equal, LCFS is equivalent to

DFS
BFS IDS None of the above

12

Analysis of Lowest-Cost First Search


Is LCFS complete? - Not in general: a cycle with zero cost, or negative arc costs could be
followed forever - Yes, as long as arc costs are strictly positive

Is LCFS optimal? YES NO IT DEPENDS

- Not in general: arc costs could be negative: a path that initially looks
high-cost could end up getting a ``refund''. - Yes, as long as arc costs are guaranteed to be non-negative.

13

Analysis of Lowest-Cost First Search


What is the time complexity of LCFS if the maximum path length is m and the maximum branching factor is b?

O(bm)

O(mb)

O(bm)

O(b+m)

- Knowing costs doesn't help here; worst case: all nodes

What is the space complexity?

O(bm)

O(mb)

O(bm)

O(b+m)

E.g. uniform cost: just like BFS, in worst case frontier has to store all nodes m-1 steps from the start node
14

Uninformed Search: DFS, BFS, LCFS


Why are all these strategies called uninformed?
Because they do not consider any information about the states and the goals to decide which path to expand first on the frontier They are blind to the goal

In other words, they are general and do not take into account the specific nature of the problem.

15

Todays Lecture
Recap from last lecture, combined with AIspace demo Search with costs: Least Cost First Search

Heuristic Search: Best First Search

16

Heuristic Search
Blind search algorithms do not take into account the goal until they are at a goal node.
Often there is extra knowledge that can be used to guide the search:
an estimate of the distance from node n to a goal node.

This estimate is called search heuristic

17

More formally
Def.: A search heuristic h(n) is an estimate of the cost of the optimal (cheapest) path from node n to a goal node.

Estimate: h(n1) n1

n2
n3

Estimate: h(n2)

Estimate: h(n3)
18

Example: finding routes


What could we use as h(n)?

19

Example: finding routes


What could we use as h(n)? E.g., the straight-line (Euclidian) distance between source and goal node

20

Best First Search (BestFS)


Idea: always choose the path on the frontier with the smallest h value. BestFS treats the frontier as a priority queue ordered by h. Greedy approach: expand path whose last node seems closest to the goal

Lets look at this in action:

Optimal? AISPACE example, load from URL


http://www.cs.ubc.ca/~hutter/teaching/cpsc322/ex-best-first-search.txt

21

Best-first Search: Illustrative Graph


A B

A low heuristic value can mean that a cycle gets followed forever -> not complete

22

Analysis of BestFS
Complete? No, see the example last slide

Optimal? No, see the AIspace example from above:


http://www.cs.ubc.ca/~hutter/teaching/cpsc322/ex-best-first-search.txt

Time Complexity O(bm)

O(mb)

O(bm)

O(b+m)

- Worst case: has to explore all nodes Space Complexity O(bm)

O(mb)

O(bm)

O(b+m)

- Heuristic could be such to emulate BFS: E.g. h(n) = (m distance of n from start)

23

Learning Goals for todays class


Select the most appropriate algorithms for specific problems. Depth-First Search vs. Breadth-First Search vs. Least-Cost-First Search vs. Best-First Search Define/read/write/trace/debug different search algorithms Construct heuristic functions for specific search problems (just started, more on this next time)

24

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy