Complexity results for standard benchmark domains in planning

DOI10.1016/S0004-3702(02)00364-8zbMath1079.68621WikidataQ56083178 ScholiaQ56083178MaRDI QIDQ814425

Malte Helmert

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Complexity of planningPlanning benchmarksPlanning domainsTransportation problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Traffic problems in operations research (90B20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Learning from planner performance ⋮ On the complexity of planning for agent teams and its implications for single agent planning ⋮ Sensor networks and distributed CSP: communication, computation and complexity ⋮ Complexity of scorpion solitaire and applications to klondike ⋮ Refining complexity analyses in planning by exploiting the exponential time hypothesis ⋮ A case study in programming a quantum annealer for hard operational planning problems ⋮ The complexity of solitaire ⋮ A complete parameterized complexity analysis of bounded planning

Uses Software

• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of blocks-world planning
• The computational complexity of propositional STRIPS planning
• Fast planning through planning graph analysis
• Complexity, decidability and undecidability results for domain-independent planning
• Blocks World revisited