ScholarGate
助手

方法对比

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

约束规划×深度强化学习×
领域优化深度学习
方法族Process / pipelineMachine learning
起源年份20062015
提出者Rossi, van Beek & WalshMnih, V. et al. (DQN)
类型Declarative combinatorial optimizationSequential decision-making (agent–environment interaction)
开创性文献Rossi, F., van Beek, P., & Walsh, T. (Eds.). (2006). Handbook of Constraint Programming. Elsevier. ISBN: 978-0-444-52726-4Mnih, V. et al. (2015). Human-Level Control through Deep Reinforcement Learning. Nature, 518, 529–533. DOI ↗
别名Constraint Satisfaction Programming, Constraint-Based Optimization, Kısıt Programlama, CSP OptimizationDerin Pekiştirmeli Öğrenme (DQN / PPO / A3C), derin pekiştirmeli öğrenme, deep RL, DRL
相关34
摘要Constraint Programming (CP) is a declarative optimization paradigm in which a problem is formulated as a set of variables, finite domains, and constraints, and a solver systematically searches for assignments that satisfy all constraints. Formalized comprehensively by Rossi, van Beek, and Walsh in their 2006 Handbook of Constraint Programming, CP unifies propagation-based pruning with intelligent backtracking search to tackle combinatorial problems across scheduling, planning, and configuration domains.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方法对比: Constraint Programming · Deep Reinforcement Learning. 于 2026-06-15 检索自 https://scholargate.app/zh/compare