Corpus ID: 16982684

The Benchmark Domains of the Deterministic Part of IPC-5

@inproceedings{Dimopoulos2006TheBD,
  title={The Benchmark Domains of the Deterministic Part of IPC-5},
  author={Yannis Dimopoulos and A. Gerevini and P. Haslum and A. Saetti},
  year={2006}
}
We present a set of planning domains and problems that have been used as benchmarks for the fifth International planning competition. Some of them were inspired by different types of logistics applications, others were obtained by encoding known problems from operation research and bioinformatics. For each domain, we developed several variants using different fragments of PDDL3 with increasing expressiveness. 
Knowledge Engineering Tools and Techniques for AI Planning
TLDR
The paper presents a classical planning compilation for learning STRIPS action models from partial observations of plan executions, which can be used to validate whether an observation of a plan execution follows a given STRIps action model, even if the given model or the given observation is incomplete. Expand
Learning from planner performance
TLDR
This study of existing and new problems and planners is prescriptive and prospective in that the results should help guide researchers in comparatively evaluating their planners and suggest need for additional effort. Expand
Applications of parallel processing technologies in heuristic search planning: methodologies and experiments
TLDR
It is shown that an appropriate parallelization of a sequential planning system often brings gain in performance and/or scalability and the issues that should be taken into consideration when designing a parallel planning system are discussed. Expand
Applications of parallel processing technologies in heuristic search planning: methodologies and experiments
TLDR
It shows that an appropriate parallelization of a sequential planning system often brings gain in performance and-or scalability and the application of parallel programming techniques to boost the performance of heuristic search-based planning systems in various aspects. Expand
Generic types and their use in improving the quality of search heuristics
TLDR
Improvements in heuristic quality are made by performing a static analysis of the planning problem to identify commonly occurring 'generic types', and providing additional heuristic guidance based on their known properties. Expand
A Realistic Multi-Modal Cargo Routing Benchmark
TLDR
A multi-modal cargo routing domain for modelling military logistics planning problems that feature timing constraints, concurrency, capacitated resources, and action costs is described, and a PDDL domain model is developed. Expand
A weighted CSP approach to cost-optimal planning
TLDR
An optimal-cost planner which guarantees global optimality whenever the planning problem has a solution is described, and the notions of indispensable (sets of) actions and too-costly actions introduced have various potential applications in optimal planning. Expand
Transformation of optimal planning problems
TLDR
It is shown that a linear program derived from a relaxation which ignores the constraints on the ordering of actions can be used to obtain a lower bound on the cost of a solution-plan and that the dual of this linear program provides a transformation of the problem into an equivalent optimal planning problem. Expand
A Heuristic Search Approach to Planning with Temporally Extended Preferences
TLDR
This paper proposes a method for compiling TEP planning problems into simpler domains containing only final-state preferences and metric functions, and proposes a variety of heuristic functions for planning with final- state preferences, together with an incremental best-first planning algorithm. Expand
Planning in Supply Chain Optimization Problem
The SCO planning problem is a tightly coupled planning and scheduling problem. We have identified some important features underlying this problem including the coordination between actions,Expand
...
1
2
3
...

References

SHOWING 1-10 OF 14 REFERENCES
The Deterministic Part of IPC-4: An Overview
We provide an overview of the organization and results of the deterministic part of the 4th International Planning Competition, i.e., of the part concerned with evaluating systems doing deterministicExpand
Plan Constraints and Preferences in PDDL3
We propose an extension to the PDDL language, called PDDL3.0, that aims at a better characterization of plan quality by allowing the user to express strong and soft constraints about the structure ofExpand
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. Expand
The 3rd International Planning Competition: Results and Analysis
TLDR
The paper addresses the questions of comparative performance between planners, comparative difficulty of domains, the degree of agreement between planners about the relative difficulty of individual problem instances and the question of how well planners scale relative to one another over increasingly difficult problems through statistical analysis of the raw results. Expand
Connections between cutting-pattern sequencing, VLSI design, and flexible machines
TLDR
It is shown that the minimization of open stacks problem is NP-hard and a connection to the field of VLSI design, joining practitioners from both computer science and operations research, is established. Expand
Applications of modern heuristic search methods to pattern sequencing problems
Abstract This article describes applications of modern heuristic search methods to pattern sequencing problems i.e. problems seeking for a permutation of the rows of a given matrix with respect toExpand
A heuristic approach for the Travelling Purchaser Problem
TLDR
A new heuristic approach based on a local-search scheme, exploring a new neighbourhood structure, is proposed to perform a k-exchange of markets instead of the classical 1-exchanges, which is favourably compared to previous heuristic algorithms in literature. Expand
Pathways to Biomedical Discovery
TLDR
This paper presents explanation schemas and treatment strategies that characterize how thinking about pathways contributes to biomedical discovery. Expand
Molecular interaction map of the mammalian cell cycle control and DNA repair systems.
  • K. Kohn
  • Biology, Medicine
  • Molecular biology of the cell
  • 1999
TLDR
The map shows how multiprotein complexes could assemble and function at gene promoter sites and at sites of DNA damage and portrays the richness of connections between the p53-Mdm2 subsystem and other parts of the network. Expand
Constraint modelling challenge
  • Constraint modelling challenge
  • 2005
...
1
2
...