Sammenlign metoder
Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.
| Linear Quadratic Regulator× | Hamilton-Jacobi-Bellman-ligningen× | |
|---|---|---|
| Fagfelt | Reguleringsteknikk | Reguleringsteknikk |
| Familie | Machine learning | Machine learning |
| Opprinnelsesår≠ | 1960 | 1957 |
| Opphavsperson≠ | Rudolf Kalman | Richard Bellman |
| Type | algorithm | algorithm |
| Opprinnelig kilde≠ | Kalman, R. E. (1960). Contributions to the theory of optimal control. Boletin de la Sociedad Matematica Mexicana, 5(2), 102-119. link ↗ | Bellman, R. (1957). Dynamic Programming. Princeton University Press. link ↗ |
| Alias≠ | LQR, Linear Quadratic Optimal Control | HJB Equation, Bellman Equation, Dynamic Programming |
| Relaterte≠ | 4 | 3 |
| Sammendrag≠ | The Linear Quadratic Regulator (LQR) is a classical optimal control algorithm that computes a linear feedback law to minimize a quadratic cost function for a linear dynamical system. Introduced by Kalman in 1960, LQR provides a provably optimal, closed-form solution for linear systems and remains fundamental in control theory, robotics, and aerospace applications because of its theoretical elegance and computational efficiency. | 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. |
| ScholarGateDatasett ↗ |
|
|