20 search results - page 3 / 4 » Generating Plans in Concurrent, Probabilistic, Over-Subscrib... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
While much work on learning in planning focused on learning domain physics (i.e., action models), and search control knowledge, little attention has been paid towards learning use...
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 ...
CRV
2011
IEEE
12 years 7 months ago
2011
IEEE
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...
AIPS
2006
13 years 8 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 ...
AAAI
2008
13 years 9 months ago
2008
This paper investigates hindsight optimization as an approach for leveraging the significant advances in deterministic planning for action selection in probabilistic domains. Hind...