ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Determinističko dinamičko programiranje×Stohastično dinamičko programiranje×
PodručjeSimulacijaSimulacija
ObiteljProcess / pipelineProcess / pipeline
Godina nastanka19571957
TvoracRichard E. BellmanBellman, R.; formalized for stochastic settings by Puterman, M. L.
VrstaExact sequential optimization algorithmSequential optimization under uncertainty
Temeljni izvorBellman, R. E. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093
Drugi naziviDDP, Deterministic DP, Classical Dynamic Programming, Bellman Dynamic ProgrammingSDP, Markov Decision Process, MDP, Stochastic DP
Srodne66
SažetakDeterministic Dynamic Programming (DDP) is a mathematical optimization technique that decomposes a multi-stage decision problem into a sequence of simpler subproblems, solving them exactly when all system parameters — transition functions, costs, and rewards — are known with certainty. It guarantees a globally optimal policy via Bellman's principle of optimality.Stochastic Dynamic Programming (SDP) is a mathematical optimization framework for sequential decision problems where outcomes are partly random. It extends Bellman's principle of optimality to stochastic environments, representing problems as Markov Decision Processes (MDPs) and computing optimal policies by solving recursive value equations over states and time periods.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretraživanje Download slides

ScholarGateUsporedite metode: Deterministic Dynamic Programming · Stochastic Dynamic Programming. Preuzeto 2026-06-15 s https://scholargate.app/hr/compare