Skip to content
RobothecaBeta
Log in

POPF

  • Software
  • Middleware
  • Library

POPF is a partial-order planner for PDDL planning problems, from the KCL/Strathclyde planning group, adapted to build with modern compilers.

Source on GitHub: github.com/fmrico/popf (opens in a new tab). Facts read at commit 13cf438 (opens in a new tab).

Licenses

Code
GPL-2.0-only (opens in a new tab)

Read by Robotheca from LICENCE (opens in a new tab) (GPL-2.0-only) at commit 13cf438 (opens in a new tab), on 16 Oct 2026.

Commercial use
Yes

Copyleft: Modified source must be published.

What it does

  • Solves PDDL planning problems given a domain file and a problem file.
  • Uses an enhanced heuristic described in the 2010 ICAPS paper, which can be disabled with an option.
  • Can read an existing solution plan and lift a partial order from it to print the resulting plan.
  • Can print a BibTeX citation reference for use in papers.
  • Includes PDDL parsing and action instantiation code taken from VAL.
  • Built with cmake, the CBC mixed integer programming solver, and perl, bison and flex; a precompiled Linux x86 binary is also offered.

Written by Robotheca from the project's README (opens in a new tab) at commit 13cf438.

Getting started

Difficulty
Advanced

Maintenance

Status
Active: a commit in the last 90 days
Newest commit
11 Oct 2026 on rolling-devel
Latest release
None published on GitHub

Checked on GitHub on 16 Oct 2026.

Links

Robots that can run it

No robot on Robotheca is linked to it yet. Links come from a robot's robot.yaml, from its dependency files read as text, or from Robotheca's editors.

Robotheca lists software as a reference: nothing is hosted or run here, and every fact links to where it was read.