1146 search results - page 11 / 230 » On the Complexity of Domain-Independent Planning |
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...
ICTAI
2007
IEEE
14 years 2 months ago
2007
IEEE
In science and engineering courses, students are often presented a situation for which they are asked to identify the relevant principles and to instantiate them as a set of equat...
AI
2010
Springer
13 years 7 months ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
EWCBR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
ICCBR
1997
Springer
13 years 12 months ago
1997
Springer
Planning by analogical reasoning is a learning method that consists of the storage, retrieval, and replay of planning episodes. Planning performance improves with the accumulationa...