ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

معادله همیلتون-ژاکوبی-بلمن×کنترل پیش‌بین مدل×
حوزهنظریه کنترلنظریه کنترل
خانوادهMachine learningMachine learning
سال پیدایش19571978
پدیدآورRichard BellmanJacques Richalet
نوعalgorithmalgorithm
منبع بنیادینBellman, R. (1957). Dynamic Programming. Princeton University Press. link ↗Richalet, J., Rault, A., Testud, J., & Papon, J. (1978). Model predictive heuristic control. Automatica, 14(5), 413-428. DOI ↗
نام‌های دیگرHJB Equation, Bellman Equation, Dynamic ProgrammingMPC, Receding Horizon Control
مرتبط35
خلاصهThe Hamilton-Jacobi-Bellman (HJB) equation is a partial differential equation characterizing the optimal cost-to-go function in dynamic programming. Developed by Bellman in 1957, HJB provides both necessary and sufficient conditions for optimality, enabling elegant theoretical analysis and numerical solutions for optimal control problems. HJB is fundamental to reinforcement learning, approximate dynamic programming, and real-time control.Model Predictive Control (MPC) is an advanced control strategy that uses an explicit process model to predict future system behavior over a finite horizon and solves an optimization problem at each control step. First formalized by Richalet et al. in 1978, MPC has become the dominant approach in process control industries, from chemical plants to autonomous vehicles, because it naturally handles constraints and can optimize multiple objectives simultaneously.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 3 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Hamilton-Jacobi-Bellman Equation · Model Predictive Control. بازیابی‌شده در 2026-06-18 از https://scholargate.app/fa/compare