BFGP++ Unified Planning interface
This asset provides the interfacing between the BFGP++ generalized planner and the Unified Planning framework developed by the AIPlan4EU project.
This asset comprises the code to interface the BFGP++ few-shot engine with the Unified Planning library developed under the AIPlan4EU project.
BFGP++ is a few-shot engine or generalized planner, that is a tool for computing algorithm-like solutions that are syntactically terminating to a set of planning problems in a given domain. For example, when multiple planning instances are easily solvable by following a particular strategy, BFGP++ could directly synthesize that strategy from those instances, their shared domain and a target language in which the solution is expressed.
BFGP++ is a generalized planner that runs a Best-First search algorithm in the space of valid programs (i.e. general solutions) based on several evaluation or heuristic functions, and target languages (i.e. assembler or C++). The focus is to support STRIPS, negative preconditions and basic integer operations (e.g. conditionals, increases or decreases) features in input problems, as well as synthesizing, validating and repairing programs in different target languages. This is now accessible through the UP library.
- FewshotPlanner
Installation
Follow the instructions in the interface project README for installing the asset.
Try it yourself!
A live demo showcasing the usage is available here.
See also
- Unified Planning
-
Javier Segovia-Aguas, Sergio Jiménez Celorrio, & Anders Jonsson, A (2021). Generalized planning as heuristic search, ICAPS 2021.