858 search results - page 42 / 172 » Planning and defeasible reasoning |
EPIA
2001
Springer
14 years 1 months ago
2001
Springer
Dealing with temporality on actions presents an important challenge to AI planning. Unlike Graphplan-based planners which alternate levels of propositions and actions in a regular ...
AIPS
2006
13 years 10 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
AIPS
2006
13 years 10 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
CLIMA
2004
13 years 10 months ago
2004
Abstract. In recent years, within the planning literature there has been a departure from approaches computing total plans for given goals, in favour of approaches computing partia...
AI
2008
Springer
13 years 8 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...