ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Δυναμικός Προγραμματισμός×Προγραμματισμός Περιορισμών×Βαθιά Ενισχυτική Μάθηση×
ΠεδίοΒελτιστοποίησηΒελτιστοποίησηΒαθιά Μάθηση
ΟικογένειαProcess / pipelineProcess / pipelineMachine learning
Έτος προέλευσης195720062015
ΔημιουργόςRichard BellmanRossi, van Beek & WalshMnih, V. et al. (DQN)
ΤύποςExact combinatorial optimization via recursive decompositionDeclarative combinatorial optimizationSequential decision-making (agent–environment interaction)
Θεμελιώδης πηγήBellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6Rossi, 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 ↗
Εναλλακτικές ονομασίεςDP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik ProgramlamaConstraint Satisfaction Programming, Constraint-Based Optimization, Kısıt Programlama, CSP OptimizationDerin Pekiştirmeli Öğrenme (DQN / PPO / A3C), derin pekiştirmeli öğrenme, deep RL, DRL
Συναφείς334
Σύνοψη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.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. 1 Πηγές
  3. PUBLISHED
  1. v1
  2. 2 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Download slides

ScholarGateΣύγκριση μεθόδων: Dynamic Programming · Constraint Programming · Deep Reinforcement Learning. Ανακτήθηκε στις 2026-06-15 από https://scholargate.app/el/compare