68 search results - page 1 / 14 » Flexible Abstraction Heuristics for Optimal Sequential Plann... |
56
Voted
AIPS
2007
14 years 11 months ago
2007
KI
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributimpact of operators that t...
AI
2008
Springer
14 years 9 months ago
2008
Springer
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...
103
Voted
AIPS
2006
14 years 10 months ago
2006
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...
AIPS
2007
14 years 11 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...