169 search results - page 5 / 34 » Tractability of Planning with Loops |
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelo...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...
AIPS
2009
13 years 8 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
KR
2010
Springer
14 years 7 days ago
2010
Springer