विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| रेखीय द्विघात नियामक (Linear Quadratic Regulator - LQR)× | हैमिल्टन-जैकोबी-बेलमैन समीकरण× | |
|---|---|---|
| क्षेत्र | नियंत्रण सिद्धांत | नियंत्रण सिद्धांत |
| परिवार | Machine learning | Machine learning |
| उद्भव वर्ष≠ | 1960 | 1957 |
| प्रवर्तक≠ | Rudolf Kalman | Richard Bellman |
| प्रकार | algorithm | algorithm |
| मौलिक स्रोत≠ | 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 ↗ |
| उपनाम≠ | LQR, Linear Quadratic Optimal Control | HJB Equation, Bellman Equation, Dynamic Programming |
| संबंधित≠ | 4 | 3 |
| सारांश≠ | 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. |
| ScholarGateडेटासेट ↗ |
|
|