Markov Decision Processes in Artificial Intelligence 2013
DOI: 10.1002/9781118557426.ch4
|View full text |Cite
|
Sign up to set email alerts
|

Factored Markov Decision Processes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(12 citation statements)
references
References 11 publications
0
12
0
Order By: Relevance
“…Here, this ‘curse of dimensionality’ is problematic because the state space is large (3 Θ states) and eradication actions can occur at any node (2 Θ possible actions), making the number of combinations that must be considered during optimisation excessively large. While factored representations can overcome large state space constraints (Degris & Sigaud ), few techniques exist to deal with large action spaces. We apply a method developed for spatial problems, the graph‐based Markov decision process (GMDP) (Sabbadin, Peyrard & Forsell ).…”
Section: Methodsmentioning
confidence: 99%
“…Here, this ‘curse of dimensionality’ is problematic because the state space is large (3 Θ states) and eradication actions can occur at any node (2 Θ possible actions), making the number of combinations that must be considered during optimisation excessively large. While factored representations can overcome large state space constraints (Degris & Sigaud ), few techniques exist to deal with large action spaces. We apply a method developed for spatial problems, the graph‐based Markov decision process (GMDP) (Sabbadin, Peyrard & Forsell ).…”
Section: Methodsmentioning
confidence: 99%
“…These problems are implemented within the RLPark software package [7]. These particular problems were chosen both because they represent classic benchmarks for RL and they represent a range of reward structures.…”
Section: Problemsmentioning
confidence: 99%
“…Chou et al [18] provide an example of the use of a semi-Markov process for optimizing the time to initiate medical treatment. Factored MDPs recognize that some problems have multiple independent variables that define the state space, a characteristic that can be exploited to some computational advantage (Degris and Sigaud [23]). Another significant extension is to consider the addition of constraints (e.g., constraints on total cost over multiple decision epochs), which leads to challenges in developing algorithms because many such problems no longer retain the attractive decomposable structure of a dynamic program (Altman [3]).…”
Section: Mdp Model Formulationmentioning
confidence: 99%