1146 search results - page 67 / 230 » On the Complexity of Domain-Independent Planning |
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
This paper presents two models of goal generation which enable a motivated autonomous agent to generate goals in response to changes in its underlying drives or motivations, while...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
AIPS
1994
13 years 9 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
AIPS
2009
13 years 9 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...