Skip to search formSkip to main contentSkip to account menu

Markov decision process

Known as: Value iteration, Policy iteration, Markov decision problems 
Markov decision processes (MDPs) provide a mathematical framework for modeling decision making in situations where outcomes are partly random and… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
In this paper we study the complexity of computing the game bisimulation metric defined by de Alfaro et al. on Markov Decision… 
2008
2008
This paper proposes hybrid ARQ-random network coding frameworks for real-time media broadcast over single-hop wireless networks… 
2006
2006
Software rejuvenation is a preventive and proactive maintenance policy that is particularly useful for counteracting the… 
Highly Cited
2003
Highly Cited
2003
This thesis is divided into two separate parts. The first part is about Dynamic Programming for non-trivial optimal control… 
2003
2003
In this paper, we consider the model that the information on the rewards in vector-valued Markov decision processes includes… 
2002
2002
Markov Decision Processes (MDPs) [7] have developed lately as a standard method for representing uncertainty in decision… 
1998
1998
We present new theoretical results on planning within the framework of temporally abstract reinforcement learning (Precup & Sut… 
1991
1991
(i.e., a Bore1 subset of a complete separable metric space), most of the available results impose on the MDP very restrictive… 
1986
1986
In Markov decision theory we distinguish (a) discrete-time Markov decision processes (b) semi-Markov decision… 
1969
1969
A recently-developed perturbation formalism for finite Markov chains is used here to analyze the policy iteration algorithm for…