A* Search Flashcards
1
Q
What is A* search?
A
Selects path on the frontier with the minimum value of cost(p) + h(p)
2
Q
When is A* admissable?
A
- Finite Branching Factor
- edge costs > 0
- h(n) > 0, and underestimates.
3
Q
What is the monotone restriction?
A
Range of values for heuristics such that multiple path pruning will return the shortest path.
h(m) − h(n) | ≤ cost(m, n)
