858 search results - page 42 / 172 » Planning and defeasible reasoning |
92
Voted
EPIA
2001
Springer
15 years 5 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 ...
107
click to vote
AIPS
2006
15 years 2 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...
130
Voted
AIPS
2006
15 years 2 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...
124
Voted
CLIMA
2004
15 years 2 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...
109
Voted
AI
2008
Springer
15 years 25 days 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...