• Corpus ID: 13346208

Local Search Techniques for Temporal Planning in LPG

@inproceedings{Gerevini2003LocalST,
  title={Local Search Techniques for Temporal Planning in LPG},
  author={Alfonso Gerevini and Ivan Serina and Alessandro Saetti and Sergio Spinoni},
  booktitle={ICAPS},
  year={2003}
}
We present some techniques for planning in temporal domains specified with the recent standard languange PDDL2.1. These techniques are implemented in LPG, a fully-automated system that took part in the third International Planning Competition (Toulouse, 2002) showing excellent performance. The planner is based on a stochastic local search method and on a graph-based representation called "Temporal Action Graphs" (TA-graphs). In this paper we present some new heuristics to guide the search in… 

Figures and Tables from this paper

Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
TLDR
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.
On Managing Temporal Information for Handling Durative Actions in LPG
TLDR
A plan representation called Temporal Durative Action Graph (TDA-graph) is introduced which distinguishes different types of constraints for ordering the actions and allows to generate plans with a high degree of parallelism.
On the Use of Landmarks in LPG
TLDR
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.
On the Completeness of Pruning Techniques for Planning with Conditional Effects
TLDR
It is proved that, in general, HAP is incomplete for planning with conditional effects if factored expansions of actions are used and proposed pruning strategy that is based on relevance analysis and confrontation is called CGRAP.
The Metric FF Planning System Translating Ignoring Delete Lists to Numeric State Variables
  • J. Ho
  • Computer Science
  • 2003
TLDR
A natural extension of ignoring delete lists to numeric state variables preserving the relevant theoretical properties of the STRIPS relaxation under the condition that the numeric task at hand is monotonic is presented.
When is Temporal Planning Really Temporal?
TLDR
A complete state-space temporal planning algorithm is designed, which the authors hope will be able to achieve high performance by leveraging the heuristics that power decision epoch planners.
The Metric-ff Planning System: Translating \ignoring Delete Lists" to Numeric State Variables
TLDR
A natural extension of "ignoring delete lists" to numeric state variables is presented, preserving the relevant theoretical properties of the STRIPS relaxation under the condition that the numeric task at hand is \monotonic".
Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks
TLDR
The overall investigation gives a rare example of a successful analysis of the connections between typical-case problem structure, and search performance, and gives hints on how the topological phenomena might be automatically recognizable by domain analysis techniques.
Where Ignoring Delete Lists Works: Local Search Topology in Planning Benchmarks
TLDR
Investigating a large range of planning domains, it is proved that FF's search algorithm, using an idealized heuristic function, is a polynomial solving mechanism in (at least) eleven commonly used benchmark domains.
The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables
TLDR
A natural extension of "ignoring delete lists" to numeric state variables is presented, preserving the relevant theoretical properties of the STRIPS relaxation under the condition that the numeric task at hand is "monotonic".
...
...

References

SHOWING 1-10 OF 10 REFERENCES
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
TLDR
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.
Fast Planning through Greedy Action Graphs
TLDR
This paper proposes a new search method in the context of Blum and Furst's planning graph approach, which is based on local search, and introduces three heuristics to guide the local search.
Fast Planning Through Planning Graph Analysis
The FF Planning System: Fast Plan Generation Through Heuristic Search
TLDR
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.
Reviving Partial Order Planning
This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make them competitive
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
TLDR
The syntax of the language, PDDL2.1, is described, which has considerable modelling power -- exceeding the capabilities of current planning technology -- and presents a number of important challenges to the research community.
Pushing the Envelope: Planning, Propositional Logic and Stochastic Search
TLDR
Stochastic methods are shown to be very effective on a wide range of scheduling problems, but this is the first demonstration of its power on truly challenging classical planning instances.
UCPOP: A Sound, Complete, Partial Order Planner for ADL
TLDR
It is proved ucpop is both sound and complete for this representation and a practical implementation that succeeds on all of Pednault's and McDermott's examples, including the infamous "Yale Stacking Problem".
LPG: A Planner Based on Local Search for Planning Graphs with Action Costs
A corner bracket for use in mounting and locating a mounting bracket for a window covering including an inverted L-shaped mounting plate having a plurality of preformed slots and holes for receiving
Noise Strategies for Improving Local Search
TLDR
It is shown that mixed random walk is the superior strategy for solving MAX-SAT problems, and results demonstrating the effectiveness of local search with walk for solving circuit synthesis and circuit diagnosis problems are presented.