The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Convergence of discretization procedures in dynamic programming
Abstract
The computational solution of discrete-time stochastic optimal control problems by dynamic programming requires, in most cases, discretization of the state and control spaces whenever these spaces are infinite. In this short paper we consider a discretization procedure often employed in practice. Under certain compactness and Lipschitz continuity assumptions we show that the solution of the discretized algorithm converges to the solution of the continuous algorithm, as the discretization grids become finer and finer. Furthermore, any control law obtained from the discretized algorithm results in a value of the cost functional which converges to the optimal value of the 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
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Cited by
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139620 · Cited by 416
Using Randomization to Break the Curse of Dimensionality
Rust, J. (1997) · Econometrica · doi:10.2307/2171751 · Cited by 407
The Stochastic Inventory Routing Problem with Direct Deliveries
Kleywegt, A. J., Nori, V. S., & Savelsbergh, M. W. P. (2002) · Transportation Science · doi:10.1287/trsc.36.1.94.574 · Cited by 311
Approximate information state for partially observed systems
Subramanian, J., & Mahajan, A. (2019) · 2019 IEEE 58th Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029898 · Cited by 23
Metadata
- Authors
- Bertsekas, D.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1975-06
- Volume
- 20
- Issue
- 3
- Pages
- 415-419
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2046637502
- Cited by
- 181
- References
- 1
- FWCI
- 2.64
- 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: Convergence of discretization procedures in dynamic programming. https://app.cochat.ai/papers/10.1109/tac.1975.1100984
- The paper
- Bertsekas, D. (1975). Convergence of discretization procedures in dynamic programming. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1975.1100984
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.