Square root method for computationally efficient model predictive control
US7197485B2 · kind B2 · utility
93Cited by
3References
34Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Jul 16, 2003 |
| Grant date | Mar 27, 2007 |
| Priority date | — |
| Expiry date | Oct 4, 2024 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG05B13/048
- WIPO fieldControl
- WIPO sectorInstruments
Abstract
An efficient method for solving a model predictive control problem is described. A large sparse matrix equation is formed based upon the model predictive control problem. The square root of H, Hr, is then formed directly, without first forming H. A square root (LSMroot) of a large sparse matrix of the large sparse matrix equation is then formed using Hr in each of a plurality of iterations of a quadratic programming solver, without first forming the large sparse matrix and without recalculating Hr in each of the plurality of iterations. The solution of the large sparse matrix equation is completed based upon LSMroot.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.