280 search results - page 41 / 56 » Planning for Markov Decision Processes with Sparse Stochasti... |
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
105
click to vote
ROBOCUP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Two main challenges of robot action planning in real domains are uncertain action effects and dynamic environments. In this paper, an instance-based action model is lear...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
—This paper introduces a new algorithm for probabilistic motion planning in arbitrary, uncertain vector fields, with emphasis on high-level planning for Montgolfier´e balloons...
IJRR
2008
14 years 9 months ago
2008
We develop a new motion planning algorithm for a variant of a Dubins car with binary left/right steering and apply it to steerable needles, a new class of flexible beveltip medica...
AI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...