State-variable planning under structural restrictions: algorithms and complexity
From MaRDI portal
Publication:1128767
DOI10.1016/S0004-3702(98)00003-4zbMATH Open0906.68140WikidataQ126807894 ScholiaQ126807894MaRDI QIDQ1128767FDOQ1128767
Authors: Peter Jonsson, Christer Bäckström 
Publication date: 13 August 1998
Published in: Artificial Intelligence (Search for Journal in Brave)
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)
Cites Work
- Fast planning through planning graph analysis
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- Planning for conjunctive goals
- Depth-First Search and Linear Graph Algorithms
- STRIPS: A new approach to the application of theorem proving to problem solving
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- The computational complexity of propositional STRIPS planning
- Title not available (Why is that?)
- Algorithms and limits for compact plan representations
- Title not available (Why is that?)
- State-variable planning under structural restrictions: algorithms and complexity
- Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study
- Partial-order planning: Evaluating possible efficiency gains
- Title not available (Why is that?)
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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- State-variable planning under structural restrictions: algorithms and complexity
- Cost-optimal planning, delete relaxation, approximability, and heuristics
Uses Software
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)
