Live briefing
Everything about Dynamic programming
Problem optimization method
Dynamic programming (DP) is both a mathematical optimization method and an algorithmic paradigm. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, such as aerospace engineering and economics. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Dynamic programmingA 5-minute orientation
- Skim a recent paper: Recent Progress in Reinforcement Learning and Adaptive Dynamic Programming for Advanced Control ApplicationsInfluential work since 2022
- Pick up a classic book: Traité de dynamiqueThe most-reprinted book on the subject
- Read the landmark paper: Dynamic programming algorithm optimization for spoken word recognitionCited 5,639 times
- Go sideways: Bellman equationA closely related topic
- Go sideways: Matrix chain multiplicationA closely related topic
📖 Definitions
Noun An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Dynamic programming algorithm optimization for spoken word recognition
Dynamic Programming
Discounted Dynamic Programming
Adaptive dynamic programming
Discrete Dynamic Programming
Robust Dynamic Programming
Relaxing Dynamic Programming
Negative Dynamic Programming
🆕 Influential since 2022
Recent Progress in Reinforcement Learning and Adaptive Dynamic Programming for Advanced Control Applications
Mechanochromic, Shape‐Programmable and Self‐Healable Cholesteric Liquid Crystal Elastomers Enabled by Dynamic Covalent Boronic Ester Bonds
Dynamic path planning of mobile robots using adaptive dynamic programming
Context-Based Semantic Communication via Dynamic Programming
Modified dynamic programming for asteroids belt exploration
📚 Books worth reading
Traité de dynamiqueJean Le Rond d'Alembert · 1743
Approximate dynamic programmingWarren B. Powell · 2007- 📕Proteus two-dimensional Navier-Stokes computer code--version 2.0Charles E. Towne · 1993
- 📕Proteus three-dimensional Navier-Stokes computer code--version 1.0Charles E. Towne · 1993
Foundations of non-stationary dynamic programming with discrete time parameterK. Hinderer · 1970
Digital control of dynamic systemsGene F. Franklin · 1980- 📕Dynamic Programming Based Operation of ReservoirsK. D. W. Nandalal, Janos J. Bogardi · 2003
Applied dynamic programmingRichard Ernest Bellman · 1962
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Bellman equation A Bellman equation, named after Richard E. Bellman, is a technique in dynamic programming which breaks an optimization problem into a sequence of simpler…
- Matrix chain multiplication Matrix chain multiplication (or the matrix chain ordering problem) is an optimization problem concerning the most efficient way to multiply a given sequence…
- Exponentiation by squaring In mathematics and computer programming, exponentiating by squaring is a general method for fast computation of large positive integer powers of a number…
- Differential dynamic programming Differential dynamic programming (DDP) is an optimal control algorithm of the trajectory optimization class. The algorithm was introduced in 1966 by Mayne…
- Markov decision process In decision theory, a Markov decision process (MDP) is a mathematical model for sequential decision making when outcomes are uncertain. It is a type of…
- Semidefinite programming Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified…
- Algebraic Riccati equation An algebraic Riccati equation is a type of nonlinear equation that arises in the context of infinite-horizon optimal control problems in continuous time…
- Hamilton–Jacobi–Bellman equation The Hamilton-Jacobi-Bellman (HJB) equation is a nonlinear partial differential equation that provides necessary and sufficient conditions for optimality…