Intro
Constrained Path Planning
Breadth-First Search
- Needs a Queue data structure
BFS tracking open and closed
- Set memberships
- Visited but available for further analysis (open/frontier)
- Visited and all analysis complete (closed/explored)
BFS Performance
- Completeness
- Optimality
- Time: O(b^d)