My PDDL page

Here are some of my first PDDL (Planning Domain Definition Language) encodings.

For more information about PDDL:

PDDL - The Planning Domain Definition Language - version 1.2 (produced by the AIPS-98 Planning Competition Committee)
Drew V. McDermott
Patrik Haslum: Writing Planning Domains and Problems in PDDL

My favorite planners are:

Jörg Hoffmann's Fast-Forward (ff) and it's cousins, especially Metric-FF since it has an option to optimize the plan length (-O). Hoffman has written a lot of interesting papers about FF, PPDL, and planning in general (e.g. Everything you Always Wanted to Know About Planning (But Were Afraid to Ask)).
Fast-Downward
Robert Sakak's SICtus Prolog based Prolog-Planning-Library (on GitHub). It solves some of the M12 problem in no-time (whereas Fast-Forward eats all my RAM).

PDDL models

Here are some of my PDDL models. For more information about the problems, see the domain files.

1d-rubiks-cube-domain.pddl: 1d Rubik's cube
Problem files:
1d-rubiks-cube2-domain.pddl: 1d Rubik's cube, alternative version (simpler but slightly slower).
Problem files:
m12-domain.pddl: M12 problem
Problem files:
monkey-domain.pddl: Monkey and bananas problem (from Graphplan). monkey-domain2.pddl has the extra action (step-down ?x) which makes monkey-prob03.pddl solvable.
Problem files:
- monkey-prob01.pddl
- monkey-prob02.pddl
- monkey-prob03.pddl (unsolvable with monkey-domain.pddl, solvable with monkey-domain2.pddl which has the action (step-down ?x))
painting-domain.pddl: Painting problem ("Automated planning", page 105f)
Problem files:
- painting-prob01.pddl
rotation-domain.pddl: Rotation permutation puzzle
Problem files:
shortest_path-domain.pddl: Shortest path problem (from Graphplan)
Problem files:
- shortest_path-prob01.pddl
tsp-domain.pddl: (Simplified) Traveling salesperson problem (from Graphplan). Note: Here we just handle the connections, not minimizing the distances. (tsp-domain2.pddl allows that the same node is visited more than once)
Problem files:
- tsp-prob01.pddl (from Graphplan tsp_fact)
- tsp-prob02.pddl (from Graphplan tsp_complete_facts.htm)
- tsp-prob03.pddl Peterson graph (from Graphplan tsp_peterson_facts.htm). Note: it is not solved with tsp-domain.pddl, use tsp-domain2.pddl to see some path.
- tsp-prob04.pddl (ulysses16)
- tsp-prob_rand_100.pddl (random problem: 100 nodes, 3487 connections, 164kB), generated by make_tsp.pl (Perl program)
- tsp-prob_rand_200.pddl (random problem: 200 nodes, 3875 connections, 190kB), generated by make_tsp.pl (Perl program)
- tsp-prob_rand_300.pddl (random problem: 300 nodes, 4442 connections, 221kB), generated by make_tsp.pl (Perl program)
washing-domain.pddl: Washing problem ("Automated planning", page 107)
Problem files:
- washing-prob01.pddl

Back to my homepage
Created by Hakan Kjellerstrand hakank@bonetmail.com