방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 해밀턴-야코비-벨만 방정식× | 모델 예측 제어× | |
|---|---|---|
| 분야 | 제어이론 | 제어이론 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1957 | 1978 |
| 창시자≠ | Richard Bellman | Jacques Richalet |
| 유형 | algorithm | algorithm |
| 원전≠ | 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 Programming | MPC, Receding Horizon Control |
| 관련≠ | 3 | 5 |
| 요약≠ | 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데이터셋 ↗ |
|
|