Sciweavers

48 search results - page 4 / 10
» Oracular Partially Observable Markov Decision Processes: A V...
Sort
View
FOCS
2007
IEEE
14 years 4 months ago
Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
Sudipto Guha, Kamesh Munagala
ATAL
2004
Springer
14 years 3 months ago
Interactive POMDPs: Properties and Preliminary Results
This paper presents properties and results of a new framework for sequential decision-making in multiagent settings called interactive partially observable Markov decision process...
Piotr J. Gmytrasiewicz, Prashant Doshi
ATAL
2010
Springer
13 years 11 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 7 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
PERCOM
2007
ACM
14 years 9 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian