PlanForge

PlanForge is a numeric planner. It reads a planning task written in PDDL, grounds it, and searches for a sequential plan.

The task may use numeric fluents. The numbers stay in the task. They are handled by the search and by most of the heuristics rather than compiled away.

PlanForge is written in Rust and is developed by MRlab, the Machine Reasoning Lab at Linköping University. It started as a Rust port of Numeric Fast Downward, which is a fork of Fast Downward. The credits page describes that lineage and the licence terms.

Contact

There is no mailing list. Please use the issue tracker if at all possible, because an answer there stays visible to the next person with the same question.

For anything that does not fit an issue, the contact people are:

• Markus Fritzsche, markus.fritzsche@liu.se, MRlab, Linköping University.
• Martín Pozo, marcosmartin.pozo@uc3m.es, Universidad Carlos III de Madrid.

A bug report is easiest to act on when it includes the domain file, the problem file, the exact --search string and the output.

To be filled

The rest of this page is not written yet. It will cover how the planner is built, how a task is run, and how a search configuration is chosen.