The DOI matches its Crossref record; 132 of the 132 references it cites were found in a registry or an index.
Reinforcement Learning: A Tutorial Survey and Recent Advances
Abstract
In the last few years, reinforcement learning (RL), also called adaptive (or approximate) dynamic programming, has emerged as a powerful tool for solving complex sequential decision-making problems in control theory. Although seminal research in this area was performed in the artificial intelligence (AI) community, more recently it has attracted the attention of optimization theorists because of several noteworthy success stories from operations management. It is on large-scale and complex problems of dynamic optimization, in particular the Markov decision problem (MDP) and its variants, that the power of RL becomes more obvious. It has been known for many years that on large-scale MDPs, the curse of dimensionality and the curse of modeling render classical dynamic programming (DP) ineffective. The excitement in RL stems from its direct attack on these curses, which allows it to solve problems that were considered intractable via classical DP in the past. The success of RL is due to its strong mathematical roots in the principles of DP, Monte Carlo simulation, function approximation, and AI. Topics treated in some detail in this survey are temporal differences, Q-learning, semi-MDPs, and stochastic games. Several recent advances in RL, e.g., policy gradients and hierarchical RL, are covered along with references. Pointers to numerous examples of applications are provided. This overview is aimed at uncovering the mathematical roots of this science so that readers gain a clear understanding of the core concepts and are able to use them in their own research. The survey points to more than 100 references from the literature.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
(1995) · Cited by 10,558
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
Introduction to Reinforcement Learning
Sutton, R. S., & Barto, A. G. (1998) · The MIT Press eBooks · Cited by 6,855
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Puterman, M. L. (1994) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316887 · Cited by 6,024
Watkins, C. (1989) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.17863/cam.132164 · Cited by 5,297
(1999) · Cited by 5,147
Planning and acting in partially observable stochastic domains
Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00023-x · Cited by 4,149
Neural Information Processing Systems
(2018) · The Deep Learning Revolution · doi:10.7551/mitpress/11474.003.0014 · Cited by 3,730
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning
Williams, R. J. (1992) · Machine Learning · doi:10.1007/bf00992696 · Cited by 3,416
Dynamic Programming and Markov Processes.
Freimer, M., & Howard, R. A. (1961) · Journal of the American Statistical Association · doi:10.2307/2282268 · Cited by 3,378
Neuronlike adaptive elements that can solve difficult learning control problems
Barto, A. G., Sutton, R. S., & Anderson, C. W. (1983) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1983.6313077 · Cited by 3,233
Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning
Sutton, R. S., Precup, D., & Singh, S. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00052-1 · Cited by 3,119
Markov games as a framework for multi-agent reinforcement learning
Littman, M. L. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50027-1 · Cited by 2,614
Pfanzagl, J., & Luce, R. D. (1962) · Econometrica · doi:10.2307/1911299 · Cited by 2,469
Konda, V. R., & Tsitsiklis, J. N. (2002) · Cited by 2,202
(2020) · Machine Learning and Visual Perception · doi:10.1515/9783110595567-011 · Cited by 1,930
Advances in Neural Information Processing Systems 5
Zemel, R. S., Williams, C. K. I., & Mozer, M. C. (1993) · Cited by 1,896
Learning Automata: An Introduction
Narendra, K. S., & Thathachar, M. A. L. (1989) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,540
The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
Smallwood, R. D., & Sondik, E. J. (1973) · Operations Research · doi:10.1287/opre.21.5.1071 · Cited by 1,479
On-line Q-learning Using Connectionist Systems
Rummery, G. A. (1994) · Cited by 1,477
Neuro-Dynamic Programming: NDP
Bertsekas, D. P. (2001) · Encyclopedia of Optimization · doi:10.1007/0-306-48332-7_333 · Cited by 1,466
The theory of dynamic programming
Bellman, R. (1954) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1954-09848-8 · Cited by 1,459
Stochastic Approximation Methods for Constrained and Unconstrained Systems
Kushner, H. J., & Clark, D. S. (1978) · Applied Mathematical Sciences · doi:10.1007/978-1-4684-9352-8 · Cited by 1,459
Hierarchical Reinforcement Learning with the MAXQ Value Function Decomposition
Dietterich, T. G. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.639 · Cited by 1,435
Sutton, R. S. (1990) · Machine Learning Proceedings 1990 · doi:10.1016/b978-1-55860-141-3.50030-4 · Cited by 1,314
Introduction to Probability: The Binomial And Normal Probability Distributions
(2003) · Pharmaceutical Statistics · doi:10.1201/9780203912799.ch3 · Cited by 1,208
An analysis of temporal-difference learning with function approximation
Tsitsiklis, J. N., & Van Roy, B. (1997) · IEEE Transactions on Automatic Control · doi:10.1109/9.580874 · Cited by 1,194
Learning to act using real-time dynamic programming
Barto, A. G., Bradtke, S. J., & Singh, S. P. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00011-o · Cited by 1,104
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
Boutilier, C., Dean, T., & Hanks, S. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.575 · Cited by 1,074
Generalization in Reinforcement Learning: Successful Examples Using Sparse Coarse Coding
Sutton, R. S. (1995) · Cited by 1,072
Recent Advances in Hierarchical Reinforcement Learning
Barto, A. G., & Mahadevan, S. (2003) · Discrete Event Dynamic Systems · doi:10.1023/a:1022140919877 · Cited by 1,024
A model for reasoning about persistence and causation
Dean, T., & Kanazawa, K. (1989) · Computational Intelligence · doi:10.1111/j.1467-8640.1989.tb00324.x · Cited by 999
Approximate dynamic programming for real-time control and neural modeling
Werbos, P. J. (1992) · Medical Entomology and Zoology · Cited by 971
Editorial: On Machine Learning
Langley, P. (1986) · Machine Learning · doi:10.1023/a:1022687019898 · Cited by 951
Nash Q-Learning for General-Sum Stochastic Games
Hu, J., Wellman, M. P., & Boutilier, C. (2003) · Cited by 923
Residual Algorithms: Reinforcement Learning with Function Approximation
Baird, L. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50013-x · Cited by 918
Handbook of Intelligent Control: Neural, Fuzzy, and Adaptive Approaches
White, D. A., & Sofge, D. (1992) · Medical Entomology and Zoology · Cited by 827
Near-Optimal Reinforcement Learning in Polynomial Time
Kearns, M., & Singh, S. (2002) · Machine Learning · doi:10.1023/a:1017984413808 · Cited by 792
Practical issues in temporal difference learning
Tesauro, G. (1992) · Machine Learning · doi:10.1007/bf00992697 · Cited by 787
Multiagent learning using a variable learning rate
Bowling, M., & Veloso, M. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00121-2 · Cited by 775
On the Convergence of Stochastic Iterative Dynamic Programming Algorithms
Jaakkola, T., Jordan, M. I., & Singh, S. P. (1994) · Neural Computation · doi:10.1162/neco.1994.6.6.1185 · Cited by 770
Temporal credit assignment in reinforcement learning
Sutton, R. S. (1984) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 749
Monahan, G. E. (1982) · Management Science · doi:10.1287/mnsc.28.1.1 · Cited by 745
A System for Induction of Oblique Decision Trees
Murthy, S. K., Kasif, S., & Salzberg, S. L. (1994) · Cited by 723
The Linear Programming Approach to Approximate Dynamic Programming
de Farias, D. P., & Van Roy, B. (2003) · Operations Research · doi:10.1287/opre.51.6.850.24925 · Cited by 687
Hyper-Heuristics: An Emerging Direction in Modern Search Technology
Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., & Schulenburg, S. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_16 · Cited by 665
Dynamic Programming and Markov Processes.
Kaufman, H., & Howard, R. A. (1961) · The American Mathematical Monthly · doi:10.2307/2312519 · Cited by 638
Reinforcement Learning with Hierarchies of Machines
Parr, R., & Russell, S. (1997) · Cited by 618
Linear Least-Squares algorithms for temporal difference learning
Bradtke, S. J., & Barto, A. G. (1996) · Machine Learning · doi:10.1007/bf00114723 · Cited by 599
Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
Arapostathis, A., Borkar, V. S., Fernández-Gaucherand, E., Ghosh, M. K., & Marcus, S. I. (1993) · SIAM Journal on Control and Optimization · doi:10.1137/0331018 · Cited by 592
A System for Induction of Oblique Decision Trees
Murthy, S. K., Kasif, S., & Salzberg, S. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.63 · Cited by 590
Convergent activation dynamics in continuous time networks
Hirsch, M. W. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90018-x · Cited by 587
Reinforcement learning with replacing eligibility traces
Singh, S. P., & Sutton, R. S. (1996) · Machine Learning · doi:10.1007/bf00114726 · Cited by 575
Sondik, E. J. (1978) · Operations Research · doi:10.1287/opre.26.2.282 · Cited by 536
A survey of algorithmic methods for partially observed Markov decision processes
Lovejoy, W. S. (1991) · Annals of Operations Research · doi:10.1007/bf02055574 · Cited by 532
Value-Function Approximations for Partially Observable Markov Decision Processes
Hauskrecht, M. (2000) · Journal of Artificial Intelligence Research · doi:10.1613/jair.678 · Cited by 527
Infinite-Horizon Policy-Gradient Estimation
Baxter, J., & Bartlett, P. L. (2001) · Cited by 525
A Tabu-Search Hyperheuristic for Timetabling and Rostering
Burke, E. K., Kendall, G., & Soubeiga, E. (2003) · Journal of Heuristics · doi:10.1023/b:heur.0000012446.94732.b6 · Cited by 509
Generalization in Reinforcement Learning: Safely Approximating the Value Function
Boyan, J. A., & Moore, A. (1994) · Cited by 508
The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
Borkar, V. S., & Meyn, S. P. (2000) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012997331639 · Cited by 499
Improving Elevator Performance Using Reinforcement Learning
Crites, R. H., & Barto, A. G. (1995) · Cited by 499
Asynchronous stochastic approximation and Q-learning
Tsitsiklis, J. N. (1994) · Machine Learning · doi:10.1007/bf00993306 · Cited by 453
Stable Function Approximation in Dynamic Programming
Gordon, G. J. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50040-2 · Cited by 446
Feature-based methods for large scale dynamic programming
Tsitsiklis, J. N., & van Roy, B. (1996) · Machine Learning · doi:10.1007/bf00114724 · Cited by 432
Friend-or-Foe Q-learning in General-Sum Games
Littman, M. L. (2001) · International Conference on Machine Learning · Cited by 427
Stochastic approximation with two time scales
Borkar, V. S. (1997) · Systems & Control Letters · doi:10.1016/s0167-6911(97)90015-3 · Cited by 389
Average reward reinforcement learning: Foundations, algorithms, and empirical results
Mahadevan, S. (1996) · Machine Learning · doi:10.1007/bf00114727 · Cited by 385
A reinforcement learning approach to job-shop scheduling
Zhang, W., & Dietterich, T. G. (1995) · Cited by 378
A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms
Monahan, G. E., & MONAHANt, G. E. (2007) · Cited by 368
Kernel-Based Reinforcement Learning
(2017) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7687-1_100235 · Cited by 367
PEGASUS: A Policy Search Method for Large MDPs and POMDPs
Ng, A. Y., & Jordan, M. I. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3878 · Cited by 360
Infinite-Horizon Policy-Gradient Estimation
Baxter, J., & Bartlett, P. L. (2001) · Journal of Artificial Intelligence Research · doi:10.1613/jair.806 · Cited by 343
Even-Dar, E., & Mansour, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_39 · Cited by 314
A Reinforcement Learning Method for Maximizing Undiscounted Rewards
Schwartz, A. (1993) · Machine Learning Proceedings 1993 · doi:10.1016/b978-1-55860-307-3.50045-9 · Cited by 308
Bounded-parameter Markov decision processes
Givan, R., Leach, S., & Dean, T. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00047-3 · Cited by 308
The convergence of TD(?) for general ?
Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992701 · Cited by 275
Gosavi, A. (2003) · Operations Research/Computer Science Interfaces Series · doi:10.1007/978-1-4757-3766-0 · Cited by 271
Self-citationReinforcement Learning Methods for Continuous-Time Markov Decision Problems
Bradtke, S. J., & Duff, M. O. (1994) · Cited by 263
Kernel-Based Reinforcement Learning
Ormoneit, D., & Sen, Ś. (2002) · Machine Learning · doi:10.1023/a:1017928328829 · Cited by 255
Werbos, P. (1987) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1987.289329 · Cited by 251
Input generalization in delayed reinforcement learning: an algorithm and performance comparisons
Chapman, D., & Kaelbling, L. P. (1991) · Cited by 245
Actor-Critic--Type Learning Algorithms for Markov Decision Processes
Konda, V. R., & Borkar, V. S. (1999) · SIAM Journal on Control and Optimization · doi:10.1137/s036301299731669x · Cited by 234
Evolutionary Function Approximation for Reinforcement Learning
Whiteson, S., & Stone, P. (2006) · Cited by 231
Markovian Decision Processes with Uncertain Transition Probabilities
Satia, J. K., & Lave, R. E. (1973) · Operations Research · doi:10.1287/opre.21.3.728 · Cited by 224
Hierarchical control and learning for markov decision processes
Parr, R., & Russell, S. (1998) · Cited by 221
Solving Semi-Markov Decision Problems Using Average Reward Reinforcement Learning
Das, T. K., Gosavi, A., Mahadevan, S., & Marchalleck, N. (1999) · Management Science · doi:10.1287/mnsc.45.4.560 · Cited by 218
Self-citationReinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems
Singh, S. P., & Bertsekas, D. P. (1996) · Cited by 214
Learning rate schedules for faster stochastic gradient search
Darken, C., Chang, J., & Moody, J. (2003) · Neural Networks for Signal Processing II Proceedings of the 1992 IEEE Workshop · doi:10.1109/nnsp.1992.253713 · Cited by 212
Practical Reinforcement Learning in Continuous Spaces
Smart, W. D., & Kaelbling, L. P. (2000) · Cited by 208
Learning Algorithms for Markov Decision Processes with Average Cost
Abounadi, J., Bertsekas, D., & Borkar, V. S. (2001) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012999361974 · Cited by 204
Risk-Sensitive Reinforcement Learning Applied to Control under Constraints
Geibel, P., & Wysotzki, F. (2005) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1666 · Cited by 200
Efficient Learning and Planning Within the Dyna Framework
Peng, J., & Williams, R. J. (1993) · Adaptive Behavior · doi:10.1177/105971239300100403 · Cited by 199
Risk-sensitive reinforcement learning applied to control under constraints
Geibel, P., & Wysotzki, F. (2005) · Cited by 199
Introduction: The Challenge of Reinforcement Learning
Sutton, R. S. (1992) · Machine Learning · doi:10.1007/bf00992695 · Cited by 195
An adaptive optimal controller for discrete-time Markov environments
Witten, I. H. (1977) · Information and Control · doi:10.1016/s0019-9958(77)90354-0 · Cited by 180
Markov Decision Processes with Imprecise Transition Probabilities
White, C. C., & Eldeib, H. K. (1994) · Operations Research · doi:10.1287/opre.42.4.739 · Cited by 168
Asynchronous Stochastic Approximations
Borkar, V. S. (1998) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012995282784 · Cited by 167
Hierarchical multi-agent reinforcement learning
Makar, R., Mahadevan, S., & Ghavamzadeh, M. (2001) · Adaptive Agents and Multi-Agents Systems · doi:10.1145/375735.376302 · Cited by 155
A neuro-dynamic programming approach to retailer inventory management
Roy, B. V., Bertsekas, D. P., Lee, Y., & Tsitsiklis, J. N. (2002) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1997.652501 · Cited by 153
Choosing Search Heuristics by Non-Stationary Reinforcement Learning
Nareyek, A. (2003) · Applied optimization · doi:10.1007/978-1-4757-4137-7_25 · Cited by 146
An Upper Bound on the Loss from Approximate Optimal-Value Functions
Singh, S. P., & Yee, R. C. (1994) · Machine Learning · doi:10.1007/bf00993308 · Cited by 135
GOSAVII, A., Bandla, N., & Das, T. K. (2002) · IIE Transactions · doi:10.1080/07408170208928908 · Cited by 135
Q-Learning for Risk-Sensitive Control
Borkar, V. S. (2002) · Mathematics of Operations Research · doi:10.1287/moor.27.2.294.324 · Cited by 126
Reinforcement learning for long-run average cost
Gosavi, A. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00874-3 · Cited by 122
Self-citationActive Exploration in Dynamic Environments
Thrun, S., & Möller, K. (1991) · Cited by 119
Gosavi, A. (2004) · Machine Learning · doi:10.1023/b:mach.0000019802.64038.6c · Cited by 103
Self-citationGlobal supply chain management: A reinforcement learning approach
Pontrandolfo, P., Gosavi, A., Okogbaa, O. G., & Das, T. K. (2002) · International Journal of Production Research · doi:10.1080/00207540110118640 · Cited by 100
Self-citationModel-based average reward reinforcement learning
Tadepalli, P. V., & Ok, D. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00002-2 · Cited by 100
Decentralized learning in finite Markov chains
Wheeler, R. M., & Narendra, K. S. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104342 · Cited by 98
Decision Tree Function Approximation in Reinforcement Learning
Pyeatt, L. D., & Howe, A. E. (1999) · Cited by 97
Reinforcement Learning in POMDPs with Function Approximation
Kimura, H., Miyazaki, K., & Kobayashi, S. (1997) · International Conference on Machine Learning · Cited by 89
Reinforcement learning algorithms for average-payoff markovian decision processes
Singh, S. P. (1994) · Cited by 79
Learning Optimal Discriminant Functions through a Cooperative Game of Automata
Thathachar, M. A. L., & Sastry, P. S. (1987) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1987.289334 · Cited by 74
Direct value-approximation for factored MDPs
Schuurmans, D., & Patrascu, R. (2001) · Cited by 65
Multilayer control of large Markov chains
Forestier, J.-P., & Varaiya, P. P. (1978) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1978.1101707 · Cited by 64
Reinforcement Learning by Stochastic Hill Climbing on Discounted Reward
Kimura, H., Yamamura, M., & Kobayashi, S. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50044-x · Cited by 62
Solution Procedures for Partially Observed Markov Decision Processes
White, C. C., & Scherer, W. T. (1989) · Operations Research · doi:10.1287/opre.37.5.791 · Cited by 60
Stochastic Approximation for Nonexpansive Maps: Application to Q -Learning Algorithms
Abounadi, J., Bertsekas, D. P., & Borkar, V. S. (2002) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012998346621 · Cited by 59
A tutorial survey of reinforcement learning
Keerthi, S. S., & Ravindran, B. (1994) · Sadhana · doi:10.1007/bf02743935 · Cited by 54
Reinforcement learning by policy search
Kaelbling, L. P., & Peshkin, L. (2002) · Cited by 46
Singh, S. S., Tadić, V. B., & Arnaud Doucet, B. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.02.023 · Cited by 43
A reinforcement learning approach to stochastic business games
Ravulapati, K. K., Rao, J., & Das, T. K. (2004) · IIE Transactions · doi:10.1080/07408170490278698 · Cited by 33
(2000) · Applied Physics Letters · doi:10.1162/153244303768966148 · Cited by 29
Gosavi, A., Das, T. K., & Sarkar, S. (2004) · IIE Transactions · doi:10.1080/07408170490438672 · Cited by 24
Self-citationActor-critic algorithms for hierarchical Markov decision processes
Bhatnagar, S., & Panigrahi, J. R. (2006) · Automatica · doi:10.1016/j.automatica.2005.12.010 · Cited by 21
Cited by
A Survey of Actor-Critic Reinforcement Learning: Standard and Natural Policy Gradients
Grondman, I., Busoniu, L., Lopes, G. A. D., & Babuska, R. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2012.2218595 · Cited by 1,042
Applications of deep learning and reinforcement learning to biological data
Mahmud, M., Kaiser, M. S., Hussain, A., & Vassanelli, S. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2790388 · Cited by 765
Adaptive Dynamic Programming for Control: A Survey and Recent Advances
Liu, D., Xue, S., Zhao, B., Luo, B., & Wei, Q. (2021) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2020.3042876 · Cited by 708
Q-Learning Algorithms: A Comprehensive Classification and Applications
Jang, B., Kim, M., Harerimana, G., & Kim, J. W. (2019) · IEEE Access · doi:10.1109/access.2019.2941229 · Cited by 635
Reinforcement learning for control: Performance, stability, and deep approximators
Buşoniu, L., de Bruin, T., Tolić, D., Kober, J., & Palunko, I. (2018) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2018.09.005 · Cited by 463
Metadata
- Authors
- Gosavi, A.
- Venue
- INFORMS Journal on Computing
- Published
- 2009-05
- Volume
- 21
- Issue
- 2
- Pages
- 178-192
- ISSN
- 0899-1499 (ISSN-L)
- 1091-9856
- 1526-5528
- OpenAlex
- W2095487261
- Cited by
- 326
- References
- 132
- FWCI
- 7.95
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.