The influence of \(k\)-dependence on the complexity of planning

DOI10.1016/j.artint.2011.12.002zbMath1238.68151OpenAlexW2082348724MaRDI QIDQ420826

Anders Jonsson, Omer Giménez

Publication date: 23 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.artint.2011.12.002

zbMATH Keywords

computational complexityplanningtractable planning

Mathematics Subject Classification ID

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

Related Items (2)

Star-topology decoupled state space search ⋮ Backdoors to planning

Cites Work

• Planning for conjunctive goals
• Automatically generating abstractions for planning
• The computational complexity of propositional STRIPS planning
• The Role of Macros in Tractable Planning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The influence of \(k\)-dependence on the complexity of planning