{"id":"https://openalex.org/W2013614847","doi":null,"title":"Dynamic Programming and Optimal Control, Vol. II","display_name":"Dynamic Programming and Optimal Control, Vol. II","publication_year":1976,"publication_date":"1976-01-01","ids":{"openalex":"https://openalex.org/W2013614847","mag":"2013614847"},"language":"en","primary_location":{"id":"mag:2013614847","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=1396348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"book","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039911471","display_name":"Dimitri P. Bertsekas","orcid":"https://orcid.org/0000-0001-6909-7208","observed_orcids":["https://orcid.org/0000-0001-6909-7208"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dimitri P. Bertsekas","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6909-7208","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5039911471"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":315,"citation_normalized_percentile":{"value":0.17721519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.005400000140070915,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.0013000000035390258,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9909999966621399},{"id":"https://openalex.org/keywords/optimal-control","display_name":"optimal control","score":0.9850000143051147},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.8799999952316284},{"id":"https://openalex.org/keywords/sequential-decision-making-under-uncertainty","display_name":"sequential decision making under uncertainty","score":0.8690000176429749},{"id":"https://openalex.org/keywords/discrete-optimization","display_name":"discrete optimization","score":0.7829999923706055},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9020000100135803},{"id":"https://openalex.org/keywords/infinite-horizon-problems","display_name":"infinite horizon problems","score":0.9039999842643738},{"id":"https://openalex.org/keywords/infinite-state-spaces","display_name":"infinite state spaces","score":0.6759999990463257},{"id":"https://openalex.org/keywords/stochastic-shortest-path","display_name":"stochastic shortest path","score":0.9110000133514404},{"id":"https://openalex.org/keywords/contraction-mapping-principle","display_name":"contractive mappings","score":0.7960000038146973},{"id":"https://openalex.org/keywords/approximate-dynamic-programming","display_name":"approximate dynamic programming","score":0.9319999814033508},{"id":"https://openalex.org/keywords/stochastic-dynamic-programming","display_name":"stochastic dynamic programming","score":0.859000027179718}],"concepts":[{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.8111642599105835},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.6080416440963745},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.6045576333999634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6016781330108643},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.5319628715515137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5244389176368713},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4454381465911865},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.44443291425704956},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.43253079056739807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30926385521888733},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3047128915786743},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2721312642097473},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13239797949790955},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2013614847","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=1396348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1544193923","https://openalex.org/W2098432798","https://openalex.org/W2305373430","https://openalex.org/W2603840577","https://openalex.org/W2002444764","https://openalex.org/W2780455245","https://openalex.org/W6999959684","https://openalex.org/W2132264384","https://openalex.org/W3178729124","https://openalex.org/W7098350205"],"abstract_inverted_index":{"A":[0,62,176],"major":[1,63],"revision":[2],"of":[3,7,15,56,79,95,110,122,135,142,158,163,192],"the":[4,11,57,69,80,107,123,159,180,203],"second":[5,39],"volume":[6,40],"a":[8,132,189],"textbook":[9],"on":[10,98,179],"far-ranging":[12],"algorithmic":[13],"methododogy":[14],"Dynamic":[16],"Programming,":[17],"which":[18,105],"can":[19,199],"be":[20,186,200],"used":[21],"for":[22,188],"optimal":[23],"control,":[24],"Markovian":[25],"decision":[26,31],"problems,":[27,137],"planning":[28],"and":[29,35,46,48,67,77,115,138,161,171],"sequential":[30],"making":[32],"under":[33],"uncertainty,":[34],"discrete/combinatorial":[36],"optimization.":[37],"The":[38],"is":[41],"oriented":[42],"towards":[43],"mathematical":[44,181],"analysis":[45,134,141],"computation,":[47],"treats":[49],"infinite":[50,149,167],"horizon":[51],"problems":[52,170],"extensively.":[53],"New":[54],"features":[55],"3rd":[58],"edition":[59],"are:":[60],"1)":[61],"enlargement":[64],"in":[65,166,172,202],"size":[66],"scope:":[68],"length":[70],"has":[71,83],"increased":[72],"by":[73],"more":[74],"than":[75,92,128],"50%,":[76],"most":[78],"old":[81],"material":[82,198],"been":[84],"restructured":[85],"and/or":[86],"revised.":[87],"2)":[88],"Extensive":[89],"coverage":[90],"(more":[91,127],"100":[93,129],"pages)":[94],"recent":[96],"research":[97],"simulation-based":[99],"approximate":[100],"dynamic":[101,111,194],"programming":[102,112],"(neuro-dynamic":[103],"programming),":[104],"allow":[106],"practical":[108],"application":[109],"to":[113,148],"large":[114],"complex":[116],"problems.":[117,144,155],"3)":[118],"An":[119,146],"in-depth":[120],"development":[121],"average":[124],"cost":[125],"problem":[126],"pages),":[130],"including":[131],"full":[133],"multichain":[136],"an":[139],"extensive":[140],"infinite-spaces":[143],"4)":[145],"introduction":[147],"state":[150,168],"space":[151,169],"stochastic":[152,193],"shortest":[153],"path":[154],"5)":[156],"Expansion":[157],"theory":[160,191],"use":[162],"contraction":[164],"mappings":[165],"neuro-dynamic":[173],"programming.":[174,195],"6)":[175],"substantive":[177],"appendix":[178],"measure-theoretic":[182],"issues":[183],"that":[184],"must":[185],"addressed":[187],"rigorous":[190],"Much":[196],"supplementary":[197],"found":[201],"book's":[204],"web":[205],"page:":[206],"http://www.athenasc.com/dpbook.html":[207]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":19},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":19},{"year":2015,"cited_by_count":27},{"year":2014,"cited_by_count":28},{"year":2013,"cited_by_count":28},{"year":2012,"cited_by_count":23}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}