1146 search results - page 7 / 230 » On the Complexity of Domain-Independent Planning |
SEMWEB
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The shift from Web pages to Web services enables programmatic access to the near limitless information on the World Wide Web. Autonomous agents should generate concise an...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
AIPS
2004
13 years 9 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
JAIR
2008
13 years 7 months ago
2008
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
IUI
1993
ACM
13 years 11 months ago
1993
ACM
We examine the need for plan inference in intelligent help mechanisms. We argue that previous approaches have drawbacks that need to be overcome to make plan inference useful. Fir...