laas / fape
FAPE (Flexible Acting and Planning Environment) is a constraint-based planner for the ANML language.
☆31Updated 3 years ago
Alternatives and similar repositories for fape
Users that are interested in fape are comparing it to the libraries listed below
Sorting:
- PDDL+ planning through compilation to SMT☆46Updated 2 years ago
- Lab is a framework for evaluating planners and other solvers.☆34Updated this week
- Toolbox for automated planning and combinatorial solving.☆50Updated this week
- The parser of the pandaPI planning system☆15Updated 11 months ago
- An algorithm for parsing any planning problem in PDDL format☆14Updated 8 years ago
- ☆30Updated last year
- Classical and FOND Planning for Pure-Past Linear Temporal Logic Goals☆18Updated 8 months ago
- Algorithms for solving temporal planning problems☆28Updated 2 years ago
- General library for setting up linux-based environments for developing, running, and evaluating planners.☆119Updated 4 months ago
- Translating HTN planning problems to PDDL☆20Updated 3 years ago
- Project for converting multi-agent epistemic planning problems to automated planning problems. Also includes utilities for dealing with P…☆22Updated 5 months ago
- PLanning and Acting with TImeliNes under Uncertainty☆17Updated 4 months ago
- By the community, for everyone. Planning.wiki is the online guide to AI Planning☆81Updated 2 years ago
- A lightweight framework for the efficient parsing and manipulation of PDDL in lifted form.☆16Updated 10 months ago
- Tarski - An AI Planning Modeling Framework☆65Updated last year
- STRIPS benchmarks for classical planning☆13Updated 3 years ago
- An algorithm for parsing any planning problem in PDDL format☆21Updated 2 years ago
- ☆17Updated last year
- probabilistic planning system for tasks encoded in RDDL☆45Updated 2 years ago
- PDDL exercises and coursework assignments.☆49Updated last month
- LAPKT public repository☆40Updated last month
- Automatically exported from code.google.com/p/rddlsim☆54Updated last year
- Domain and problem PDDL parser in C/C++ using Flex & Bison.☆16Updated 5 years ago
- FOND solver based on SAT☆14Updated 2 years ago
- Multiagent Distributed and Local Asynchronous Planner. A deterministic domain-independent multi-agent planner based on the MA-STRIPS form…☆12Updated 7 years ago
- Symk is a state-of-the-art classical optimal and top-k planner.☆40Updated last month
- A python framework for Optimal Planning Modulo Theories☆11Updated last year
- Lifted Logic for Task Networks: SAT-driven Planning for Totally-ordered Hierarchical Task Networks (HTN)☆31Updated last year
- ForbidIterative planners for top-k, top-quality, and diverse planning problems☆19Updated last week
- The hierarchical planner CHIMP (Conflict-driven Hierarchical Meta-CSP Planner).☆17Updated last year