1146 search results - page 8 / 230 » On the Complexity of Domain-Independent Planning |
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents the design and development of an adaptive planning system using the technology of Web services. The Web-based adaptive planning system consists of two modules t...
JMLR
2008
13 years 7 months ago
2008
A number of today's state-of-the-art planners are based on forward state-space search. The impressive performance can be attributed to progress in computing domain independen...
AIPS
2009
13 years 8 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
EMISA
2002
Springer
13 years 7 months ago
2002
Springer
Abstract: There is a lack of a systematic, generic, domain independent objectoriented software engineering process for software familes. In such process a system family should be t...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...