Revision 5 as of 2010-08-02 16:21:17

Clear message

Back to HeuristicSpecification.

LP solver support

Some configurations 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

Build Fast Downward with LP support as follows: 

   1 cd downward/search/lp
   2 ./setup                      # Build the LP solver -- might take a few minutes.
   3 cd ..
   4 make distclean               # Remove traces of previous builds.
   5 make USE_LP_CLP=1            # Build "search" (debug mode) with LP support.
   6 make USE_LP_CLP=1 release    # Build "release-search" (release mode) with LP support.
   7