312 search results - page 8 / 63 » On Temporal Planning as CSP |
IJCAI
2001
13 years 9 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
AIPS
2003
13 years 9 months ago
2003
We present some techniques for planning in temporal do
JOLLI
2007
13 years 7 months ago
2007
This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, PDDL-K (Planning...
AIPS
2006
13 years 9 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...
AI
2008
Springer
13 years 7 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...