Heuristics and Symmetries in Classical Planning


  • Alexander Shleyfman Technion – Israel Institute of Technology
  • Michael Katz IBM Haifa Research Lab
  • Malte Helmert University of Basel
  • Silvan Sievers University of Basel
  • Martin Wehrle University of Basel




Classical Planning, Symmetries, Delete-relaxation Heuristics, Critical Path Heuristics, Landmark Heuristics


Heuristic search is a state-of-the-art approach to classical planning. Several heuristic families were developed over the years to automatically estimate goal distance information from problem descriptions. Orthogonally to the development of better heuristics, recent years have seen an increasing interest in symmetry-based state space pruning techniques that aim at reducing the search effort. However, little work has dealt with how the heuristics behave under symmetries. We investigate the symmetry properties of existing heuristics and reveal that many of them are invariant under symmetries.




How to Cite

Shleyfman, A., Katz, M., Helmert, M., Sievers, S., & Wehrle, M. (2015). Heuristics and Symmetries in Classical Planning. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1). https://doi.org/10.1609/aaai.v29i1.9649