AIPS
2006
13 years 6 months ago
2006
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
AIPS
2006
13 years 6 months ago
2006
Strong Cyclic Planning aims at generating iterative plans that only allow loops so far as there is a chance to reach the goal. The problem is already significantly complex for ful...
AAAI
2010
13 years 6 months ago
2010
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
ISRR
2005
Springer
13 years 10 months ago
2005
Springer
POMDPs provide a rich framework for planning and control in partially observable domains. Recent new algorithms have greatly improved the scalability of POMDPs, to the point where...