829 search results - page 13 / 166 » A time aggregation approach to Markov decision processes |
NIPS
2003
15 years 1 months ago
2003
Approximate linear programming (ALP) has emerged recently as one of the most promising methods for solving complex factored MDPs with finite state spaces. In this work we show th...
MOR
2007
14 years 11 months ago
2007
We consider the problem of solving a nonhomogeneous infinite horizon Markov Decision Process (MDP) problem in the general case of potentially multiple optimal first period polic...
117
click to vote
CSL
2007
Springer
14 years 11 months ago
2007
Springer
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...
90
Voted
ATAL
2004
Springer
15 years 5 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
100
click to vote
ICML
2010
IEEE
15 years 25 days ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...