The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Variable Resolution Discretization in Optimal Control
Open accessOverview
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
Markov decision processes: Discrete stochastic dynamic programming
Hazeghi, K., & Puterman, M. L. (1995) · Journal of the American Statistical Association · doi:10.2307/2291177 · Cited by 8,037
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
User’s guide to viscosity solutions of second order partial differential equations
Crandall, M. G., Ishii, H., & Lions, P.-L. (1992) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1992-00266-5 · Cited by 4,781
Fast Learning in Networks of Locally-Tuned Processing Units
Moody, J., & Darken, C. J. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.281 · Cited by 4,194
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
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
Random Number Generation and Quasi-Monte Carlo Methods.
Collings, B. J., & Niederreiter, H. (1993) · Journal of the American Statistical Association · doi:10.2307/2290359 · Cited by 2,884
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
Random Number Generation and Quasi-Monte Carlo Methods
Niederreiter, H. (1992) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970081 · Cited by 2,770
Controlled Markov Processes and Viscosity Solutions
(2006) · Stochastic Modelling and Applied Probability · doi:10.1007/0-387-31071-1 · Cited by 2,684
Knuth, D. E. (1973) · Cumulative Index of Computer Aided Architectural Design · Cited by 1,719
Temporal difference learning and TD-Gammon
Tesauro, G. (1995) · Communications of the ACM · doi:10.1145/203330.203343 · Cited by 1,618
Neuro-Dynamic Programming: NDP
Bertsekas, D. P. (2001) · Encyclopedia of Optimization · doi:10.1007/0-306-48332-7_333 · Cited by 1,466
Dynamic Programming: Deterministic and Stochastic Models
Bertsekas, D. P. (1987) · Medical Entomology and Zoology · Cited by 1,325
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
Generalization in Reinforcement Learning: Successful Examples Using Sparse Coarse Coding
Sutton, R. S. (1995) · Cited by 1,072
Controlled markov processes and viscosity solutions
James, M. R. (1994) · Stochastics and Stochastic Reports · doi:10.1080/17442509408833914 · Cited by 1,024
A combined SVM and LDA approach for classification
Xiong, T., & Cherkassky, V. (2006) · Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005. · doi:10.1109/ijcnn.2005.1556089 · Cited by 980
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
Prioritized sweeping: Reinforcement learning with less data and less time
Moore, A. W., & Atkeson, C. G. (1993) · Machine Learning · doi:10.1007/bf00993104 · Cited by 823
Self-citationTemporal Difference Learning and TD-Gammon
Tesauro, G. (1995) · ICGA Journal · doi:10.3233/icg-1995-18207 · Cited by 764
Numerical Methods for Stochastic Control Problems in Continuous Time
Kushner, H. J., & Dupuis, P. G. (1992) · Springer eBooks · doi:10.1007/978-1-4684-0441-8 · Cited by 625
Kaelbling, L. P. (1993) · doi:10.7551/mitpress/4168.001.0001 · Cited by 599
Generalization in Reinforcement Learning: Safely Approximating the Value Function
Boyan, J. A., & Moore, A. (1994) · Cited by 508
Self-citationImproving Elevator Performance Using Reinforcement Learning
Crites, R. H., & Barto, A. G. (1995) · Cited by 499
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
Gradient Descent for General Reinforcement Learning
Baird, L. C., & Moore, A. (1998) · neural information processing systems · Cited by 261
Self-citationMoore, A. W., & Atkeson, C. G. (1995) · Machine Learning · doi:10.1023/a:1022656217772 · Cited by 259
Self-citationNumerical dynamic programming in economicsPreprint
Rust, J. P. (1996) · RePEc: Research Papers in Economics · Cited by 237
Instance-Based Utile Distinctions for Reinforcement Learning with Hidden State
McCallum, R. A. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50055-4 · Cited by 181
Moore, A. W. (1991) · Machine Learning Proceedings 1991 · doi:10.1016/b978-1-55860-200-7.50069-6 · Cited by 162
Self-citationApproximate Solutions to Markov Decision Processes
Gordon, G. J. (1999) · KiltHub Repository · doi:10.1184/r1/6551972 · Cited by 136
(1993) · Choice Reviews Online · doi:10.5860/choice.31-1560 · Cited by 100
Exploration of Multi-State Environments: Local Measures and Back-Propagation of Uncertainty
Meuleau, N., & Bourgine, P. (1999) · Machine Learning · doi:10.1023/a:1007541107674 · Cited by 91
A self-learning automaton with variable resolution for high precision assembly by industrial robots
Simons, J., Brussel, H. V., Schutter, J. D., & Verhaert, J. (1982) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1982.1103060 · Cited by 83
Minimum-time control of the Acrobot
Boone, G. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1997.606789 · Cited by 82
A Study of Reinforcement Learning in the Continuous Case by the Means of Viscosity Solutions
Munos, R. (2000) · Machine Learning · doi:10.1023/a:1007686309208 · Cited by 75
Self-citationMachine learning : proceedings of the Eighth International Workshop (ML91)
Birnbaum, L. A., & Collins, G. C. (1991) · Cited by 65
Multidimensional Triangulation and Interpolation for Reinforcement Learning
Davies, S. (1996) · Cited by 53
Simplicial mesh generation with applications
Moore, D. W. (1992) · Cornell University eBooks · Cited by 50
Barycentric Interpolators for Continuous Space and Time Reinforcement Learning
Munos, R., & Moore, A. (1998) · Cited by 37
Self-citationReinforcement learning for continuous stochastic control problems
Munos, R., & Bourgine, P. (1998) · HAL · Cited by 29
Self-citation
Cited by
A Comprehensive Survey of Multiagent Reinforcement Learning
Busoniu, L., Babuska, R., & De Schutter, B. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2007.913919 · Cited by 2,235
Deep Reinforcement Learning: A Survey
Wang, X., Wang, S., Liang, X., Zhao, D., Huang, J., Xu, X., Dai, B., & Miao, Q. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3207346 · Cited by 972
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
Residential Demand Response of Thermostatically Controlled Loads Using Batch Reinforcement Learning
Ruelens, F., Claessens, B. J., Vandael, S., De Schutter, B., Babuska, R., & Belmans, R. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2517211 · Cited by 333
QTune: a query-aware database tuning system with deep reinforcement learning
Li, G., Zhou, X., Li, S., & Gao, B. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3352063.3352129 · Cited by 257
Metadata
- Authors
- Munos, R., & Moore, A.
- Venue
- Machine Learning
- Published
- 2002-11
- Volume
- 49
- Issue
- 2-3
- Pages
- 291-323
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1552830313
- Cited by
- 321
- References
- 43
- FWCI
- 15.39
- Type
- journal article
- Language
- en
- Open access
- bronze
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.