Back to HomePage.
Before running Fast Downward, you must build it using the build.py script.
To run Fast Downward, use the fast-downward.py driver script. At minimum, you need to specify the PDDL input files and search options. The driver script has many options to do things like running portfolios, running only the translation component of the planner, using a non-standard build, running a plan validator and various other things. To see the complete list of options, run
If you want to run any of the planners based on Fast Downward that participated in IPC 2011, please also check IpcPlanners.
Different builds of Fast Downward (e.g. release vs. debug) are placed in different directories by the build script. Hence, several builds can coexist and fast-downward.py must be told which build to use. By default, the release build is used, which is also the default build produced by build.py. To use a different build, pass --build=<name> to the driver script. The parameter --debug is an alias for --build=debug --validate.
Note on IDE projects (Visual Studio, XCode): You can use the CMake build system to generate a project for you favourite IDE. These projects are what CMake calls "multi-config generators", i.e., they are created without fixing the build configuration. At build time, the IDE decides whether to do a debug or release build and creates subdirectories in the output folder. Use the full path to the binaries as the value of --build (e.g., --build=path/to/visual/studio/project/bin/Debug/).
The driver exits with 0 if no errors are encountered. Otherwise, it returns the exit code of the first component that failed. The exit codes are documented at ExitCodes.
Lazy greedy best-first search with preferred operators and the queue alternation method
1 ## using FF heuristic and context-enhanced additive heuristic (previously: "fFyY") 2 ./fast-downward.py domain.pddl task.pddl \ 3 --evaluator "hff=ff()" --evaluator "hcea=cea()" \ 4 --search "lazy_greedy([hff, hcea], preferred=[hff, hcea])" \ 5 6 7 ## using FF heuristic (previously: "fF") 8 ./fast-downward.py domain.pddl task.pddl \ 9 --evaluator "hff=ff()" \ 10 --search "lazy_greedy([hff], preferred=[hff])" \ 11 12 13 ## using context-enhanced additive heuristic (previously: "yY") 14 ./fast-downward.py domain.pddl task.pddl \ 15 --evaluator "hcea=cea()" \ 16 --search "lazy_greedy([hcea], preferred=[hcea])" \ 17
./fast-downward.py --alias seq-sat-lama-2011 domain.pddl task.pddl
runs the "LAMA 2011 configuration" of the planner. (Note that this is not really the same as "LAMA 2011" as it participated at IPC 2011 because there have been bug fixes and other changes to the planner since 2011. See IpcPlanners for more information.) To find out which actual search options the LAMA 2011 configuration corresponds to, check the source code of the src/driver/aliases.py module.
Older planner versions built the planner in 32-bit mode by default because of lower memory consumption. As part of the meta issue issue213 we decreased the memory consumption of 64-bit builds to the point where there should be no difference between 32- and 64-bit builds for most configurations. Therefore, we use the native bitwidth of the operating system since January 2019.
Please get in touch! See the HomePage for various contact options.