# Towards learning domain-independent planning heuristics

arXiv: https://arxiv.org/abs/1707.06895 · HTML: https://mlsanity.com/paper/1707.06895/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 21 Jul 2017.

## Built on by (most cited first, 3 of 3)

- [On Using Admissible Bounds for Learning Forward Search Heuristics](https://mlsanity.com/paper/2308.11905/) (2023)
- [Meta-Reinforcement Learning for Heuristic Planning](https://mlsanity.com/paper/2107.02603/) (2021)
- [Learning Search-Space Specific Heuristics Using Neural Networks](https://mlsanity.com/paper/2306.04019/) (2023)

## Abstract (arXiv)

Automated planning remains one of the most general paradigms in Artificial Intelligence, providing means of solving problems coming from a wide variety of domains. One of the key factors restricting the applicability of planning is its computational complexity resulting from exponentially large search spaces. Heuristic approaches are necessary to solve all but the simplest problems. In this work, we explore the possibility of obtaining domain-independent heuristic functions using machine learning. This is a part of a wider research program whose objective is to improve practical applicability of planning in systems for which the planning domains evolve at run time. The challenge is therefore the learning of (corrections of) domain-independent heuristics that can be reused across different planning domains.