ConceptAI & ML
Graph search
A search algorithm modification that prevents expanding the same state more than once by maintaining a closed set.
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.
Graph theory basics1Tree search1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Erik Demaine
The process of exploring a graph to find paths or visit nodes.
Lectures that assume it
8- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Search: Optimal, Branch and Bound, A*
- Dynamic Programming I
- Acrobots, Cart-poles, and Quadrotors I
- Search: Depth-First, Hill Climbing, Beam Search
- Speeding up Dijkstra
- Mixed-discrete (combinatorial) and continuous optimization
- Sampling-based (kinodynamic) motion planning
Connections
16The lectures that define it or assume it, and the concepts next to it.