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/bg/compare