ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

动态规划×深度强化学习×
领域优化深度学习
方法族Process / pipelineMachine learning
起源年份19572015
提出者Richard BellmanMnih, V. et al. (DQN)
类型Exact combinatorial optimization via recursive decompositionSequential decision-making (agent–environment interaction)
开创性文献Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6Mnih, V. et al. (2015). Human-Level Control through Deep Reinforcement Learning. Nature, 518, 529–533. DOI ↗
别名DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik ProgramlamaDerin Pekiştirmeli Öğrenme (DQN / PPO / A3C), derin pekiştirmeli öğrenme, deep RL, DRL
相关34
摘要Dynamic Programming (DP) is an exact optimization technique introduced by Richard Bellman in 1957 for solving multi-stage decision problems. It decomposes a complex problem into simpler, overlapping subproblems, solves each subproblem once, and stores the results to avoid redundant computation. Grounded in the Principle of Optimality, DP guarantees globally optimal solutions whenever the problem exhibits overlapping subproblems and optimal substructure.Deep Reinforcement Learning combines neural networks with reinforcement learning so an agent learns by interacting with an environment, popularised by Mnih and colleagues' 2015 Nature work on human-level Atari control. Instead of learning from a fixed labelled dataset, the agent takes actions, observes rewards, and gradually shapes a policy that maximises long-run return.
ScholarGate数据集
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Dynamic Programming · Deep Reinforcement Learning. 于 2026-06-15 检索自 https://scholargate.app/zh/compare