The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC*
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
(1995) · Cited by 10,558
Constrained model predictive control: Stability and optimality
Mayne, D. Q., Rawlings, J. B., Rao, C. V., & Scokaert, P. O. M. (2000) · Automatica · doi:10.1016/s0005-1098(99)00214-9 · Cited by 8,736
A survey of industrial model predictive control technology
Qin, S. J., & Badgwell, T. A. (2003) · Control Engineering Practice · doi:10.1016/s0967-0661(02)00186-7 · Cited by 5,099
Predictive Control With Constraints
Maciejowski, J. M. (2001) · Cambridge University Engineering Department Publications Database · Cited by 4,368
Lee, J. H., Kaisare, N. S., & García, C. E. (2007) · Springer eBooks · doi:10.1002/9781394333325.fmatter · Cited by 3,766
Predictive control with constraints
Camacho, E. F. (2003) · Automatica · doi:10.1016/s0005-1098(03)00056-6 · Cited by 3,530
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
Barto, A. G. (1998) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)38315-5 · Cited by 2,976
Blanchini, F. (1999) · Automatica · doi:10.1016/s0005-1098(99)00113-2 · Cited by 2,390
Model predictive control: past, present and future
Morari, M., & H. Lee, J. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00301-9 · Cited by 2,335
Konda, V. R., & Tsitsiklis, J. N. (2002) · Cited by 2,202
Corriou, J.-P. (2004) · Process Control · doi:10.1007/978-1-4471-3848-8_16 · Cited by 1,271
Tutorial overview of model predictive control
(2000) · IEEE Control Systems · doi:10.1109/37.845037 · Cited by 1,108
(2011) · Encyclopedia of Machine Learning · doi:10.1007/978-0-387-30164-8_588 · Cited by 950
Keerthi, S. S., & Gilbert, E. G. (1988) · Journal of Optimization Theory and Applications · doi:10.1007/bf00938540 · Cited by 824
Recursive state estimation for a set-membership description of uncertainty
Bertsekas, D., & Rhodes, I. (1971) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1971.1099674 · Cited by 719
Self-citationKonda, V. R., & Tsitsiklis, J. N. (2003) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012901385691 · Cited by 709
The Linear Programming Approach to Approximate Dynamic Programming
de Farias, D. P., & Van Roy, B. (2003) · Operations Research · doi:10.1287/opre.51.6.850.24925 · Cited by 687
(1997) · An Introduction to Natural Computation · doi:10.7551/mitpress/3917.003.0017 · Cited by 492
On a multicriteria shortest path problem
Martins, E. Q. V. (1984) · European Journal of Operational Research · doi:10.1016/0377-2217(84)90077-8 · Cited by 450
On the minimax reachability of target sets and target tubes
Bertsekas, D. P., & Rhodes, I. B. (1971) · Automatica · doi:10.1016/0005-1098(71)90066-5 · Cited by 436
Self-citationOn Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
de Farias, D. P., & Van Roy, B. (2004) · Mathematics of Operations Research · doi:10.1287/moor.1040.0094 · Cited by 373
State and Output Feedback Nonlinear Model Predictive Control: An Overview
Findeisen, R., Imsland, L., Allgower, F., & Foss, B. A. (2003) · European Journal of Control · doi:10.3166/ejc.9.190-206 · Cited by 355
Simulation-based optimization of Markov reward processes
Marbach, P., & Tsitsiklis, J. N. (2001) · IEEE Transactions on Automatic Control · doi:10.1109/9.905687 · Cited by 306
Dynamic programming and the calculus of variations
Dreyfus, S. E. (1960) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(60)90024-x · Cited by 292
Infinite time reachability of state-space regions by using feedback control
Bertsekas, D. (1972) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1972.1100085 · Cited by 286
Self-citation4 Dynamic Programming and the Calculus of Variations
(1964) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)63116-1 · Cited by 262
Revenue Management in a Dynamic Network Environment
Bertsimas, D., & Popescu, I. (2003) · Transportation Science · doi:10.1287/trsc.37.3.257.16047 · Cited by 250
Set-membership identification of systems with parametric and nonparametric uncertainty
Kosut, R. L., Lau, M. K., & Boyd, S. P. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.148345 · Cited by 230
Stewart, B. S., & White, C. C. (1991) · Journal of the ACM · doi:10.1145/115234.115368 · Cited by 222
Control of Constrained Dynamic Systems
Mayne, D. Q. (2001) · European Journal of Control · doi:10.3166/ejc.7.87-99 · Cited by 214
On-line policy improvement using Monte-Carlo search
Tesauro, G., & Galperin, G. R. (2025) · arXiv · doi:10.48550/arxiv.2501.05407 · Cited by 209
An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
Bertsimas, D., & Demir, R. (2002) · Management Science · doi:10.1287/mnsc.48.4.550.208 · Cited by 147
Expected-outcome: a general model of static evaluation
Abramson, B. D. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.44404 · Cited by 132
Relaxed dynamic programming in switching systems
Rantzer, A. (2006) · IEE Proceedings - Control Theory and Applications · doi:10.1049/ip-cta:20050094 · Cited by 128
Parallel Rollout for Online Solution of Partially Observable Markov Decision Processes
Chang, H. S., Givan, R. L., & Chong, E. K. P. (2004) · Discrete Event Dynamic Systems · doi:10.1023/b:disc.0000028199.78776.c4 · Cited by 77
Application of Jensen's inequality to adaptive suboptimal design
White, C. C., & Harrington, D. P. (1980) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934845 · Cited by 45
Cited by
Deep Reinforcement Learning: A Brief Survey
Arulkumaran, K., Deisenroth, M. P., Brundage, M., & Bharath, A. A. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2743240 · Cited by 4,733
A Brief Survey of Deep Reinforcement Learning
Arulkumaran, K., Deisenroth, M. P., Brundage, M., & Bharath, A. A. (2017) · arXiv · doi:10.48550/arxiv.1708.05866 · Cited by 4,733
Stochastic Model Predictive Control: An Overview and Perspectives for Future Research
(2016) · IEEE Control Systems · doi:10.1109/mcs.2016.2602087 · Cited by 923
Reinforcement Learning and Dynamic Programming Using Function Approximators
Busoniu, L., Babuska, R., De Schutter, B., & Ernst, D. (2017) · CRC Press eBooks · doi:10.1201/9781439821091 · Cited by 919
Reinforcement learning for control: Performance, stability, and deep approximators
Buşoniu, L., de Bruin, T., Tolić, D., Kober, J., & Palunko, I. (2018) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2018.09.005 · Cited by 463
Metadata
- Authors
- Bertsekas, D. P.
- Venue
- European Journal of Control
- Publisher
- Elsevier BV
- Published
- 2005-01
- Volume
- 11
- Issue
- 4-5
- Pages
- 310-334
- ISSN
- 0947-3580 (ISSN-L)
- OpenAlex
- W2027968610
- Cited by
- 366
- References
- 37
- FWCI
- 20.09
- 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.