Heuristics Flashcards

1
Q

Why is consistency necessary?

A

To prove the f(n) never decreased because of shortcuts

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How to fix generic search to handle shortcuts?

A
  • use backpointers to update parent in case of shortcut
  • recompute g and resort open by tracing back new path
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Effective Branching Factor

A

How much the algorithm branches on way to find goal. Way of characterizing how helpful a heuristic is.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Problem Relaxation

A

Adding more edges/paths to a problem as to have fewer constraints.
Relaxed problem has same state space just with additional costs, so relaxed solution cost is guaranteed to be an admissible heuristic for original problem.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Composite Heuristics

A

Combination of set of admissible, consistent heuristics that are non-dominated

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Disjoint Pattern Databased

A

Splitting problem into disjoint subproblems and adding together their cost

How well did you know this?
1
Not at all
2
3
4
5
Perfectly