ConceptAI & ML
A* search
A search algorithm that expands the node with the lowest combined value of path cost and heuristic estimate .
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Pieter Abbeel
A* search combines uniform cost search and greedy search by ordering nodes using the sum of path cost and heuristic function, f(n) = g(n) + h(n).Pieter Abbeel & Daniel Klein
A graph traversal and path planning algorithm used to find the lowest cost path across a terrain given a cost function.
Lectures that assume it
1Connections
15The lectures that define it or assume it, and the concepts next to it.
Concepts10
- Cost function
- Dijkstra's algorithm
- Greedy best-first search
- Greedy search
- Heuristic function
- Admissible heuristic