Sciweavers

15 search results - page 2 / 3
» Incremental plan aggregation for generating policies in MDPs
Sort
View
ICML
2005
IEEE
14 years 5 months ago
Coarticulation: an approach for generating concurrent plans in Markov decision processes
We study an approach for performing concurrent activities in Markov decision processes (MDPs) based on the coarticulation framework. We assume that the agent has multiple degrees ...
Khashayar Rohanimanesh, Sridhar Mahadevan
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 4 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
AAAI
2008
13 years 6 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
AAAI
2010
13 years 5 months ago
Trial-Based Dynamic Programming for Multi-Agent Planning
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they en...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
AAAI
1997
13 years 5 months ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan