119 search results - page 5 / 24 » Domain Independent Approaches for Finding Diverse Plans |
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
AI
2000
Springer
13 years 7 months ago
2000
Springer
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from ...
AIPS
2009
13 years 8 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
FLAIRS
2008
13 years 9 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
The problem of efficiently finding images that are similar to a target image has attracted much attention in the image processing community and is rightly considered an informatio...