Simulation-based algorithms for Markov decision processes.
From MaRDI portal
Publication:870662
zbMath1155.90002MaRDI QIDQ870662
Jiaqiao Hu, Steven I. Marcus, Michael C. Fu, Hyeong Soo Chang
Publication date: 13 March 2007
Published in: Communications and Control Engineering (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Markov and semi-Markov decision processes (90C40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (23)
Approximate policy iteration: a survey and some new methods ⋮ A review of stochastic algorithms with continuous value function approximation and some new approximate policy iteration algorithms for multidimensional continuous applications ⋮ Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm ⋮ Computable approximations for continuous-time Markov decision processes on Borel spaces based on empirical measures ⋮ New approximate dynamic programming algorithms for large-scale undiscounted Markov decision processes and their application to optimize a production and distribution system ⋮ Adaptive aggregation for reinforcement learning in average reward Markov decision processes ⋮ Optimization of Markov decision processes under the variance criterion ⋮ Simulation-based optimization of Markov decision processes: an empirical process theory approach ⋮ Risk-Sensitive Reinforcement Learning via Policy Gradient Search ⋮ Sleeping experts and bandits approach to constrained Markov decision processes ⋮ The optimal control of just-in-time-based production and distribution systems and performance comparisons with optimized pull systems ⋮ Mean field Markov decision processes ⋮ CONIC TRADING IN A MARKOVIAN STEADY STATE ⋮ A \(Sarsa(\lambda)\) algorithm based on double-layer fuzzy reasoning ⋮ Approximation of Markov decision processes with general state space ⋮ Strategic capacity decision-making in a stochastic manufacturing environment using real-time approximate dynamic programming ⋮ Approximation of discounted minimax Markov control problems and zero-sum Markov games using Hausdorff and Wasserstein distances ⋮ Variance-penalized Markov decision processes: dynamic programming and reinforcement learning techniques ⋮ Sampled fictitious play for approximate dynamic programming ⋮ Computable approximations for average Markov decision processes in continuous time ⋮ Coupling based estimation approaches for the average reward performance potential in Markov chains ⋮ What you should know about approximate dynamic programming ⋮ Stochastic approximations of constrained discounted Markov decision processes
This page was built for publication: Simulation-based algorithms for Markov decision processes.
