23 search results - page 1 / 5 » Solving Non-deterministic Planning Problems with Pattern Dat... |
KI
2009
Springer
13 years 11 months ago
2009
Springer
AAAI
2007
13 years 7 months ago
2007
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
KI
2008
Springer
13 years 4 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...
EVOW
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of finding two-dimensional cutting patterns for glass sheets in order to produce rectangular elements requested by customers. The number of needed sheets, ...
ECAI
2008
Springer
13 years 6 months ago
2008
Springer
Pattern Databases were a major breakthrough in heuristic search by solving hard combinatorial problems various orders of magnitude faster than state-of-the-art techniques at that ...