Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Prinsip Maksimum Pontryagin× | Persamaan Hamilton-Jacobi-Bellman× | |
|---|---|---|
| Bidang | Teori Kawalan | Teori Kawalan |
| Keluarga | Machine learning | Machine learning |
| Tahun asal≠ | 1962 | 1957 |
| Pengasas≠ | Lev Pontryagin | Richard Bellman |
| Jenis | algorithm | algorithm |
| Sumber perintis≠ | Pontryagin, L. S., Boltyanskii, V. G., Gamkrelidze, R. V., & Mischenko, E. F. (1962). The Mathematical Theory of Optimal Processes. John Wiley & Sons. link ↗ | Bellman, R. (1957). Dynamic Programming. Princeton University Press. link ↗ |
| Alias | PMP, Optimal Control, Costate Method | HJB Equation, Bellman Equation, Dynamic Programming |
| Berkaitan | 3 | 3 |
| Ringkasan≠ | 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. | 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. |
| ScholarGateSet data ↗ |
|
|