Towards efficient universal planning: A randomized approach

DOI10.1016/S0004-3702(99)00103-4MaRDI QIDQ1978311zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexityrandomizationreactive planninguniversal planning

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1216123
• A probabilistic analysis of propositional STRIPS planning
• Fast planning through planning graph analysis
• Contingent planning under uncertainty via stochastic satisfiability

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Fast planning through planning graph analysis
• New Collapse Consequences of NP Having Small Circuits
• Partial-order planning: Evaluating possible efficiency gains
• Relationships between nondeterministic and deterministic tape complexities
• Symmetric space-bounded computation
• The computational complexity of propositional STRIPS planning
• Tractable plan existence does not imply tractable plan generation
• Turing machines that take advice

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

Describes a project that uses

Uses Software

• Graphplan

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)