5 search results - page 1 / 1 » On polynomial cases of the unichain classification problem f... |
ORL
2008
13 years 4 months ago
2008
The unichain classification problem detects whether a finite state and action MDP is unichain under all deterministic policies. This problem is NP-hard [11]. This paper provides p...
ICONIP
2009
13 years 2 months ago
2009
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
SIGECOM
2009
ACM
13 years 11 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
We consider the problem of estimating the policy gradient in Partially Observable Markov Decision Processes (POMDPs) with a special class of policies that are based on Predictive ...