The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Discrete-Time Deterministic $Q$ -Learning: A Novel Convergence Analysis
Abstract
In this paper, a novel discrete-time deterministic Q -learning algorithm is developed. In each iteration of the developed Q -learning algorithm, the iterative Q function is updated for all the state and control spaces, instead of updating for a single state and a single control in traditional Q -learning algorithm. A new convergence criterion is established to guarantee that the iterative Q function converges to the optimum, where the convergence criterion of the learning rates for traditional Q -learning algorithms is simplified. During the convergence analysis, the upper and lower bounds of the iterative Q function are analyzed to obtain the convergence criterion, instead of analyzing the iterative Q function itself. For convenience of analysis, the convergence properties for undiscounted case of the deterministic Q -learning algorithm are first developed. Then, considering the discounted factor, the convergence criterion for the discounted case is established. Neural networks are used to approximate the iterative Q function and compute the iterative control law, respectively, for facilitating the implementation of the deterministic Q -learning algorithm. Finally, simulation results and comparisons are given to illustrate the performance of the developed algorithm.
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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
Al-Tamimi, A., Lewis, F. L., & Abu-Khalaf, M. (2007) · Automatica · doi:10.1016/j.automatica.2006.09.019 · Cited by 611
Self-citationVamvoudakis, K. G., & Lewis, F. L. (2011) · Automatica · doi:10.1016/j.automatica.2011.03.005 · Cited by 525
Self-citationXu, H., Jagannathan, S., & Lewis, F. L. (2012) · Automatica · doi:10.1016/j.automatica.2012.03.007 · Cited by 230
Self-citation
Cited by
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
Self-citationA survey of device-to-device communications: research issues and challenges
Jameel, F., Hamid, Z., Jabeen, F., Zeadally, S., & Javed, M. A. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2828120 · Cited by 536
AFRL: Adaptive federated reinforcement learning for intelligent jamming defense in FANET
Mowla, N. I., Tran, N. H., Doh, I., & Chae, K. (2020) · Journal of Communications and Networks · doi:10.1109/jcn.2020.000015 · Cited by 146
Metadata
- Authors
- Wei, Q., Lewis, F. L., Sun, Q., Yan, P., & Song, R.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2017-05
- Volume
- 47
- Issue
- 5
- Pages
- 1224-1237
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2329769476
- Cited by
- 200
- References
- 5
- FWCI
- 25.31
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Discrete-Time Deterministic $Q$ -Learning: A Novel Convergence Analysis. https://app.cochat.ai/papers/10.1109/tcyb.2016.2542923
- The paper
- Wei, Q., Lewis, F. L., Sun, Q., Yan, P., & Song, R. (2017). Discrete-Time Deterministic $Q$ -Learning: A Novel Convergence Analysis. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2016.2542923
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.