قارن الطرق

	البرمجة الديناميكية القائمة على الوكيل	البرمجة الديناميكية
المجال	المحاكاة	التحسين
العائلة	Process / pipeline	Process / pipeline
سنة النشأة	1957 (DP); 1990s onward (ABM integration)	1957
صاحب الطريقة	Bellman, R. (DP foundation); Tesfatsion, L. et al. (ABM-DP integration)	Richard Bellman
النوع	Hybrid simulation-optimization	Exact combinatorial optimization via recursive decomposition
المصدر التأسيسي	Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516	Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6
الأسماء البديلة	ABDP, Agent-based DP, Multi-agent dynamic programming, ABM-DP	DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama
ذات صلة	5	3
الملخص	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.	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.