Solving Semi-Markov Decision Problems Using Average Reward Reinforcement Learning
From MaRDI portal
Publication:3116659
DOI10.1287/mnsc.45.4.560zbMath1231.90225OpenAlexW2075754841MaRDI QIDQ3116659
Abhijit Gosavi, Sridhar Mahadevan, Tapas K. Das, Nicholas Marchalleck
Publication date: 12 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/45295aa0fd92ecbad325ab8ba856ad8207ba3310
Related Items (15)
On undiscounted semi-Markov decision processes with absorbing states ⋮ New approximate dynamic programming algorithms for large-scale undiscounted Markov decision processes and their application to optimize a production and distribution system ⋮ Reinforcement learning for joint pricing, lead-time and scheduling decisions in make-to-order systems ⋮ The optimal control of just-in-time-based production and distribution systems and performance comparisons with optimized pull systems ⋮ A heuristically accelerated reinforcement learning method for maintenance policy of an assembly line ⋮ Approximate dynamic programming for capacity allocation in the service industry ⋮ Reinforcement learning for long-run average cost. ⋮ Application of reinforcement learning to the game of Othello ⋮ The explicit form of the rate function for semi-Markov processes and its contractions ⋮ Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning ⋮ A simulation-based approach to study stochastic inventory-planning games ⋮ A performance-centred approach to optimising maintenance of complex systems ⋮ Representation and Timing in Theories of the Dopamine System ⋮ A Neurocomputational Model for Cocaine Addiction ⋮ Look-ahead control of conveyor-serviced production station by using potential-based online policy iteration
This page was built for publication: Solving Semi-Markov Decision Problems Using Average Reward Reinforcement Learning
