/aind_classical_planning

My implementation of the AIND classical planning project. The required modifications are included in the "my_planning_graph.py". The comparison results among different algorithms (e.g., depth-first, breadth-first, A*, greedy, uniform-cost) with different heuristics (e.g., unmet goals, max-level, level-sum, set-level) in terms of actions, expansions, time, and optimality is shown in the report.pdf file

Primary LanguagePython

No issues in this repository yet.