Sciweavers

771 search results - page 19 / 155
» Markov Decision Processes with Arbitrary Reward Processes
Sort
View
ATAL
2005
Springer
15 years 7 months ago
A polynomial algorithm for decentralized Markov decision processes with temporal constraints
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
Aurélie Beynier, Abdel-Illah Mouaddib
CSL
2007
Springer
15 years 1 months ago
Partially observable Markov decision processes for spoken dialog systems
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 ...
Jason D. Williams, Steve Young
AAAI
2006
15 years 3 months ago
Hard Constrained Semi-Markov Decision Processes
In multiple criteria Markov Decision Processes (MDP) where multiple costs are incurred at every decision point, current methods solve them by minimising the expected primary cost ...
Wai-Leong Yeow, Chen-Khong Tham, Wai-Choong Wong
JAIR
2000
152views more  JAIR 2000»
15 years 1 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
AAAI
2004
15 years 3 months ago
Solving Concurrent Markov Decision Processes
Typically, Markov decision problems (MDPs) assume a single action is executed per decision epoch, but in the real world one may frequently execute certain actions in parallel. Thi...
Mausam, Daniel S. Weld