ADL Compiler to SIMPLE-ADL and STRIPS

We used automated software (basically, FF's preprocessor) to compile ADL into STRIPS. You can download executables of the compilation software (Unix adl2strips-unix, Linux adl2strips-linux, Linux statically compiled adl2strips-linux-static). Run without arguments to obtain the command line usage; contact us with questions.

Syntax checker and Plan Validator for PDDL 2.2

The following resources are available in this archive:

A syntax checker, (thanks to Stephen Cresswell), generating parse trees for legal PDDL2.1 syntax, using flex++, bison, C++ and an appropriate STL implementation. The tool compiles using Gnu software.
A plan validator for PDDL2.2. It is written in C++ and can be used to check syntax, types and plan validity. There is a README file in the archive that explains how to use it.

Please contact Derek Long if there are any problems in using it, compiling it or if you find any bugs.

Plan Visualization

VEGA/VEPA illustrates plans in form of a GANNT chart. IPC-4 Plans in VEGA are available at the results page. You need an installed JRE (Java Runtime Environment). Include java-bin directory into your PATH variable. For starting the Vega client, change to Vega directory, type "java -classpath Vega.jar Vega". For loading a scene: open File menu, click on "Load scene...", and select the desired .scene file from a subdirectory RESULTS. Note, that you can store the scenes in either xfig or gif format. Please contact Stefan Edelkamp if you have questions about the tool.

Grounding Tool for PDDL 2.2

"Ground" is a (prototypical) program that instantiates PDDL2.2 planning domains, based on the precompiler of the MIPS system. The tool instantiates all parameters of predicates, functions and actions. The system is capable of handling numbers, durations, timed initial literals, and derived predicates and a range of ADL constructs. It reads and parses the problem and domain files, performs the instantiation process, and writes the result back into two main PDDL files for the domain and problem descriptions. The tool applies static analysis techniques to remove constant predicates and fluent, and simplifies numeric conditions and effects. As a surplus it writes multivariate variable information and detected symmetries into an additional file.

Two directories containing the above Blocksworld (with derived ``above'' predicate) and Zenotravel (with station opening times as timed initial literals) examples are provided, both in the original and in the grounded versions. Please contact Stefan Edelkamp if you have questions about the tool.

Competing Systems

After the competition event itself, in order to promote the understandability of the event, it would be desirable to have the competitors provide publicly accessible executables of their planners. Indeed, we hope that most of the competitors will make the source code of their systems available. We will insert the sytems for download on this page, as they are made available.