Skip to Main content Skip to Navigation
New interface
Conference papers

Problem splitting using heuristic search in landmark orderings

Abstract : In this paper, we revisit the idea of splitting a planning problem into subproblems hopefully easier to solve with the help of landmark analysis. While this technique initially proposed in the first approaches related to landmarks has been outperformed by landmark-based heuristics, we believe that it is still a promising research direction. To this end, we propose a new method for problem splitting based on landmarks which has two advantages over the original technique: it is complete (if a solution exists, the algorithm finds it), and it uses the precedence relation over the landmarks in a more flexible way. We lay in this paper the foundations of a meta best-first search algorithm, which explores the landmark orderings to create subproblems and can use any embedded planner to solve subproblems. It opens up avenues for future research: among them are new heuristics for guiding the meta search towards the most promising orderings, different policies for generating subproblems, and influence of the embedded subplanner.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Alain Broc Connect in order to contact the contributor
Submitted on : Friday, June 6, 2014 - 4:44:49 PM
Last modification on : Tuesday, March 16, 2021 - 3:44:16 PM
Long-term archiving on: : Saturday, September 6, 2014 - 10:58:15 AM


Publisher files allowed on an open archive


  • HAL Id : hal-01002115, version 1



S. Vernhes, G. Infantes, V. Vidal. Problem splitting using heuristic search in landmark orderings. Twenty-Third International Joint Conference on Artificial Intelligence, Aug 2013, Beijing, China. pp.2401-2407. ⟨hal-01002115⟩



Record views


Files downloads