The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Learning to control an inverted pendulum using neural networks
Abstract
An inverted pendulum is simulated as a control task with the goal of learning to balance the pendulum with no a priori knowledge of the dynamics. In contrast to other applications of neural networks to the inverted pendulum task, performance feedback is assumed to be unavailable on each step, appearing only as a failure signal when the pendulum falls or reaches the bounds of a horizontal track. To solve this task, the controller must deal with issues of delayed performance evaluation, learning under uncertainty, and the learning of nonlinear functions. Reinforcement and temporal-difference learning methods are presented that deal with these issues to avoid unstable conditions and balance the pendulum.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Parallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations
Rumelhart, D. E., McClelland, J. L., & AU (1986) · doi:10.7551/mitpress/5236.001.0001 · Cited by 15,686
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148
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
Self-citationToward a modern theory of adaptive networks: Expectation and prediction.
Sutton, R. S., & Barto, A. G. (1981) · Psychological Review · doi:10.1037/0033-295x.88.2.135 · Cited by 1,450
Connectionist learning procedures
Hinton, G. E. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90049-0 · Cited by 1,430
Temporal credit assignment in reinforcement learning
Sutton, R. S. (1984) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 749
Sensor-based control of robotic manipulators using a general learning algorithm
Miller, W. (1987) · IEEE Journal on Robotics and Automation · doi:10.1109/jra.1987.1087081 · Cited by 310
Duncan, R., & Kumar, K. S. (1968) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1968.1098972 · Cited by 257
Strategy Learning with Multilayer Connectionist Representations
Anderson, C. W. (1987) · Proceedings of the Fourth International Workshop on MACHINE LEARNING · doi:10.1016/b978-0-934613-41-5.50014-3 · Cited by 195
Self-citationTraining and tracking in robotics
Selfridge, O. G., Sutton, R. S., & Barto, A. G. (1985) · Cited by 116
Cited by
Evolving Neural Networks through Augmenting Topologies
Stanley, K. O., & Miikkulainen, R. (2002) · Evolutionary Computation · doi:10.1162/106365602320169811 · Cited by 3,258
Neural networks for control systems—A survey
Hunt, K. J., Sbarbaro, D., Żbikowski, R., & Gawthrop, P. J. (1992) · Automatica · doi:10.1016/0005-1098(92)90053-i · Cited by 1,864
Neural-network-based fuzzy logic control and decision system
Lin, C.-T., & Lee, C. S. G. (1991) · IEEE Transactions on Computers · doi:10.1109/12.106218 · Cited by 1,480
Neural networks for self-learning control systems
Nguyen, D. H., & Widrow, B. (1990) · IEEE Control Systems Magazine · doi:10.1109/37.55119 · Cited by 856
Combinations of genetic algorithms and neural networks: a survey of the state of the art
Schaffer, J. D., Whitley, D., & Eshelman, L. J. (2003) · [Proceedings] COGANN-92: International Workshop on Combinations of Genetic Algorithms and Neural Networks · doi:10.1109/cogann.1992.273950 · Cited by 570
Reinforcement learning is direct adaptive optimal control
(1992) · IEEE Control Systems · doi:10.1109/37.126844 · Cited by 524
Incremental Evolution of Complex General Behavior
Gomez, F., & Miikkulainen, R. (1997) · Adaptive Behavior · doi:10.1177/105971239700500305 · Cited by 428
A Taxonomy for Artificial Embryogeny
Stanley, K. O., & Miikkulainen, R. (2003) · Artificial Life · doi:10.1162/106454603322221487 · Cited by 425
Evolutionary Algorithms for Reinforcement Learning
Moriarty, D. E., Schultz, A. C., & Grefenstette, J. J. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.613 · Cited by 340
Efficient reinforcement learning through symbiotic evolution
Moriarty, D. E., & Miikkulainen, R. (1996) · Machine Learning · doi:10.1007/bf00114722 · Cited by 325
Rai, R., & Sahu, C. K. (2020) · IEEE Access · doi:10.1109/access.2020.2987324 · Cited by 315
Neural-net computing and the intelligent control of systems
PAO, Y.-H., PHILLIPS, S. M., & SOBAJIC, D. J. (1992) · International Journal of Control · doi:10.1080/00207179208934315 · Cited by 307
POET: open-ended coevolution of environments and their optimized solutions
Wang, R., Lehman, J., Clune, J., & Stanley, K. O. (2019) · Proceedings of the Genetic and Evolutionary Computation Conference · doi:10.1145/3321707.3321799 · Cited by 61
Wang, R., Lehman, J., Rawal, A., Zhi, J., Li, Y., Clune, J., & Stanley, K. O. (2020) · arXiv · doi:10.48550/arxiv.2003.08536 · Cited by 53
Metadata
- Authors
- Anderson, C. W.
- Venue
- IEEE Control Systems Magazine
- Published
- 1989-04
- Volume
- 9
- Issue
- 3
- Pages
- 31-37
- ISSN
- 0272-1708 (ISSN-L)
- OpenAlex
- W2102295697
- Cited by
- 540
- References
- 11
- FWCI
- 17.19
- 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.