The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Value and Policy Iterations in Optimal Control and Adaptive Dynamic Programming
Abstract
In this paper, we consider discrete-time infinite horizon problems of optimal control to a terminal set of states. These are the problems that are often taken as the starting point for adaptive dynamic programming. Under very general assumptions, we establish the uniqueness of the solution of Bellman's equation, and we provide convergence results for value and policy iterations.
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
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
Cited by
Adaptive Critic Nonlinear Robust Control: A Survey
Wang, D., He, H., & Liu, D. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2712188 · Cited by 374
Reinforcement learning-based optimal tracking control of an unknown unmanned surface vehicle
Wang, N., Gao, Y., Zhao, H., & Ahn, C. K. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.3009214 · Cited by 322
“In this context, the value iteration [38], [39] has been becoming much more popular in solving the optimal control problem of continuous-time nonlinear systems.”
Wang, J., Wu, J., Shen, H., Cao, J., & Rutkowski, L. (2023) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2022.3220537 · Cited by 321
Data-Driven Performance-Prescribed Reinforcement Learning Control of an Unmanned Surface Vehicle
Wang, N., Gao, Y., & Zhang, X. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3056444 · Cited by 282
Metadata
- Authors
- Bertsekas, D. P.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2017-03
- Volume
- 28
- Issue
- 3
- Pages
- 500-509
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W1680219837
- Cited by
- 238
- References
- 2
- FWCI
- 8.98
- 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: Value and Policy Iterations in Optimal Control and Adaptive Dynamic Programming. https://app.cochat.ai/papers/10.1109/tnnls.2015.2503980
- The paper
- Bertsekas, D. P. (2017). Value and Policy Iterations in Optimal Control and Adaptive Dynamic Programming. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2015.2503980
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.