Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| Уравнение на Хамилтон-Якоби-Белман× | Принцип на Понтрягин за максимума× | |
|---|---|---|
| Област | Теория на управлението | Теория на управлението |
| Семейство | Machine learning | Machine learning |
| Година на възникване≠ | 1957 | 1962 |
| Създател≠ | Richard Bellman | Lev Pontryagin |
| Тип | algorithm | algorithm |
| Основополагащ източник≠ | Bellman, R. (1957). Dynamic Programming. Princeton University Press. link ↗ | Pontryagin, L. S., Boltyanskii, V. G., Gamkrelidze, R. V., & Mischenko, E. F. (1962). The Mathematical Theory of Optimal Processes. John Wiley & Sons. link ↗ |
| Други названия | HJB Equation, Bellman Equation, Dynamic Programming | PMP, Optimal Control, Costate Method |
| Свързани | 3 | 3 |
| Резюме≠ | 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. | The Pontryagin Maximum Principle (PMP) is a fundamental theorem in optimal control theory providing necessary conditions for optimality of a control trajectory. Published by Lev Pontryagin in 1962, PMP generalizes the calculus of variations to control problems with constraints and is the theoretical foundation enabling solution of complex trajectory optimization problems from spacecraft missions to industrial process optimization. |
| ScholarGateНабор от данни ↗ |
|
|