99 search results - page 9 / 20 » On the Hardness of Planning Problems with Simple Causal Grap... |
AIPS
2008
13 years 10 months ago
2008
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
GIS
2007
ACM
13 years 11 months ago
2007
ACM
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
AIPS
2008
13 years 10 months ago
2008
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
AI
2011
Springer
13 years 2 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...