Decoupled Abstraction Heuristics
||Decoupled Abstraction Heuristics|
||SNIC Small Compute|
||Daniel Gnad <email@example.com>|
||2022-10-26 – 2023-11-01|
This work is in the context of classical planning as heuristic search, where a state space is systematically explored to find a sequence of actions that lead from the initial state to a state that satisfies the goal condition. More concretely, in this project we investigate abstraction heuristics for decoupled state-space search. The goal is to derive new methods for abstraction heuristics for decoupled search and evaluate them empirically, comparing to existing approaches.