domschrei / lilotane
Lifted Logic for Task Networks: SAT-driven Planning for Totally-ordered Hierarchical Task Networks (HTN)
☆31Updated last year
Alternatives and similar repositories for lilotane:
Users that are interested in lilotane are comparing it to the libraries listed below
- The parser of the pandaPI planning system☆15Updated 9 months ago
- FAPE (Flexible Acting and Planning Environment) is a constraint-based planner for the ANML language.☆31Updated 3 years ago
- ☆17Updated 10 months ago
- STRIPS benchmarks for classical planning☆13Updated 2 years ago
- HTN planning in Ruby☆35Updated last month
- ☆30Updated last year
- Total-order Forward Decomposition Algorithm: HTN Planning☆14Updated 3 years ago
- Symk is a state-of-the-art classical optimal and top-k planner.☆36Updated this week
- Lab is a framework for evaluating planners and other solvers.☆33Updated this week
- PDDL exercises and coursework assignments.☆46Updated 3 months ago
- Translating HTN planning problems to PDDL☆19Updated 3 years ago
- FOND solver based on SAT☆14Updated 2 years ago
- Qualitative Numeric Planning☆10Updated 4 years ago
- Learning Domain-Independent Planning Heuristics over Hypergraphs (ICAPS'20)☆13Updated this week
- A free and open guide to Planning Domain Definition Language to help you get started☆18Updated 2 years ago
- An algorithm for parsing any planning problem in PDDL format☆20Updated 2 years ago
- General library for setting up linux-based environments for developing, running, and evaluating planners.☆114Updated 2 months ago
- AI planners written in Python