ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

תכנות דינמי מבוסס-סוכן×תכנון דינמי רב-מטרתי×
תחוםסימולציהסימולציה
משפחהProcess / pipelineProcess / pipeline
שנת המקור1957 (DP); 1990s onward (ABM integration)1957-1975
הוגה השיטהBellman, R. (DP foundation); Tesfatsion, L. et al. (ABM-DP integration)Extension of Bellman (1957); formalized by multiple authors from 1970s onward
סוגHybrid simulation-optimizationExact optimization — recursive multi-objective decomposition
מקור מכונןBellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516
כינוייםABDP, Agent-based DP, Multi-agent dynamic programming, ABM-DPMODP, Multi-criteria dynamic programming, Vector dynamic programming, Pareto dynamic programming
קשורות55
תקצירAgent-based dynamic programming (ABDP) embeds Bellman's dynamic programming framework within individual agents of an agent-based model, enabling each agent to solve sequential, multi-stage decision problems using backward induction or value-function iteration. The result is a population of optimizing agents whose interactions generate emergent system-level behavior.Multi-Objective Dynamic Programming (MODP) extends Bellman's classical dynamic programming to settings where a decision-maker must optimize several competing objectives simultaneously across a sequence of stages. Rather than a single optimal policy, it produces a Pareto-optimal set of policies — each representing a distinct trade-off profile — by propagating vector-valued value functions backward through the state space.
ScholarGateמערך נתונים
  1. v1
  2. 2 מקורות
  3. PUBLISHED
  1. v1
  2. 2 מקורות
  3. PUBLISHED

מעבר לחיפוש Download slides

ScholarGateהשוואת שיטות: Agent-based dynamic programming · Multi-objective dynamic programming. אוחזר בתאריך 2026-06-15 מתוך https://scholargate.app/he/compare