Corpus ID: 576625

An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning

@inproceedings{Bibai2010AnEM,
  title={An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning},
  author={Jacques Bibai and Pierre Sav{\'e}ant and Marc Schoenauer and Vincent Vidal},
  booktitle={ICAPS},
  year={2010}
}
DAEX is a metaheuristic designed to improve the plan quality and the scalability of an encapsulated planning system. DAEX is based on a state decomposition strategy, driven by an evolutionary algorithm, which benefits from the use of a classical planning heuristic to maintain an ordering of atoms within the individuals. The proof of concept is achieved by embedding the domain-independent satisficing YAHSP planner and using the critical path h1 heuristic. Experiments with the resulting algorithm… Expand
An Evolutionary Metaheuristic for Domain-Independent Satisficing Planning
TLDR
Results show that DAEYAHSP performs very well both on coverage and quality metrics, making it competitive with state-of-the-art planners. Expand
Segmentation et évolution pour la planification : le système Divide-And-Evolve
TLDR
A full account of the algorithm is given, reports on the experiments and some insights on the algorithm behavior are provided, showing that DAEYAHSP performs very well both on coverage and quality metrics. Expand
Pareto-Based Multiobjective AI Planning
TLDR
The Pareto-based multiobjective planner MO-DAE thus avoids the drawbacks of the aggregation method and outperforms in many cases the metric-based approach using LPG metric sensitive planner, as witnessed by experimental results on original multiobjectives benchmarks built upon IPC-2011 domains. Expand
Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches
TLDR
The comparative experiments on a recently proposed benchmark set that are reported here demonstrate the usefulness of going Pareto-based in AI Planning. Expand
Quality Measures of Parameter Tuning for Aggregated Multi-Objective Temporal Planning
TLDR
This paper discusses a case study in multi-objective temporal planning using the evolutionary planner DaE and the meta-optimizer ParamILS, and demonstrates that indeed, in this context, using the hypervolume indicator as ParamILS target is the best choice. Expand
YAHSP 2 : Keep It Simple , Stupid
The idea of computing lookahead plans from relaxed plans and using them in the forward state-space heuristic search YAHSP planner has first been published in 2003. We show in this paper that thisExpand
On the generality of parameter tuning in evolutionary planning
TLDR
It is demonstrated that more specific parameter tuning (e.g. at the domain level or even at the instance level) can further improve DaE results, and the trade-off between the gain in quality of the resulting plans and the overhead in terms of computational cost is discussed. Expand
Dynamic Online Planning and Scheduling Using a Static Invariant-Based Evaluation Model
TLDR
A generic local search library that can be used in this context to quickly build and rebuild good quality plans and to reason on dynamic problem instances using a unique static problem model, without dynamic memory allocation is introduced. Expand
Landmark-based Meta Best-First Search Algorithm : First Parallelization Attempt and Evaluation
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 firstExpand
Problem Splitting Using Heuristic Search in Landmark Orderings
TLDR
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. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 33 REFERENCES
DAE : Planning as Artificial Evolution ( Deterministic part )
The sub-optimal DAE planner implements the stochastic approach for domain-independent planning decomposition introduced in (Schoenauer, Sav éant, and Vidal 2006; 2007). The purpose of this planner isExpand
Admissible Heuristics for Optimal Planning
TLDR
A new admissible heuristic for planning is formulated, used to guide an IDA* search, and empirically evaluate the resulting optimal planner over a number of domains. Expand
Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms
TLDR
The Divide and- Evolve approach is described here in the context of temporal planning problems (TPPs), and the results on the standard Zeno transportation benchmarks demonstrate its ability to indeed break the complexity barrier. Expand
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
TLDR
An original approach to hybridize Evolutionary Algorithms with Operational Research (OR) methods in the domain of Temporal Planning Problems (TPPs), which can solve globally problems that are intractable when directly fed into deterministic OR algorithms. Expand
A Lookahead Strategy for Heuristic Search Planning
  • V. Vidal
  • Computer Science, Mathematics
  • ICAPS
  • 2004
TLDR
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. Expand
Branching and pruning: An optimal temporal POCL planner based on constraint programming
TLDR
A domain-independent formulation of temporal planning based on Constraint Programming is introduced that successfully combines a POCL branching scheme with powerful and sound pruning rules and is competitive with the best parallel planners in the special case in which actions have all the same duration. Expand
Temporal Planning using Subgoal Partitioning and Resolution in SGPlan
TLDR
This paper presents a partition-and-resolve strategy that looks for locally optimal subplans in constraint-partitioned temporal planning subpro problems and that resolves those inconsistent global constraints across the subproblems. Expand
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. Expand
Computational Aspects of Reordering Plans
TLDR
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria, and shows that only the weakest one of the three criteria is tractable to achieve, the other two being NP-hard and even difficult to approximate. Expand
Divide-And-Evolve Facing State-of-the-Art Temporal Planners during the 6th International Planning Competition
TLDR
Though the overall results were disappointing, a detailed investigation demonstrates that in spite of a harsh time constraint imposed by the competition rules, DAE was able to obtain the best quality results in a number of instances. Expand
...
1
2
3
4
...