A Q-learning algorithm for Markov decision processes with continuous state spaces
From MaRDI portal
Recommendations
- Convergence of a Q-learning variant for continuous states and actions
- Online learning in Markov decision processes with continuous actions
- Approximate Q Learning for Controlled Diffusion Processes and Its Near Optimality
- An Online Policy Gradient Algorithm for Markov Decision Processes with Continuous States and Actions
- Approximate stochastic annealing for online control of infinite horizon Markov decision processes
Cites work
- Approximate Dynamic Programming
- Approximate stochastic annealing for online control of infinite horizon Markov decision processes
- Asynchronous stochastic approximation and Q-learning
- Convergence results for single-step on-policy reinforcement-learning algorithms
- scientific article; zbMATH DE number 5957269 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 1999206 (Why is no real title available?)
- Interpolation of spatial data. Some theory for kriging
- Markov chains and stochastic stability
- New algorithms of the Q-learning type
- Reinforcement learning: a tutorial survey and recent advances
- Simulation-based algorithms for Markov decision processes
- Stochastic kriging for simulation metamodeling
Cited in
(1)
This page was built for publication: A Q-learning algorithm for Markov decision processes with continuous state spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569411)
