The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Adaptive linear quadratic control using policy iteration
Abstract
In this paper we present the stability and convergence results for dynamic programming-based reinforcement learning applied to linear quadratic regulation (LQR). The specific algorithm we analyze is based on Q-learning and it is proven to converge to an optimal controller provided that the underlying system is controllable and a particular signal vector is persistently excited. This is the first convergence result for DP-based reinforcement learning algorithms for a continuous problem.
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
Watkins, C. (1989) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.17863/cam.132164 · Cited by 5,297
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148
Adaptive filtering, prediction and control
Ioannou, P. (1985) · Automatica · doi:10.1016/0005-1098(85)90014-7 · Cited by 4,480
Adaptive filtering prediction and control
Goodwin, G. C., & Sin, K. S. (1984) · Cited by 3,400
Dynamic Programming: Deterministic and Stochastic Models
Bertsekas, D. P. (1987) · Medical Entomology and Zoology · Cited by 1,325
On an iterative technique for Riccati equation computations
Kleinman, D. (1968) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1968.1098829 · Cited by 1,210
Werbos, P. (1987) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1987.289329 · Cited by 251
Practical Issues in Temporal Difference Learning
Tesauro, G. J. (1992) · Machine Learning · doi:10.1023/a:1022624705476 · Cited by 41
Neural network based process optimization and control
Sofge, D., & White, D. A. (1990) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.1990.203400 · Cited by 39
Incremental dynamic programming for on-line adaptive optimal control
Bradtke, S. J. (1995) · Cited by 37
Self-citation
Cited by
Reinforcement learning and adaptive dynamic programming for feedback control
Lewis, F. L., & Vrabie, D. (2009) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2009.933854 · Cited by 1,558
From model-based control to data-driven control: Survey, classification and perspective
Hou, Z.-S., & Wang, Z. (2013) · Information Sciences · doi:10.1016/j.ins.2012.07.014 · Cited by 1,405
Prokhorov, D. V., & Wunsch, D. C. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.623201 · Cited by 1,186
(2012) · IEEE Control Systems · doi:10.1109/mcs.2012.2214134 · Cited by 1,105
Discrete-Time Nonlinear HJB Solution Using Approximate Dynamic Programming: Convergence Proof
Al-Tamimi, A., Lewis, F. L., & Abu-Khalaf, M. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.926614 · Cited by 1,075
Metadata
- Authors
- Bradtke, S. J., Ydstie, B. E., & Barto, A. G.
- Venue
- Proceedings of 1994 American Control Conference - ACC '94
- Publisher
- IEEE
- Published
- 2005-08-24
- Volume
- 3
- Pages
- 3475-3479
- ISSN
- 0743-1619 (ISSN-L)
- OpenAlex
- W1616818660
- Cited by
- 404
- References
- 10
- FWCI
- 7.44
- Type
- conference paper
- 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.