66 search results - page 5 / 14 » Using Caching to Solve Larger Probabilistic Planning Problem... |
247
Voted
CRV
2011
IEEE
14 years 3 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...
125
Voted
ATAL
2010
Springer
15 years 4 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 ...
124
Voted
FLAIRS
2009
15 years 1 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...
165
Voted
ECP
1997
Springer
15 years 7 months ago
1997
Springer
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
154
Voted
JAIR
2010
15 years 2 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...