Sciweavers

102 search results - page 12 / 21
» MDPs with Non-Deterministic Policies
Sort
View
NCI
2004
185views Neural Networks» more  NCI 2004»
13 years 9 months ago
Hierarchical reinforcement learning with subpolicies specializing for learned subgoals
This paper describes a method for hierarchical reinforcement learning in which high-level policies automatically discover subgoals, and low-level policies learn to specialize for ...
Bram Bakker, Jürgen Schmidhuber
UAI
1998
13 years 8 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr
AIPS
2009
13 years 8 months ago
Minimal Sufficient Explanations for Factored Markov Decision Processes
Explaining policies of Markov Decision Processes (MDPs) is complicated due to their probabilistic and sequential nature. We present a technique to explain policies for factored MD...
Omar Zia Khan, Pascal Poupart, James P. Black
AIPS
2009
13 years 8 months ago
Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners
Finite-state and memoryless controllers are simple action selection mechanisms widely used in domains such as videogames and mobile robotics. Memoryless controllers stand for func...
Blai Bonet, Héctor Palacios, Hector Geffner
AAAI
2008
13 years 9 months ago
Towards Faster Planning with Continuous Resources in Stochastic Domains
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
Janusz Marecki, Milind Tambe