Sciweavers

280 search results - page 40 / 56
» Planning for Markov Decision Processes with Sparse Stochasti...
Sort
View
ICTAI
2009
IEEE
14 years 9 months ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...
NIPS
2001
15 years 1 months ago
Predictive Representations of State
We show that states of a dynamical system can be usefully represented by multi-step, action-conditional predictions of future observations. State representations that are grounded...
Michael L. Littman, Richard S. Sutton, Satinder P....
ICML
1998
IEEE
16 years 18 days ago
Value Function Based Production Scheduling
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
Jeff G. Schneider, Justin A. Boyan, Andrew W. Moor...
AAAI
2006
15 years 1 months ago
Decision Making in Uncertain Real-World Domains Using DT-Golog
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...
Mikhail Soutchanski, Huy Pham, John Mylopoulos
AAAI
2012
13 years 2 months ago
Tree-Based Solution Methods for Multiagent POMDPs with Delayed Communication
Planning under uncertainty is an important and challenging problem in multiagent systems. Multiagent Partially Observable Markov Decision Processes (MPOMDPs) provide a powerful fr...
Frans Adriaan Oliehoek, Matthijs T. J. Spaan