Phase transitions of contingent planning problem
DOI10.1155/2013/687578zbMATH Open1299.68034OpenAlexW2169106402WikidataQ59031603 ScholiaQ59031603MaRDI QIDQ474510FDOQ474510
Authors: Junping Zhou, Wei-hua Su, Zhiqiang Ma, Minghao Yin 
Publication date: 24 November 2014
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/687578
Recommendations
- A probabilistic analysis of propositional STRIPS planning
- An empirical study of phase transitions in binary constraint satisfaction problems
- Phase transitions of EXPSPACE-complete problems
- Locating the phase transition in binary constraint satisfaction problems
- AI*IA 2003: Advances in Artificial Intelligence
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Combinatorial probability (60C05)
Cites Work
- The complexity of theorem-proving procedures
- The fast downward planning system
- Approximating the unsatisfiability threshold of random formulas
- The TSP phase transition
- Sharp thresholds of graph properties, and the $k$-sat problem
- Title not available (Why is that?)
- Analysis of Two Simple Heuristics on a Random Instance ofk-sat
- Phase transitions of EXPSPACE-complete problems: a further step
- Phase transitions of EXPSPACE-complete problems
- Planning graph heuristics for belief space search
- Task decomposition on abstract states, for planning under nondeterminism
- Title not available (Why is that?)
- Random MAX SAT, random MAX CUT, and their phase transitions
Cited In (3)
This page was built for publication: Phase transitions of contingent planning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474510)
