Towards efficient universal planning: A randomized approach

DOI10.1016/S0004-3702(99)00103-4zbMath0939.68828OpenAlexW2067409880MaRDI QIDQ1978311

Peter Jonsson, Christer Bäckström, Patrik Haslum

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

zbMATH Keywords

computational complexityrandomizationreactive planninguniversal planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Star-topology decoupled state space search ⋮ Backtracking algorithms for disjunctions of temporal constraints ⋮ Computational Complexity of Computing Symmetries in Finite-Domain Planning

Uses Software

• Graphplan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turing machines that take advice
• Symmetric space-bounded computation
• Tractable plan existence does not imply tractable plan generation
• Partial-order planning: Evaluating possible efficiency gains
• The computational complexity of propositional STRIPS planning
• Fast planning through planning graph analysis
• Relationships between nondeterministic and deterministic tape complexities
• New Collapse Consequences of NP Having Small Circuits

This page was built for publication: Towards efficient universal planning: A randomized approach