This is part of meta issue567.
This issue will address item
M. heuristic representation:
- The class that is currently called HeuristicRepresentation doesn't
represent the heuristic. It represents the abstraction. Suggestion:
rename it to MergeAndShrinkRepresentation, which is the name we use
in our ICAPS 2015 paper.
- We currently have a two-stage heuristic lookup process: map the
concrete state to an abstract state, then map the abstract state to
a cost value. The second step is unnecessary since we might as well
write the cost value directly into the table of the MSR's root node
(both costs and abstract states are represented by the same type).
of issue567. Furthermore, I'd like to simplify the way in which the
merge-and-shrink main loop in the end "finalizes" its computation depending on
whether the abstraction is already unsolvable in the initial state or not. In
particular, writing costs directly into the MergeAndShrinkRepresentation, we do
not need to keep the FactoredTransitionSystenm in the end, but only the
representation (because we do not need to keep the representation and distances
anymore).
|