Planning Through Stochastic Local Search and Temporal Action Graphs in LPG

@article{Gerevini2003PlanningTS,
  title={Planning Through Stochastic Local Search and Temporal Action Graphs in LPG},
  author={Alfonso Gerevini and Alessandro Saetti and Ivan Serina},
  journal={J. Artif. Intell. Res.},
  year={2003},
  volume={20},
  pages={239-290}
}
We present some techniques for planning in domains specified with the recent standard language PDDL2.1, supporting "durative actions" and numerical quantities. These techiques are implemented in LPG, a domain-independent planner that took part in the 3rd International Planning Competition (IPC). LPG is an incremental, any time system producing multi-criteria quality plans. The core of the system is based on a stochastic local search method and on a graph-based representation called "Temporal… 
View PDF on arXiv
390 Citations
Highly Influential Citations
39
Background Citations
127
Methods Citations
112
Results Citations
4

Figures and Tables from this paper

390 Citations

Citation Type

Citation Type

Local Search Techniques for Temporal Planning in LPG
TLDR
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.
Domain-independent temporal planning in a planning-graph-based approach
TLDR
A temporal planning approach that combines the principles of Graphplan and TGP, and uses the information calculated in the planning graph to deal with a model of actions that include local conditions and effects is presented.
LPG-TD : a Fully Automated Planner for PDDL 2 . 2 Domains
Like the previous version of LPG, the new version is based on a stochastic local search in the space of particular “action graphs” derived from the planning problem specification. In LPG-TD, this…
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.
Planning with Numerical Expressions in LPG
TLDR
This work presents a plan representation for handling numerical expressions called Numerical Action Graph (NA-graph), and proposes some extensions of LPG to guide a search process where the search states are NA-graphs.
Planning with Derived Predicates through Rule-Action Graphs and Relaxed-Plan Heuristics
TLDR
This work proposes an approach to planning with derived predicates where the search space consists of particular graphs of actions and rules, called rule-action graphs, representing partial plans, and presents some techniques for managing domain rules in the context of a local search process for rule- action graphs.
Planning in domains with derived predicates through rule-action graphs and local search
TLDR
This paper proposes an approach to planning with derived predicates where the search space consists of “Rule-Action Graphs”, particular graphs of actions and rules representing derived predicate, which are integrated into a framework for planning through local search and rule-action graphs.
An approach to efficient planning with numerical fluents and multi-criteria plan quality
An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events
TLDR
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.
An Empirical Analysis of Some Heuristic Features for Planning through Local Search and Action Graphs
TLDR
Experimental results indicate that the current version of LPG using the identified best heuristic techniques as the default settings is competitive with the winner of the last (2008) International Planning Competition.
...
...

References

SHOWING 1-10 OF 42 REFERENCES
Local Search Techniques for Temporal Planning in LPG
TLDR
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.
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.
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.
Planning Graph-based Heuristics for Cost-sensitive Temporal Planning
TLDR
This paper considers the problem of developing heuristics that are sensitive to both makespan and cost, and develops a planning graph-based approach for this purpose, and presents a methodology for efficiently tracking the cost functions.
Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs
TLDR
This paper presents a framework for solving this class of propositional CSPs using local search in planning graphs, and shows that LPG is significantly faster than Blackbox and other planners based on planning graphs.
Fast Planning Through Planning Graph Analysis
Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning
TLDR
Improved plan and goal selection strategies and the use of operator parameter domains to prune search gave speedups by an order of magnitude or more for difficult problems, both with the default ucpop search strategy and with the improved strategy.
Inferring State Constraints for Domain-Independent Planning
TLDR
Preliminary results on the effectiveness of adding computed state constraints and predicate domains to the specification of problems for SAT-based planners such as SATPLAN or MEDIC are shown.
Temporal Planning through Mixed Integer Programming: A Preliminary Report
TLDR
A novel approach to temporal planning that is based on Mixed Integer Programming is presented, which aims at generating good solutions quickly, under different minimization objectives.
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.
...
...