16 search results - page 3 / 4 » Extracting Effective and Admissible State Space Heuristics f... |
PUK
2000
13 years 8 months ago
2000
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
AIPS
2000
13 years 8 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
PUK
2003
13 years 8 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
AIPS
2008
13 years 9 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
AIPS
2003
13 years 8 months ago
2003
We examine the issues that arise in extending an estimatedregression (ER) planner to reason about autonomous processes that run and have continuous and discrete effects without th...