• Corpus ID: 15299785

On the Use of Landmarks in LPG

  title={On the Use of Landmarks in LPG},
  author={Francesco Benzi and Alfonso Gerevini and Alessandro Saetti and Ivan Serina},
Domain-Independent planning is notoriously a very hard search problem. In the literature, several techniques for search control have been proposed in the context of various planning formalisms. In particular, Landmark techniques have been widely used in the planning community in order to guide the search process or to define heuristic functions. A Landmark can be defined as a logical expression, consisting of facts or actions, that certainly becomes true in any solution plan for that problem… 

Figures and Tables from this paper



On the extraction, ordering, and usage of landmarks in planning

This work defines ordering constraints not only over the top level goals, but also over the sub-goals that will arise during planning, and demonstrates that the approach can yield significant performance improvements in both heuristic forward search and Graphplan-style planning.

Local Search Techniques for Temporal Planning in LPG

This paper presents some new heuristics to guide the search in LPG using a graph-based representation called "Temporal Action Graphs" (TA-graphs), and shows that these techniques can be very effective and that often the planner outperforms all other fully-automated temporal planners that took part in the contest.

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.

The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks

It is found that using landmarks improves performance, whereas the incorporation of action costs into the heuristic estimators proves not to be beneficial, and in some domains a search that ignores cost solves far more problems, raising the question of how to deal with action costs more effectively in the future.

Planning Through Stochastic Local Search and Temporal Action Graphs in LPG

This paper focuses on temporal planning, introducing TA-graphs and proposing some techniques to guide the search in LPG using this representation, and shows that these techniques can be very effective.

Combining Domain-Independent Planning and HTN Planning: The Duet Planner

Duet is presented, a planning system that incorporates the ability of using hierarchical domain knowledge in the form of Hierarchical Task Networks (HTNs) as in SHOP2 and using domain-independent local search techniques as in LPG.

Fast Planning Through Planning Graph Analysis

Domain Independent Approaches for Finding Diverse Plans

It is described how two representative state-of-the-art domain independent planning approaches - one based on compilation to CSP, and the other based on heuristic local search - can be adapted to produce diverse plans.

Problem Splitting Using Heuristic Search in Landmark Orderings

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.

An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events

This paper proposes an approach to planning in temporal domains with exogenous events that happen at known times, imposing the constraint that certain actions in the plan must be executed during some predefined time windows which integrates constraint-based temporal reasoning into a graph-based planning framework using local search.