Concise finite-domain representations for PDDL planning tasks

DOI10.1016/j.artint.2008.10.013zbMath1191.68635OpenAlexW2134029974MaRDI QIDQ835819

Malte Helmert

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.013

zbMATH Keywords

automated planningPDDLproblem reformulationSAS\(^{+}\)

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (13)

Domain-independent planning for services in uncertain and dynamic environments ⋮ Extracting mutual exclusion invariants from lifted temporal planning domains ⋮ Efficient symbolic search for cost-optimal planning ⋮ Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I ⋮ OMTPlan: A Tool for Optimal Planning Modulo Theories ⋮ On the complexity of planning for agent teams and its implications for single agent planning ⋮ State space search nogood learning: online refinement of critical-path dead-end detectors in planning ⋮ Star-topology decoupled state space search ⋮ Book review of: P. Haslum et. al., An introduction to the planning domain definition language ⋮ Writing Declarative Specifications for Clauses ⋮ Computational Complexity of Computing Symmetries in Finite-Domain Planning ⋮ Red-black planning: a new systematic approach to partial delete relaxation ⋮ A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning

Uses Software

• CPlan
• PDDL

Cites Work

• State-variable planning under structural restrictions: algorithms and complexity
• The computational complexity of propositional STRIPS planning
• Complexity, decidability and undecidability results for domain-independent planning
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• An LP-Based Heuristic for Optimal Planning
• Planning as heuristic search
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Concise finite-domain representations for PDDL planning tasks