Login / Signup
Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning.
Raz Nissim
Jörg Hoffmann
Malte Helmert
Published in:
IJCAI (2011)
Keyphrases
</>
optimal planning
admissible heuristics
heuristic search
state space search
domain independent
search algorithm
planning problems
pattern databases
optimal plans
heuristic functions
planning domains
heuristic function
evaluation function
state space
constraint networks
general purpose
special case
learning algorithm