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.012zbMath1191.68634OpenAlexW1989914740WikidataQ62039870 ScholiaQ62039870MaRDI QIDQ835826
Alfonso E. Gerevini, Derek Long, Yannis Dimopoulos, Patrik Haslum, Alessandro Saetti
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
automated planningplanning languagesbenchmarks for planningexperimental evaluation of planning systemsinternational planning competitionknowledge representation in planningPDDLplan constraintsplanning systemspreferences in planning
Related Items
Domain-independent planning for services in uncertain and dynamic environments, Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners, Finite-trace linear temporal logic: coinductive completeness, Robot task planning and explanation in open and uncertain worlds, Solving satisfiability problems with preferences, A tableau construction for finite linear-time temporal logic, Proof systems for planning under 0-approximation semantics, Agent planning programs, Design and results of the Fifth Answer Set Programming Competition, An extension of metric temporal planning with application to AC voltage control, Hybrid planning for challenging construction problems: an answer set programming approach, Planning in domains with derived predicates through rule-action graphs and local search, Specifying and computing preferred plans, Theorem proving for pointwise metric temporal logic over the naturals via translations, Selecting goals in oversubscription planning using relaxed plans, State space search nogood learning: online refinement of critical-path dead-end detectors in planning, Book review of: P. Haslum et. al., An introduction to the planning domain definition language, Creative Problem Solving in Artificially Intelligent Agents: A Survey and Framework, SMT-Based Abstract Parametric Temporal Planning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Planning for temporally extended goals.
- Fast planning through planning graph analysis
- TALplanner: A temporal logic based forward chaining planner
- The biobjective travelling purchaser problem
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- Using temporal logics to express search control knowledge for planning
- An approach to efficient planning with numerical fluents and multi-criteria plan quality
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
- Branching and pruning: An optimal temporal POCL planner based on constraint programming
- In defense of PDDL axioms
- Introducing Preferences in Planning as Satisfiability
- An LP-Based Heuristic for Optimal Planning
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Semiring-based constraint satisfaction and optimization
- Logic Programming and Nonmonotonic Reasoning
- A General Framework for Expressing Preferences in Causal Reasoning and Planning
- Principles and Practice of Constraint Programming – CP 2004
- Planning as heuristic search
