State-variable planning under structural restrictions: algorithms and complexity

DOI10.1016/S0004-3702(98)00003-4MaRDI QIDQ1128767zbMATH OpenWikidataFDO

Authors Peter Jonsson, Christer Bäckström

Publication date 13 August 1998

Published in Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

algorithmsplanningcomplexitystructuretractability

Mathematics Subject Classification ID

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

Recommendations

• Algorithms and conditional lower bounds for planning problems
• Extending classical planning with state constraints: heuristics and search for optimal planning
• Constraint based planning with composable substate graphs
• Optimistic planning algorithms for state-constrained optimal control problems
• scientific article; zbMATH DE number 1315585
• State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
• scientific article; zbMATH DE number 6519681
• Task decomposition on abstract states, for planning under nondeterminism
• Computational complexity of planning and approximate planning in the presence of incompleteness
• scientific article; zbMATH DE number 1696842

Cites work

• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1216125 (Why is no real title available?)
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• scientific article; zbMATH DE number 823121 (Why is no real title available?)
• A lattice-theoretical fixpoint theorem and its applications
• A note on two problems in connexion with graphs
• Algorithms and limits for compact plan representations
• Depth-First Search and Linear Graph Algorithms
• Fast planning through planning graph analysis
• Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
• Partial-order planning: Evaluating possible efficiency gains
• Planning for conjunctive goals
• STRIPS: A new approach to the application of theorem proving to problem solving
• State-variable planning under structural restrictions: algorithms and complexity
• The computational complexity of propositional STRIPS planning

Cited in

(14)

• Long-distance mutual exclusion for planning
• Backdoors to planning
• A complete parameterized complexity analysis of bounded planning
• Concise finite-domain representations for PDDL planning tasks
• Algorithms and limits for compact plan representations
• scientific article; zbMATH DE number 2196172 (Why is no real title available?)
• New islands of tractability of cost-optimal planning
• Computational complexity of computing symmetries in finite-domain planning
• Extending classical planning with state constraints: heuristics and search for optimal planning
• Structural analysis of optimization problems formulated in planning languages
• Deliberative acting, planning and learning with hierarchical operational models
• State-variable planning under structural restrictions: algorithms and complexity
• scientific article; zbMATH DE number 67473 (Why is no real title available?)
• Cost-optimal planning, delete relaxation, approximability, and heuristics

Describes a project that uses

Uses Software

• Graphplan

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1128767)