140 search results - page 2 / 28 » Possibilistic Planning: Representation and Complexity |
CORR
1998
Springer
13 years 4 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...
IDEAL
2010
Springer
13 years 3 months ago
2010
Springer
Automated Planning is a very active area of research within Artificial Intelligence. Broadly this discipline deals with the methods by which an agent can independently determine t...
AI
2010
Springer
13 years 5 months ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
IJCAI
2001
13 years 6 months ago
2001
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
This paper addresses the problem of plan recognition for multiagent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. T...