Landmark Heuristics for Lifted Planning - Extended Abstract


  • Julia Wichlacz Saarland University, Saarland Informatics Campus
  • Daniel Höller Saarland University, Saarland Informatics Campus
  • Jörg Hoffmann Saarland University, Saarland Informatics Campus


Problem Solving Using Search, Model-based Search


Planning problems are usually modeled using lifted representations, they specify predicates and action schemas using variables over a finite universe of objects. However, current planning systems like Fast Downward need a grounded (propositional) input model. The process of grounding might result in an exponential blowup of the model size. This limits the application of grounded planning systems in practical applications. Recent work introduced an efficient planning system for lifted heuristic search, but the work on lifted heuristics is still limited. In this extended abstract, we introduce a novel lifted heuristic based on landmarks, which we extract from the lifted problem representation. Preliminary results on a benchmark set specialized to lifted planning show that there are domains where our approach finds enough landmarks to guide the search more effective than the heuristics available.