Sciweavers

4 search results - page 1 / 1
» Asymptotically Optimal Encodings of Conformant Planning in Q...
Sort
View
89
Voted
AAAI
2007
14 years 11 months ago
Asymptotically Optimal Encodings of Conformant Planning in QBF
The world is unpredictable, and acting intelligently requires anticipating possible consequences of actions that are taken. Assuming that the actions and the world are determinist...
Jussi Rintanen
AIPS
1998
14 years 10 months ago
Encoding HTN Planning in Propositional Logic
Casting planning problems as propositional satis ability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the bene ts of this appro...
Amol Dattatraya Mali, Subbarao Kambhampati
103
Voted
AIPS
2006
14 years 10 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
81
Voted
AI
2008
Springer
14 years 9 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith