• Corpus ID: 5526093

Problem Splitting Using Heuristic Search in Landmark Orderings

@inproceedings{Vernhes2013ProblemSU,
  title={Problem Splitting Using Heuristic Search in Landmark Orderings},
  author={Simon Vernhes and Guillaume Infantes and Vincent Vidal},
  booktitle={International Joint Conference on Artificial Intelligence},
  year={2013}
}
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… 
View Paper
hal-onera.archives-ouvertes.fr
11 Citations
Background Citations
2
Methods Citations
2

Figures and Tables from this paper

11 Citations

On the Use of Landmarks in LPG

This work proposes the use of Landmarks for the LPG planner, considering different design choices and analysing empirically its impact on the performance of the planner, finding results comparable with the state-of-the-art planner LAMA.

A new goal ordering for incremental planning

The experimental results obtained by using almost all propositional STRIPS benchmarks from the international planning competitions show that the proposed goal ordering can significantly improve the planning performance compared with the state-of-the-art satisficing planning system.

Planning with preferences, specification and search

An adaptation to the greedy best-first search algorithm, Cascading Search, is presented that diversifies the search space and how effectively it speeds the search process and ensure discovery of quality plans is examined.

Scalable and optimal planning based on Pregel

This work proposed an optimal Planning method based on the Pregel, called the PbP, which is more scalable and faster than state‐of‐the‐art optimal planners, and shows the feasibility.

A quality and distance guided hybrid algorithm for the vertex separator problem

Landmark-Biased Random Walk for Deterministic Planning

A landmark-biased random walk planning method, where landmark is used to bias the random action selection by giving high probability to those actions that might achieve more landmarks, which improves the runtime effectively and usually obtains the first plan with better quality.

Monotone Temporal Planning: Tractability, Extensions and Applications

It is shown that any (temporal) planning problem has a monotone relaxation which can lead to the polynomial-time detection of its unsolvability in certain cases and that this relaxation is orthogonal to relaxations based on the ignore-deletes approach used in classical planning.

Monotone Temporal Planning: Tractability, Extensions and Applications - (Extended Abstract)

A polynomially-solvable class of temporal planning problems requiring the concurrent execution of actions, with potential applications in the chemical, pharmaceutical and construction industries is described.

Handling non-local dead-ends in Agent Planning Programs

This work provides a technique that relies on reasoning about ``global" dead-ends and that can be incorporated to any planning-based approach to agent planning problems, and introduces the notion of online execution of such planning structures.

Planning and Acting with Non-Deterministic Events: Navigating between Safe States

This paper leverages the notion of Safe States in dynamic environments under presence of non-deterministic exogenous events that might eventually cause dead-ends and empirically shows that such an approach effectively navigates the agent towards its goals in spite of presence of dead- ends.

35 References

Landmark-based Meta Best-First Search Algorithm : First Parallelization Attempt and Evaluation

A new method for problem splitting based on landmarks is proposed 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.

Ordered Landmarks in Planning

This work extends Koehler and Hoffmann's definition of reasonable orders between top level goals to the more general case of landmarks and shows how landmarks can be found, how their reasonable orders can be approximated, and how this information can be used to decompose a given planning task into several smaller sub-tasks.

Landmarks Revisited

This work proposes a novel approach for using landmarks in planning by deriving a pseudo-heuristic and combining it with other heuristics in a search framework and shows how additional landmarks and orderings can be found using the information present in multi-valued state variable representations of planning tasks.

Planning as heuristic search

A Lookahead Strategy for Heuristic Search Planning

This work presents a novel way for extracting information from the relaxed plan and for dealing with helpful actions, by considering the high quality of the relaxed plans in numerous domains, in a complete best-first search algorithm.

Landmark Extraction via Planning Graph Propagation

This work proposes a framework in which a broader class of information, including the original reachability information, can be propagated in the plan graph in polynomial time, and exhibits an algorithm for propagating “landmark” information, where a landmark is a proposition or action that must occur in any correct plan.

Sound and Complete Landmarks for And/Or Graphs

It is demonstrated that this approach finds strictly more causal landmarks than previous approaches and the relationship between increased computational effort and experimental performance is discussed, using these landmarks in a recently proposed admissible landmark-counting heuristic.

YAHSP 2 : Keep It Simple , Stupid

The new implementation of lookahead search that has been made in the second version of the YAHSP planner, which has been considerably simplified since the first implementation, and it is shown through an extensive comparison, over all existing IPC benchmarks, that the resulting YAH SP2 planner outperforms stateof-the-art planners in terms of cumulated number of solved problems and running time.

Preferred Operators and Deferred Evaluation in Satisficing Planning

The use of preferred operators and deferred evaluation in a variety of settings within best-first search are examined, finding that they are consistent with and help explain the good performance of the winners of the satisficing tracks at IPC 2004 and 2008.

The FF Planning System: Fast Plan Generation Through Heuristic Search

A novel search strategy is introduced that combines hill-climbing with systematic search, and it is shown how other powerful heuristic information can be extracted and used to prune the search space.