Dynamic Programming and Optimal Control, Volume I¶
Bertsekas, D. P. (2017). Dynamic Programming and Optimal Control, Volume I.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Dynamic Programming
- In the approximate-DP and deep-RL extensions, function approximation replaces explicit tabulation to scale to state spaces that remain combinatorially vast — trading exactness for applicability at industrial scale.
This sourceAthena Scientific, Belmont, MA. ISBN 9781886529434. Leading reference on DP for optimal control and sequential decision-making: finite-horizon backward induction, infinite-horizon value/policy iteration, and (Ch. 6) approximate DP with parametric/neural value-function approximation and rollout.
- In the approximate-DP and deep-RL extensions, function approximation replaces explicit tabulation to scale to state spaces that remain combinatorially vast — trading exactness for applicability at industrial scale.
- Markov Decision Processes (MDPs)
- … Ray RLlib, TF-Agents, CleanRL, RL4LMs); POMDP libraries (pomdp_py, POMDPs.jl, SARSOP); simulation environments (OpenAI Gym, PettingZoo, DeepMind Control Suite, Isaac Gym, Gymnasium); and textbook literature (Puterman 1994 as the canonical OR MDP reference; Sutton and Barto (2018) for the RL perspective; Bertsekas
This sourceAthena Scientific. Standard reference on dynamic programming and stochastic optimal control covering deterministic and stochastic MDP formulations, approximation methods, and the bridge to neuro-dynamic programming and modern RL.
- … Ray RLlib, TF-Agents, CleanRL, RL4LMs); POMDP libraries (pomdp_py, POMDPs.jl, SARSOP); simulation environments (OpenAI Gym, PettingZoo, DeepMind Control Suite, Isaac Gym, Gymnasium); and textbook literature (Puterman 1994 as the canonical OR MDP reference; Sutton and Barto (2018) for the RL perspective; Bertsekas
Verification¶
Does it exist? Confirmed. This work's ISBN resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:c6482988c51f · see in the full table