Revision 9 as of 2010-09-24 18:31:04

Clear message

Back to HeuristicSpecification.

LP solver support

Some configurations of the search component of Fast Downward, such as optimal cost partitioning for landmark heuristics, require an Linear Programming (LP) solver and will complain if the planner has not been built with support for such a solver.

Fast Downward uses the COIN-OR LP Solver (CLP) with the Open Solver Interface.

Instructions for building Fast Downward with LP support

To enable LP support in Fast Downward, change the line

USE_LP=0

in the Makefile to

USE_LP=1

and run

make clean
make

The make invocation will take a long time because it first builds the LP library, which is rather big. This is a one-time operation: once the library has been built, it will not be deleted, not even by make clean or make distclean. If for some reason you absolutely want to delete it, run rm -r lp/coin and it will be rebuilt on the next compile with USE_LP=1.

If LP setup fails

The LP solver has a number of dependencies which might not be installed on your system. If for some reason the LP setup step fails, we'd appreciate if you attempt to troubleshoot it yourself. Check the contents of the setup script in the lp directory to see what it does, try to run the various steps manually, have a look at the errors generated, and consult the Osi documentation.

If after troubleshooting you can get the LP package to work, do let us know of your problem and its solution so that we can improve these instructions. If you still cannot get it to work, we may be able to provide some help, but note that the LP solver is an external package not developed by us.