4 search results - page 1 / 1 » Compiling Uncertainty Away in Non-Deterministic Conformant P... |
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
It has been shown recently that deterministic conformant planning problems can be translated into classical problems that can be solved by off-the-shelf classical planners. In this...
AAAI
2006
13 years 5 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
CAEPIA
2005
Springer
13 years 10 months ago
2005
Springer
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...
AIPS
2006
13 years 5 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...