Loading...
Please wait, while we are loading the content...
Similar Documents
Approximate Explicit Constrained Linear Model Predictive Control Via Orthogonal Search Tree (2003)
| Content Provider | CiteSeerX |
|---|---|
| Author | Johansen, Tor A. Grancharova, Alexandra Grancharova, Ra |
| Abstract | Solutions to constrained linear model predictive control problems can be pre-computed o#-line in an explicit form as a piecewise linear state feedback on a polyhedral partition of the state space, avoiding real-time optimization. We suggest an algorithm that will determine an approximate explicit piecewise linear state feedback by imposing an orthogonal search tree structure on the partition. This leads to a real-time computational complexity that is logarithmic in the number of regions in the partition, and the algorithm yields guarantees on the sub-optimality, asymptotic stability and constraint fulfillment. |
| File Format | |
| Volume Number | 48 |
| Journal | IEEE Trans. Automatic Control |
| Language | English |
| Publisher Date | 2003-01-01 |
| Access Restriction | Open |
| Subject Keyword | Approximate Explicit Pre-computed Line State Space Explicit Form Linear Model Predictive Control Problem Real-time Computational Complexity Polyhedral Partition Piecewise Linear State Feedback Orthogonal Search Tree Structure Asymptotic Stability Constraint Fulfillment Algorithm Yield Guarantee Real-time Optimization |
| Content Type | Text |
| Resource Type | Article |
