Approximate explicit constrained linear model predictive control via orthogonal search tree
No Thumbnail Available
Date
2003-05-01
External link to pdf file
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0037955662&origin=inward
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Solutions to constrained linear model predictive control problems can be precomputed offline 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 suboptimality, asymptotic stability and constraint fulfillment.