{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T00:42:45Z","timestamp":1773448965017,"version":"3.50.1"},"reference-count":56,"publisher":"Elsevier BV","issue":"4-5","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Control"],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.3166\/ejc.11.310-334","type":"journal-article","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T18:33:25Z","timestamp":1180809205000},"page":"310-334","source":"Crossref","is-referenced-by-count":280,"title":["Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC*"],"prefix":"10.1016","volume":"11","author":[{"given":"Dimitri P.","family":"Bertsekas","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.3166\/ejc.11.310-334_bib0005","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/34.44404","article-title":"Expected-outcome: a general model of static evaluation","volume":"12","author":"Abramson","year":"1990","journal-title":"IEEE Trans Pattern Anal Machine Intell"},{"key":"10.3166\/ejc.11.310-334_bib0010","series-title":"Learning and approximate dynamic programming","author":"Barto","year":"2004"},{"key":"10.3166\/ejc.11.310-334_bib0015","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1009635226865","article-title":"Rollout algorithms for combinatorial optimization","volume":"3","author":"Bertsekas","year":"1997","journal-title":"Heuristics"},{"key":"10.3166\/ejc.11.310-334_bib0020","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/A:1009634810396","article-title":"Rollout algorithms for stochastic scheduling problems","volume":"5","author":"Bertsekas","year":"1999","journal-title":"Heuristics"},{"key":"10.3166\/ejc.11.310-334_bib0025","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.48.4.550.208","article-title":"An approximate dynamic programming approach to multi-dimensional knapsack problems","volume":"4","author":"Bertsimas","year":"2002","journal-title":"Manage Sci"},{"key":"10.3166\/ejc.11.310-334_bib0030","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/trsc.37.3.257.16047","article-title":"Revenue management in a dynamic network environment","volume":"37","author":"Bertsimas","year":"2003","journal-title":"Transportation Sci"},{"key":"10.3166\/ejc.11.310-334_bib0035","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0005-1098(71)90066-5","article-title":"On the minimax reachability of target sets and target tubes","volume":"7","author":"Bertsekas","year":"1971","journal-title":"Automatica"},{"key":"10.3166\/ejc.11.310-334_bib0040","series-title":"Neuro-dynamic programming","author":"Bertsekas","year":"1996"},{"key":"10.3166\/ejc.11.310-334_bib0045","doi-asserted-by":"crossref","unstructured":"Bertsekas DP. Control of uncertain systems with a set-membership description of the uncertainty, Ph.D. Dissertation, Massachusetts Institute of Technology, Cambridge, MA, 1971 (Available in scanned form from the author'swww site).","DOI":"10.1109\/TAC.1971.1099674"},{"key":"10.3166\/ejc.11.310-334_bib0050","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TAC.1972.1100085","article-title":"Infinite time reachability of state space regions by using feedback control","volume":"AC-17","author":"Bertsekas","year":"1972","journal-title":"IEEE TransAutom Control"},{"key":"10.3166\/ejc.11.310-334_bib0055","series-title":"Proceedings of the 1972 IEEE decision and control conference","article-title":"On the solution of some minimax control problems","author":"Bertsekas","year":"1972"},{"key":"10.3166\/ejc.11.310-334_bib0060","series-title":"Proceedingsof the 35th Allerton conference on communication, control, and computing","first-page":"913","article-title":"Differential training of rollout policies","author":"Bertsekas","year":"1997"},{"key":"10.3166\/ejc.11.310-334_bib0065","series-title":"Dynamic programming and optimal control","author":"Bertsekas","year":"2005"},{"key":"10.3166\/ejc.11.310-334_bib0070","series-title":"Rollout algorithms for constrained dynamic programming. Laboratory for Information and Decision Systems Report 2646","author":"Bertsekas","year":"2005"},{"key":"10.3166\/ejc.11.310-334_bib0075","doi-asserted-by":"crossref","first-page":"1747","DOI":"10.1016\/S0005-1098(99)00113-2","article-title":"Set invariance in control\u2014a survey","volume":"35","author":"Blanchini","year":"1999","journal-title":"Automatica"},{"key":"10.3166\/ejc.11.310-334_bib0080","unstructured":"Christodouleas,J.D. Solution Methods for Multiprocessor Network Scheduling Problems with Application to Railroad Operations, Ph.D. Thesis, Operations Research Center, Massachusetts Institute of Technology, 1997."},{"key":"10.3166\/ejc.11.310-334_bib0085","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1023\/B:DISC.0000028199.78776.c4","article-title":"Parallel rollout for online solution of partially observable Markov decision processes","volume":"14","author":"Chang","year":"2004","journal-title":"Discrete Event Dynam Syst"},{"key":"10.3166\/ejc.11.310-334_bib0090","series-title":"Model predictive control","author":"Camacho","year":"2004"},{"key":"10.3166\/ejc.11.310-334_bib0095","first-page":"850","article-title":"The linear programming approach to approximate dynamic programming","volume":"51","author":"de","year":"2003","journal-title":"OperationsRes"},{"key":"10.3166\/ejc.11.310-334_bib0100","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/moor.1040.0094","article-title":"On constraint sampling in the linear programming approach to approximate dynamic programming","volume":"29","author":"de Farias","year":"2004","journal-title":"Math Operations Res"},{"key":"10.3166\/ejc.11.310-334_bib0105","doi-asserted-by":"crossref","DOI":"10.1109\/53.41661","article-title":"Set membership identification in digital signal processing","author":"Deller","year":"1989","journal-title":"IEEE ASSP Mag"},{"key":"10.3166\/ejc.11.310-334_bib0110","series-title":"Dynamic programming and the calculus of variations","author":"Dreyfus","year":"1965"},{"key":"10.3166\/ejc.11.310-334_bib0115","doi-asserted-by":"crossref","first-page":"190","DOI":"10.3166\/ejc.9.190-206","article-title":"State and output feedback nonlinear model predictive control: an overview","volume":"9","author":"Findeisen","year":"2003","journal-title":"Eur J Control"},{"key":"10.3166\/ejc.11.310-334_bib0120","series-title":"Neuro-dynamic programming for radiation treatment planning. Numerical Analysis Group Research Report NA-02\/06","author":"Ferris","year":"2002"},{"key":"10.3166\/ejc.11.310-334_bib0125","first-page":"387","article-title":"Fractionation in radiation treatment planning","volume":"102","author":"Ferris","year":"2004","journal-title":"Math Program B"},{"key":"10.3166\/ejc.11.310-334_bib0130","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1023\/A:1012602011914","article-title":"Label correcting methods to solve multicriteria shortest path problems","volume":"111","author":"Guerriero","year":"2001","journal-title":"J Optim Theory Appl"},{"key":"10.3166\/ejc.11.310-334_bib0135","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/S0167-8191(03)00048-6","article-title":"A Co-operative Parallel Rollout Algorithm for the Sequential Ordering Problem","volume":"29","author":"Guerriero","year":"2003","journal-title":"Parallel Computing"},{"key":"10.3166\/ejc.11.310-334_bib0140","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.3230140109","article-title":"Algorithms for finding paths with multiple constraints","volume":"14","author":"Jaffe","year":"1984","journal-title":"Networks"},{"key":"10.3166\/ejc.11.310-334_bib0145","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1109\/9.148345","article-title":"Set-membership identification of systems with parametric and nonparametric uncertainty","volume":"AC-37","author":"Kosut","year":"1992","journal-title":"IEEE TransAutom Control"},{"key":"10.3166\/ejc.11.310-334_bib0150","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00938540","article-title":"Optimal, infinite horizon feedback laws for a general class of constrained discete time systems: stability and moving-horizon approximations","volume":"57","author":"Keerthi","year":"1988","journal-title":"J Optim Theory Appl"},{"key":"10.3166\/ejc.11.310-334_bib0155","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1137\/S0363012901385691","article-title":"Actor-critic algorithms","volume":"42","author":"Konda","year":"2003","journal-title":"SIAM J Control Optim"},{"key":"10.3166\/ejc.11.310-334_bib0160","unstructured":"Konda VR. Actor-critic algorithms. Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 2002."},{"key":"10.3166\/ejc.11.310-334_bib0165","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1017976211990","article-title":"Building a basic building block scheduler using reinforcement learning and rollouts","volume":"49","author":"McGovern","year":"2002","journal-title":"Mach Learning"},{"key":"10.3166\/ejc.11.310-334_bib0170","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/B:ANOR.0000039520.24932.4b","article-title":"A rollout metaheuristic for job shop scheduling problems","volume":"131","author":"Meloni","year":"2004","journal-title":"Ann OperationsRes"},{"key":"10.3166\/ejc.11.310-334_bib0175","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/S0005-1098(99)00214-9","article-title":"Constrained model predictive control: stability and optimality","volume":"36","author":"Mayne","year":"2000","journal-title":"Automatica"},{"key":"10.3166\/ejc.11.310-334_bib0180","series-title":"Adaptive predictive control. From the concepts to plant optimization","author":"Martin-Sanchez","year":"1996"},{"key":"10.3166\/ejc.11.310-334_bib0185","series-title":"Predictive control with constraints","author":"Maciejowski","year":"2002"},{"key":"10.3166\/ejc.11.310-334_bib0190","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/9.905687","article-title":"Simulation-based optimization of Markov reward processes","volume":"AC-46","author":"Marbach","year":"2001","journal-title":"IEEE Trans Autom Control"},{"key":"10.3166\/ejc.11.310-334_bib0195","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","article-title":"On a multicriteria shortest path problem","volume":"16","author":"Martins","year":"1984","journal-title":"Eur J Operational Res"},{"key":"10.3166\/ejc.11.310-334_bib0200","doi-asserted-by":"crossref","first-page":"87","DOI":"10.3166\/ejc.7.87-99","article-title":"Control of constrained dynamic systems","volume":"7","author":"Mayne","year":"2001","journal-title":"Eur J Control"},{"key":"10.3166\/ejc.11.310-334_bib0205","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/S0098-1354(98)00301-9","article-title":"Model predictive control: Past, present, and future","volume":"23","author":"Morari","year":"1999","journal-title":"Comput Chem Eng"},{"key":"10.3166\/ejc.11.310-334_bib0210","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1016\/S0967-0661(02)00186-7","article-title":"A survey of industrial model predictive control Technology","volume":"11","author":"Qin","year":"2003","journal-title":"Control Eng Practice"},{"key":"10.3166\/ejc.11.310-334_bib0215","article-title":"On relaxed dynamic programming in switching systems","author":"Rantzer","year":"2005","journal-title":"IEE Proc Special Issue Hybrid Syst"},{"key":"10.3166\/ejc.11.310-334_bib0220","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/37.845037","article-title":"Tutorial overview of model predictive control","volume":"20","author":"Rawlings","year":"2000","journal-title":"Control Syst Mag"},{"key":"10.3166\/ejc.11.310-334_bib0225","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1016\/S0305-0548(99)00146-X","article-title":"Comparing neuro-dynamic programming algorithmsfor the vehicle routing problem with stochastic demands","volume":"27","author":"Secomandi","year":"2000","journal-title":"Comput Operations Res"},{"key":"10.3166\/ejc.11.310-334_bib0230","series-title":"Reinforcement Learning","author":"Sutton","year":"1998"},{"key":"10.3166\/ejc.11.310-334_bib0235","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1287\/opre.49.5.796.10608","article-title":"A rollout policy for the vehicle routing problem with stochastic demands","volume":"49","author":"Secomandi","year":"2001","journal-title":"Operations Res"},{"key":"10.3166\/ejc.11.310-334_bib0240","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1025605803490","article-title":"Analysis of a rollout approach to sequencing problems with stochastic routing applications","volume":"9","author":"Secomandi","year":"2003","journal-title":"J Heuristics"},{"key":"10.3166\/ejc.11.310-334_bib0245","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1145\/115234.115368","article-title":"Multiobjective A*","volume":"38","author":"Stewart","year":"1991","journal-title":"J ACM"},{"key":"10.3166\/ejc.11.310-334_bib0250","series-title":"presented at the 1996 Neural Information Processing systems Conference","article-title":"1996 \u201cOn-Line Policy Improvement Using Monte Carlo Search,\u201d","author":"Tesauro","year":"1997"},{"key":"10.3166\/ejc.11.310-334_bib0255","first-page":"86","article-title":"Rollout strategies for sequential fault diagnosis","author":"Tu","year":"2003","journal-title":"IEEE Trans Syst Man Cybernet A"},{"key":"10.3166\/ejc.11.310-334_bib0260","series-title":"Proceedings of the 2nd IEEE CDC","first-page":"4825","article-title":"Congestion control using policy rollout","author":"Wu","year":"2003"},{"key":"10.3166\/ejc.11.310-334_bib0265","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF00934845","article-title":"Application of Jensen's inequality to adaptive suboptimal design","volume":"32","author":"White","year":"1980","journal-title":"J Optim Theory Appl"},{"key":"10.3166\/ejc.11.310-334_bib0270","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0005-1098(69)90112-5","article-title":"Inequalities for the performance of suboptimal uncertain systems","volume":"5","author":"Witsenhausen","year":"1969","journal-title":"Automatica"},{"key":"10.3166\/ejc.11.310-334_bib0275","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/0308004","article-title":"On performance bounds for uncertain systems","volume":"8","author":"Witsenhausen","year":"1970","journal-title":"SIAM J Control"},{"key":"10.3166\/ejc.11.310-334_bib0280","article-title":"Solitaire: man versus machine","volume":"17","author":"Yan","year":"2005","journal-title":"Adv Neural Inform Process Syst"}],"container-title":["European Journal of Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0947358005710402?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0947358005710402?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T04:26:17Z","timestamp":1683865577000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0947358005710402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":56,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["S0947358005710402"],"URL":"https:\/\/doi.org\/10.3166\/ejc.11.310-334","relation":{},"ISSN":["0947-3580"],"issn-type":[{"value":"0947-3580","type":"print"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}