My PDDL page
Here are some of my first PDDL (Planning Domain Definition Language) encodings.
For more information about PDDL:
My favorite planners are:
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
- 1d-rubiks-cube2-domain.pddl: 1d Rubik's cube, alternative version (simpler but slightly slower).
- m12-domain.pddl: M12 problem
- 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.
- painting-domain.pddl: Painting problem ("Automated planning", page 105f)
- rotation-domain.pddl: Rotation permutation puzzle
- shortest_path-domain.pddl: Shortest path problem (from Graphplan)
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)
- 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)
Back to my homepage
Created by Hakan Kjellerstrand email@example.com