Time aggregated Markov decision processes via standard dynamic programming
From MaRDI portal
Recommendations
- A time aggregation approach to Markov decision processes
- Exact decomposition approaches for Markov decision processes: a survey
- A unified approach to time-aggregated Markov decision processes
- The control of a two-level Markov decision process by time aggregation
- Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm
Cites work
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 3361677 (Why is no real title available?)
- A time aggregation approach to Markov decision processes
- Exact finite approximations of average-cost countable Markov decision processes
- Incremental Value Iteration for Time-Aggregated Markov-Decision Processes
- Joint replacement in an operational planning phase
- Markov decision Processes with fractional costs
- Sufficient Classes of Strategies in Discrete Dynamic Programming I: Decomposition of Randomized Strategies and Embedded Models
Cited in
(9)- Temporal concatenation for Markov decision processes
- A multi-cluster time aggregation approach for Markov chains
- Revenue management for operations with urgent orders
- The control of a two-level Markov decision process by time aggregation
- A time aggregation approach to Markov decision processes
- Embedding a state space model into a Markov decision process
- On temporal aggregators and dynamic programming
- A unified approach to time-aggregated Markov decision processes
- Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm
This page was built for publication: Time aggregated Markov decision processes via standard dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635510)
