Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
From MaRDI portal
Publication:835826
DOI10.1016/J.ARTINT.2008.10.012zbMATH Open1191.68634OpenAlexW1989914740WikidataQ62039870 ScholiaQ62039870MaRDI QIDQ835826FDOQ835826
Authors: Alfonso E. Gerevini, P. Haslum, D. Long, Alessandro Saetti, Yannis Dimopoulos 
Publication date: 31 August 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2008.10.012
Recommendations
- Complexity, decidability and undecidability results for domain-independent planning
- scientific article; zbMATH DE number 2243413
- scientific article; zbMATH DE number 1931694
- scientific article; zbMATH DE number 1315585
- Concise finite-domain representations for PDDL planning tasks
- Planning as satisfiability: parallel plans and algorithms for plan search
automated planningplanning languagesbenchmarks for planningexperimental evaluation of planning systemsinternational planning competitionknowledge representation in planningPDDLplan constraintsplanning systemspreferences in planning
Cites Work
- Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
- Title not available (Why is that?)
- Fast planning through planning graph analysis
- Planning as heuristic search
- The fast downward planning system
- Planning for temporally extended goals.
- TALplanner: A temporal logic based forward chaining planner
- The FF planning system: Fast plan generation through heuristic search
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Applications of modern heuristic search methods to pattern sequencing problems
- The biobjective travelling purchaser problem
- An LP-Based Heuristic for Optimal Planning
- Semiring-based constraint satisfaction and optimization
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- Title not available (Why is that?)
- Using temporal logics to express search control knowledge for planning
- An approach to efficient planning with numerical fluents and multi-criteria plan quality
- In defense of PDDL axioms
- Temporal planning using subgoal partitioning and resolution in SGPlan
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introducing preferences in planning as satisfiability
- Logic Programming and Nonmonotonic Reasoning
- A General Framework for Expressing Preferences in Causal Reasoning and Planning
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- Title not available (Why is that?)
- Principles and Practice of Constraint Programming – CP 2004
Cited In (27)
- A tableau construction for finite linear-time temporal logic
- Solving satisfiability problems with preferences
- Title not available (Why is that?)
- Title not available (Why is that?)
- SMT-based abstract parametric temporal planning
- Planning in domains with derived predicates through rule-action graphs and local search
- Domain-independent planning for services in uncertain and dynamic environments
- Hybrid planning for challenging construction problems: an answer set programming approach
- Selecting goals in oversubscription planning using relaxed plans
- Title not available (Why is that?)
- Creative Problem Solving in Artificially Intelligent Agents: A Survey and Framework
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Planning in artificial intelligence
- Title not available (Why is that?)
- Theorem proving for pointwise metric temporal logic over the naturals via translations
- Robot task planning and explanation in open and uncertain worlds
- Proof systems for planning under 0-approximation semantics
- Agent planning programs
- Design and results of the Fifth Answer Set Programming Competition
- Finite-trace linear temporal logic: coinductive completeness
- An extension of metric temporal planning with application to AC voltage control
- First-order temporal logic on finite traces: semantic properties, decidable fragments, and applications
- Specifying and computing preferred plans
- Book review of: P. Haslum et. al., An introduction to the planning domain definition language
- Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning
- Title not available (Why is that?)
Uses Software
This page was built for publication: Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835826)
