Efficiently Computing Transitions in Cartesian Abstractions
Keywords: Classical Planning, Heuristic Search, Abstraction Heuristics
TL;DR: By computing transitions in Cartesian abstractions on demand, we can trade a bit of speed for much lower memory usage.
Abstract: Counterexample-guided Cartesian abstraction refinement yields strong heuristics for optimal classical planning. The approach iteratively finds a new abstract solution, checks where it fails for the original task and refines the abstraction to avoid the same failure in subsequent iterations. The main bottleneck of this refinement loop is the memory needed for storing all abstract transitions. To address this issue, we introduce an algorithm that efficiently computes abstract transitions on demand. This drastically reduces the memory consumption and allows us to solve tasks during the refinement loop and during the search that were previously out of reach.
Category: Short
Student: No
Submission Number: 158
Loading