1146 search results - page 105 / 230 » On the Complexity of Domain-Independent Planning |
ICCBR
2010
Springer
14 years 1 months ago
2010
Springer
The vast majority of research on AI planning has focused on automated plan recognition, in which a planning agent is provided with a set of inputs that include an initial goal (or ...
IJCAI
1997
13 years 10 months ago
1997
Planning for real-time applications involves decisions not only about what actions to take in what states to progress toward achieving goals (the traditional decision problem face...
AAAI
1996
13 years 10 months ago
1996
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
Service robots will have to accomplish more and more complex, open-ended tasks and regularly acquire new skills. In this work, we propose a new approach to generating plans for su...
ICTAI
2010
IEEE
13 years 7 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...