> I'd be interested in seeing if we see a positive effect in the citycar domain
> in the planner, so I'll run some informal experiments there and then write
> again.
I tried the following command before and after this change:
$ ./fast-downward.py --validate
~/downward/benchmarks/citycar-sat14-adl/p4-3-3-0-1.pddl --evaluator "h=cg()"
--search "lazy_greedy([h],preferred=[h])"
(The CG heuristic is one of the ones that is quite sensitive to a good encoding.)
With the new code, this is solved in 10 seconds (not counting translator time).
With the old code, this runs out of 32-bit address space after around 4:20
minutes on my machine, so it is not solved.
I did similar, less complete, tests for the five p3-*... instances of
citycar-sat14-adl. The new code solves all of them more or less instantaneously.
The old code takes a substantial amount of time or fails to solve them altogether.
So this looks not just like a good bugfix, but also like a performance
improvement at least in this domain. In any case, it's ready to merge.
|