179 search results - page 29 / 36 » Using Classical Planners to Solve Nondeterministic Planning ... |
110
click to vote
AIM
2004
15 years 1 months ago
2004
Satellite domains are becoming a fashionable area of research within the AI community due to the complexity of the problems that these domains need to solve. With the current US a...
AIPS
2008
15 years 4 months ago
2008
When controlling an autonomous system, it is inefficient or sometimes impossible for the human operator to specify detailed commands. Instead, the field of AI autonomy has develop...
103
click to vote
AIPS
2000
15 years 3 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
100
click to vote
AIPS
2008
15 years 4 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...
108
click to vote
AIPS
2003
15 years 3 months ago
2003
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...