Towards efficient universal planning: A randomized approach
From MaRDI portal
Publication:1978311
DOI10.1016/S0004-3702(99)00103-4zbMATH Open0939.68828OpenAlexW2067409880MaRDI QIDQ1978311FDOQ1978311
Authors: Peter Jonsson, P. Haslum, Christer Bäckström 
Publication date: 4 June 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(99)00103-4
Recommendations
Cites Work
- Fast planning through planning graph analysis
- Title not available (Why is that?)
- Relationships between nondeterministic and deterministic tape complexities
- Title not available (Why is that?)
- The computational complexity of propositional STRIPS planning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Symmetric space-bounded computation
- Turing machines that take advice
- Tractable plan existence does not imply tractable plan generation
- New Collapse Consequences of NP Having Small Circuits
- Partial-order planning: Evaluating possible efficiency gains
Cited In (6)
- Backtracking algorithms for disjunctions of temporal constraints
- Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)
- Star-topology decoupled state space search
- Towards a theory of random walk planning: regress factors, fair homogeneous graphs and extensions
- Computational complexity of computing symmetries in finite-domain planning
- Fast strong planning for fully observable nondeterministic planning problems
Uses Software
This page was built for publication: Towards efficient universal planning: A randomized approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978311)
