State-variable planning under structural restrictions: algorithms and complexity

DOI10.1016/S0004-3702(98)00003-4zbMath0906.68140WikidataQ126807894 ScholiaQ126807894MaRDI QIDQ1128767

Christer Bäckström, Peter Jonsson

Publication date: 13 August 1998

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

zbMATH Keywords

complexityalgorithmsplanningtractabilitystructure

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Long-distance mutual exclusion for planning ⋮ Concise finite-domain representations for PDDL planning tasks ⋮ State-variable planning under structural restrictions: algorithms and complexity ⋮ Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics ⋮ Deliberative acting, planning and learning with hierarchical operational models ⋮ Backdoors to planning ⋮ A complete parameterized complexity analysis of bounded planning

Uses Software

• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
• Planning for conjunctive goals
• State-variable planning under structural restrictions: algorithms and complexity
• Partial-order planning: Evaluating possible efficiency gains
• The computational complexity of propositional STRIPS planning
• Fast planning through planning graph analysis
• STRIPS: A new approach to the application of theorem proving to problem solving
• A lattice-theoretical fixpoint theorem and its applications
• Algorithms and Limits for Compact Plan Representations
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: State-variable planning under structural restrictions: algorithms and complexity