350 search results - page 25 / 70 » Complexity of Planning with Partial Observability |
IJCAI
1989
13 years 10 months ago
1989
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
SRDS
1999
IEEE
14 years 1 months ago
1999
IEEE
Validating distributed systems is particularly difficult, since failures may occur due to a correlated occurrence of faults in different parts of the system. This paper describes ...
PKDD
2010
Springer
13 years 7 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
FLAIRS
2009
13 years 6 months ago
2009
In our experiments with four well-known systems for solving partially observable planning problems (Contingent-FF, MBP, PKS, and POND), we were greatly surprised to find that they...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...